./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:24,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:24,545 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 21:55:24,553 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:24,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:24,603 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:24,604 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:24,605 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:24,606 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:24,606 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:24,606 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:55:24,608 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:55:24,608 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:24,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:24,611 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:24,612 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:24,612 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:55:24,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:24,613 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:55:24,617 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:24,617 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:55:24,618 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:55:24,618 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:55:24,619 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:55:24,619 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:55:24,619 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:24,620 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:55:24,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:55:24,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:24,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:24,633 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:24,633 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:55:24,633 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:55:24,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:24,634 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:24,634 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:55:24,634 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:55:24,635 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:55:24,635 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:55:24,635 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:55:24,635 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:55:24,636 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:55:24,636 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_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/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_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa [2024-10-31 21:55:24,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:24,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:24,969 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:24,970 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:24,970 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:24,971 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i Unable to find full path for "g++" [2024-10-31 21:55:27,006 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:55:27,311 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:55:27,315 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2024-10-31 21:55:27,335 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/ba11f6392/8f54bc559638467a924f922b6d059136/FLAG041da448e [2024-10-31 21:55:27,355 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/ba11f6392/8f54bc559638467a924f922b6d059136 [2024-10-31 21:55:27,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:55:27,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:55:27,362 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:27,362 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:55:27,368 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:55:27,370 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,371 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11509cb1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:27, skipping insertion in model container [2024-10-31 21:55:27,371 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:27" (1/1) ... [2024-10-31 21:55:27,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:55:27,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:27,963 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:55:28,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:28,089 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:55:28,089 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28 WrapperNode [2024-10-31 21:55:28,090 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:28,091 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:28,091 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:55:28,091 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:55:28,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,117 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,149 INFO L138 Inliner]: procedures = 175, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2024-10-31 21:55:28,150 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:28,153 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:55:28,153 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:55:28,154 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:55:28,165 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,194 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-31 21:55:28,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,206 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,212 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,217 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:55:28,219 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:55:28,219 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:55:28,220 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:55:28,221 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (1/1) ... [2024-10-31 21:55:28,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:28,256 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:28,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:28,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:55:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 21:55:28,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 21:55:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 21:55:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 21:55:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 21:55:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:55:28,304 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 21:55:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 21:55:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 21:55:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 21:55:28,305 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 21:55:28,305 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 21:55:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:55:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 21:55:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 21:55:28,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:55:28,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:55:28,308 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:55:28,486 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:55:28,488 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:55:29,217 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:55:29,218 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:55:29,818 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:55:29,818 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:55:29,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:29 BoogieIcfgContainer [2024-10-31 21:55:29,819 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:55:29,823 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:55:29,824 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:55:29,838 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:55:29,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:55:27" (1/3) ... [2024-10-31 21:55:29,839 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32613a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:29, skipping insertion in model container [2024-10-31 21:55:29,839 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:28" (2/3) ... [2024-10-31 21:55:29,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32613a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:29, skipping insertion in model container [2024-10-31 21:55:29,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:29" (3/3) ... [2024-10-31 21:55:29,845 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2024-10-31 21:55:29,875 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:55:29,875 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-31 21:55:29,875 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:55:29,985 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:55:30,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 146 flow [2024-10-31 21:55:30,082 INFO L124 PetriNetUnfolderBase]: 2/64 cut-off events. [2024-10-31 21:55:30,082 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:30,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 64 events. 2/64 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 204 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 66. Up to 2 conditions per place. [2024-10-31 21:55:30,090 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 67 transitions, 146 flow [2024-10-31 21:55:30,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 64 transitions, 137 flow [2024-10-31 21:55:30,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:55:30,120 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@25e7ab90, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:55:30,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2024-10-31 21:55:30,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 21:55:30,127 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 21:55:30,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:30,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:30,128 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 21:55:30,129 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:30,135 INFO L85 PathProgramCache]: Analyzing trace with hash 17967606, now seen corresponding path program 1 times [2024-10-31 21:55:30,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095041005] [2024-10-31 21:55:30,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:30,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:30,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:30,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095041005] [2024-10-31 21:55:30,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095041005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:30,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:30,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:55:30,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354713753] [2024-10-31 21:55:30,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:30,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:30,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:30,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:30,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:30,663 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-31 21:55:30,665 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 137 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:30,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:30,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-31 21:55:30,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:31,614 INFO L124 PetriNetUnfolderBase]: 1505/2570 cut-off events. [2024-10-31 21:55:31,615 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:31,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4859 conditions, 2570 events. 1505/2570 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 19061 event pairs, 1505 based on Foata normal form. 112/1899 useless extension candidates. Maximal degree in co-relation 4848. Up to 2258 conditions per place. [2024-10-31 21:55:31,650 INFO L140 encePairwiseOnDemand]: 48/67 looper letters, 27 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2024-10-31 21:55:31,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 45 transitions, 155 flow [2024-10-31 21:55:31,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:55:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2024-10-31 21:55:31,665 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.527363184079602 [2024-10-31 21:55:31,667 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 137 flow. Second operand 3 states and 106 transitions. [2024-10-31 21:55:31,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 45 transitions, 155 flow [2024-10-31 21:55:31,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 45 transitions, 152 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 21:55:31,674 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 98 flow [2024-10-31 21:55:31,676 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2024-10-31 21:55:31,680 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -18 predicate places. [2024-10-31 21:55:31,680 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 98 flow [2024-10-31 21:55:31,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:31,681 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:31,681 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 21:55:31,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:55:31,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:31,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:31,683 INFO L85 PathProgramCache]: Analyzing trace with hash 17967607, now seen corresponding path program 1 times [2024-10-31 21:55:31,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:31,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509167070] [2024-10-31 21:55:31,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:31,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:31,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:31,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:31,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509167070] [2024-10-31 21:55:31,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509167070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:31,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:31,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:55:31,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246456492] [2024-10-31 21:55:31,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:31,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:31,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:31,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:31,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:31,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-31 21:55:31,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:31,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:31,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-31 21:55:31,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:32,202 INFO L124 PetriNetUnfolderBase]: 501/941 cut-off events. [2024-10-31 21:55:32,203 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:32,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1749 conditions, 941 events. 501/941 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 6261 event pairs, 501 based on Foata normal form. 0/863 useless extension candidates. Maximal degree in co-relation 1743. Up to 784 conditions per place. [2024-10-31 21:55:32,211 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 20 selfloop transitions, 1 changer transitions 1/39 dead transitions. [2024-10-31 21:55:32,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 39 transitions, 130 flow [2024-10-31 21:55:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:32,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:55:32,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2024-10-31 21:55:32,215 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43781094527363185 [2024-10-31 21:55:32,215 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 98 flow. Second operand 3 states and 88 transitions. [2024-10-31 21:55:32,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 39 transitions, 130 flow [2024-10-31 21:55:32,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 39 transitions, 129 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:55:32,217 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 85 flow [2024-10-31 21:55:32,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2024-10-31 21:55:32,219 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2024-10-31 21:55:32,219 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 85 flow [2024-10-31 21:55:32,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:32,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:32,220 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:32,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:55:32,221 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:32,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:32,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1966473153, now seen corresponding path program 1 times [2024-10-31 21:55:32,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:32,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835491136] [2024-10-31 21:55:32,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:32,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:32,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:32,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:32,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835491136] [2024-10-31 21:55:32,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835491136] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:32,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:32,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:55:32,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542805248] [2024-10-31 21:55:32,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:32,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:32,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:32,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:32,389 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-31 21:55:32,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:32,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:32,423 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-31 21:55:32,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:32,704 INFO L124 PetriNetUnfolderBase]: 419/924 cut-off events. [2024-10-31 21:55:32,704 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:32,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 924 events. 419/924 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 6414 event pairs, 91 based on Foata normal form. 0/864 useless extension candidates. Maximal degree in co-relation 1604. Up to 517 conditions per place. [2024-10-31 21:55:32,713 INFO L140 encePairwiseOnDemand]: 63/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-31 21:55:32,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 191 flow [2024-10-31 21:55:32,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:32,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:55:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2024-10-31 21:55:32,715 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48756218905472637 [2024-10-31 21:55:32,715 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 85 flow. Second operand 3 states and 98 transitions. [2024-10-31 21:55:32,715 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 191 flow [2024-10-31 21:55:32,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 190 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:55:32,717 INFO L231 Difference]: Finished difference. Result has 50 places, 38 transitions, 94 flow [2024-10-31 21:55:32,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=50, PETRI_TRANSITIONS=38} [2024-10-31 21:55:32,718 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2024-10-31 21:55:32,718 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 38 transitions, 94 flow [2024-10-31 21:55:32,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:32,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:32,719 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:32,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:55:32,719 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:32,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:32,720 INFO L85 PathProgramCache]: Analyzing trace with hash 4949778, now seen corresponding path program 1 times [2024-10-31 21:55:32,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:32,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811548054] [2024-10-31 21:55:32,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:32,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:32,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:32,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:32,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:32,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811548054] [2024-10-31 21:55:32,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811548054] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:32,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:32,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:32,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789445297] [2024-10-31 21:55:32,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:32,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:32,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:32,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:32,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:32,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-31 21:55:32,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 38 transitions, 94 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:32,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:32,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-31 21:55:32,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:33,174 INFO L124 PetriNetUnfolderBase]: 391/880 cut-off events. [2024-10-31 21:55:33,174 INFO L125 PetriNetUnfolderBase]: For 78/78 co-relation queries the response was YES. [2024-10-31 21:55:33,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 880 events. 391/880 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6000 event pairs, 83 based on Foata normal form. 0/860 useless extension candidates. Maximal degree in co-relation 1672. Up to 472 conditions per place. [2024-10-31 21:55:33,183 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-31 21:55:33,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 52 transitions, 194 flow [2024-10-31 21:55:33,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:33,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 21:55:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2024-10-31 21:55:33,188 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.43283582089552236 [2024-10-31 21:55:33,188 INFO L175 Difference]: Start difference. First operand has 50 places, 38 transitions, 94 flow. Second operand 4 states and 116 transitions. [2024-10-31 21:55:33,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 52 transitions, 194 flow [2024-10-31 21:55:33,189 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 52 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:55:33,191 INFO L231 Difference]: Finished difference. Result has 50 places, 37 transitions, 90 flow [2024-10-31 21:55:33,191 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=50, PETRI_TRANSITIONS=37} [2024-10-31 21:55:33,193 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -22 predicate places. [2024-10-31 21:55:33,193 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 37 transitions, 90 flow [2024-10-31 21:55:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:33,194 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:33,194 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:33,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:55:33,194 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:33,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:33,195 INFO L85 PathProgramCache]: Analyzing trace with hash -880971003, now seen corresponding path program 1 times [2024-10-31 21:55:33,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:33,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705766577] [2024-10-31 21:55:33,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:33,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:33,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:33,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705766577] [2024-10-31 21:55:33,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705766577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:33,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:33,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:55:33,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051563350] [2024-10-31 21:55:33,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:33,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:33,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:33,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:33,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:33,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 67 [2024-10-31 21:55:33,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 37 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:33,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:33,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 67 [2024-10-31 21:55:33,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:33,909 INFO L124 PetriNetUnfolderBase]: 363/694 cut-off events. [2024-10-31 21:55:33,909 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2024-10-31 21:55:33,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 694 events. 363/694 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 3998 event pairs, 181 based on Foata normal form. 16/698 useless extension candidates. Maximal degree in co-relation 1426. Up to 428 conditions per place. [2024-10-31 21:55:33,915 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/51 dead transitions. [2024-10-31 21:55:33,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 188 flow [2024-10-31 21:55:33,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:33,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 21:55:33,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 115 transitions. [2024-10-31 21:55:33,917 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4291044776119403 [2024-10-31 21:55:33,917 INFO L175 Difference]: Start difference. First operand has 50 places, 37 transitions, 90 flow. Second operand 4 states and 115 transitions. [2024-10-31 21:55:33,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 188 flow [2024-10-31 21:55:33,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 51 transitions, 183 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 21:55:33,919 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 85 flow [2024-10-31 21:55:33,919 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=85, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-10-31 21:55:33,920 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -23 predicate places. [2024-10-31 21:55:33,920 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 85 flow [2024-10-31 21:55:33,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:33,921 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:33,921 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:33,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:55:33,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:33,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 442279588, now seen corresponding path program 1 times [2024-10-31 21:55:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:33,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610959401] [2024-10-31 21:55:33,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:33,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:33,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:33,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610959401] [2024-10-31 21:55:33,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610959401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:33,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:33,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 21:55:33,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932570809] [2024-10-31 21:55:33,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:33,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 21:55:33,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:33,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 21:55:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 21:55:34,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 67 [2024-10-31 21:55:34,002 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:34,002 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:34,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 67 [2024-10-31 21:55:34,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:34,222 INFO L124 PetriNetUnfolderBase]: 363/707 cut-off events. [2024-10-31 21:55:34,223 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2024-10-31 21:55:34,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1447 conditions, 707 events. 363/707 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 4470 event pairs, 363 based on Foata normal form. 24/701 useless extension candidates. Maximal degree in co-relation 1439. Up to 574 conditions per place. [2024-10-31 21:55:34,229 INFO L140 encePairwiseOnDemand]: 65/67 looper letters, 17 selfloop transitions, 1 changer transitions 1/35 dead transitions. [2024-10-31 21:55:34,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 35 transitions, 121 flow [2024-10-31 21:55:34,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 21:55:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 21:55:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2024-10-31 21:55:34,230 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38308457711442784 [2024-10-31 21:55:34,231 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 85 flow. Second operand 3 states and 77 transitions. [2024-10-31 21:55:34,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 35 transitions, 121 flow [2024-10-31 21:55:34,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 35 transitions, 118 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 21:55:34,234 INFO L231 Difference]: Finished difference. Result has 48 places, 34 transitions, 80 flow [2024-10-31 21:55:34,234 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=80, PETRI_PLACES=48, PETRI_TRANSITIONS=34} [2024-10-31 21:55:34,236 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -24 predicate places. [2024-10-31 21:55:34,237 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 34 transitions, 80 flow [2024-10-31 21:55:34,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:34,238 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:34,239 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:34,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 21:55:34,239 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:34,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:34,240 INFO L85 PathProgramCache]: Analyzing trace with hash 442279106, now seen corresponding path program 1 times [2024-10-31 21:55:34,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:34,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311054955] [2024-10-31 21:55:34,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:34,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:34,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:34,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:34,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311054955] [2024-10-31 21:55:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311054955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:34,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:34,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276843286] [2024-10-31 21:55:34,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:34,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:34,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:34,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:34,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:34,547 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 67 [2024-10-31 21:55:34,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 34 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:34,549 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:34,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 67 [2024-10-31 21:55:34,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:35,138 INFO L124 PetriNetUnfolderBase]: 983/1726 cut-off events. [2024-10-31 21:55:35,138 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 21:55:35,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3598 conditions, 1726 events. 983/1726 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11092 event pairs, 149 based on Foata normal form. 0/1666 useless extension candidates. Maximal degree in co-relation 3590. Up to 838 conditions per place. [2024-10-31 21:55:35,151 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 28 selfloop transitions, 2 changer transitions 39/82 dead transitions. [2024-10-31 21:55:35,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 82 transitions, 328 flow [2024-10-31 21:55:35,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:55:35,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 21:55:35,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 207 transitions. [2024-10-31 21:55:35,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.38619402985074625 [2024-10-31 21:55:35,153 INFO L175 Difference]: Start difference. First operand has 48 places, 34 transitions, 80 flow. Second operand 8 states and 207 transitions. [2024-10-31 21:55:35,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 82 transitions, 328 flow [2024-10-31 21:55:35,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 82 transitions, 327 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 21:55:35,155 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 93 flow [2024-10-31 21:55:35,156 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=93, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-10-31 21:55:35,157 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-31 21:55:35,157 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 93 flow [2024-10-31 21:55:35,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:35,157 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:35,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:35,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 21:55:35,158 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:35,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:35,159 INFO L85 PathProgramCache]: Analyzing trace with hash 364234849, now seen corresponding path program 1 times [2024-10-31 21:55:35,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:35,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816534449] [2024-10-31 21:55:35,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:35,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:35,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:35,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816534449] [2024-10-31 21:55:35,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816534449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:35,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:35,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:35,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136874986] [2024-10-31 21:55:35,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:35,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:35,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:35,550 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 67 [2024-10-31 21:55:35,550 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:35,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:35,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 67 [2024-10-31 21:55:35,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:35,956 INFO L124 PetriNetUnfolderBase]: 339/666 cut-off events. [2024-10-31 21:55:35,956 INFO L125 PetriNetUnfolderBase]: For 144/144 co-relation queries the response was YES. [2024-10-31 21:55:35,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 666 events. 339/666 cut-off events. For 144/144 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3835 event pairs, 173 based on Foata normal form. 24/678 useless extension candidates. Maximal degree in co-relation 1480. Up to 353 conditions per place. [2024-10-31 21:55:35,963 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 27 selfloop transitions, 2 changer transitions 23/67 dead transitions. [2024-10-31 21:55:35,963 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 67 transitions, 283 flow [2024-10-31 21:55:35,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:55:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:55:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 187 transitions. [2024-10-31 21:55:35,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.39872068230277186 [2024-10-31 21:55:35,965 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 93 flow. Second operand 7 states and 187 transitions. [2024-10-31 21:55:35,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 67 transitions, 283 flow [2024-10-31 21:55:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 67 transitions, 263 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:35,968 INFO L231 Difference]: Finished difference. Result has 57 places, 33 transitions, 97 flow [2024-10-31 21:55:35,969 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=81, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=97, PETRI_PLACES=57, PETRI_TRANSITIONS=33} [2024-10-31 21:55:35,969 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -15 predicate places. [2024-10-31 21:55:35,970 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 33 transitions, 97 flow [2024-10-31 21:55:35,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:35,970 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:35,970 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:35,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 21:55:35,971 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:35,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:35,971 INFO L85 PathProgramCache]: Analyzing trace with hash -588824076, now seen corresponding path program 1 times [2024-10-31 21:55:35,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:35,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576213608] [2024-10-31 21:55:35,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:35,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:36,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:36,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:36,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576213608] [2024-10-31 21:55:36,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576213608] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:36,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:36,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:36,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633572235] [2024-10-31 21:55:36,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:36,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:36,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:36,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:36,400 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 67 [2024-10-31 21:55:36,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 33 transitions, 97 flow. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:36,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:36,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 67 [2024-10-31 21:55:36,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:36,819 INFO L124 PetriNetUnfolderBase]: 567/1010 cut-off events. [2024-10-31 21:55:36,819 INFO L125 PetriNetUnfolderBase]: For 226/226 co-relation queries the response was YES. [2024-10-31 21:55:36,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1010 events. 567/1010 cut-off events. For 226/226 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5974 event pairs, 377 based on Foata normal form. 24/1004 useless extension candidates. Maximal degree in co-relation 2436. Up to 595 conditions per place. [2024-10-31 21:55:36,828 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 28 selfloop transitions, 2 changer transitions 23/66 dead transitions. [2024-10-31 21:55:36,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 288 flow [2024-10-31 21:55:36,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:55:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:55:36,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 174 transitions. [2024-10-31 21:55:36,830 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.37100213219616207 [2024-10-31 21:55:36,830 INFO L175 Difference]: Start difference. First operand has 57 places, 33 transitions, 97 flow. Second operand 7 states and 174 transitions. [2024-10-31 21:55:36,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 288 flow [2024-10-31 21:55:36,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 266 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:36,834 INFO L231 Difference]: Finished difference. Result has 58 places, 33 transitions, 101 flow [2024-10-31 21:55:36,834 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=101, PETRI_PLACES=58, PETRI_TRANSITIONS=33} [2024-10-31 21:55:36,835 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-31 21:55:36,835 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 33 transitions, 101 flow [2024-10-31 21:55:36,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:36,836 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:36,836 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:36,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 21:55:36,836 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:36,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:36,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1386199988, now seen corresponding path program 1 times [2024-10-31 21:55:36,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:36,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301284055] [2024-10-31 21:55:36,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:36,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:37,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:37,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:37,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301284055] [2024-10-31 21:55:37,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301284055] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:37,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:37,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:37,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110006473] [2024-10-31 21:55:37,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:37,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:37,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:37,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:37,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:37,197 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 67 [2024-10-31 21:55:37,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 33 transitions, 101 flow. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:37,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:37,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 67 [2024-10-31 21:55:37,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:37,514 INFO L124 PetriNetUnfolderBase]: 365/683 cut-off events. [2024-10-31 21:55:37,514 INFO L125 PetriNetUnfolderBase]: For 249/259 co-relation queries the response was YES. [2024-10-31 21:55:37,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1622 conditions, 683 events. 365/683 cut-off events. For 249/259 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3905 event pairs, 77 based on Foata normal form. 20/682 useless extension candidates. Maximal degree in co-relation 1607. Up to 413 conditions per place. [2024-10-31 21:55:37,520 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 23 selfloop transitions, 2 changer transitions 19/58 dead transitions. [2024-10-31 21:55:37,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 256 flow [2024-10-31 21:55:37,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:55:37,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:55:37,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 172 transitions. [2024-10-31 21:55:37,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36673773987206826 [2024-10-31 21:55:37,522 INFO L175 Difference]: Start difference. First operand has 58 places, 33 transitions, 101 flow. Second operand 7 states and 172 transitions. [2024-10-31 21:55:37,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 256 flow [2024-10-31 21:55:37,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 58 transitions, 236 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:37,526 INFO L231 Difference]: Finished difference. Result has 59 places, 33 transitions, 105 flow [2024-10-31 21:55:37,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=105, PETRI_PLACES=59, PETRI_TRANSITIONS=33} [2024-10-31 21:55:37,527 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2024-10-31 21:55:37,527 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 33 transitions, 105 flow [2024-10-31 21:55:37,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:37,528 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:37,528 INFO L204 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] [2024-10-31 21:55:37,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 21:55:37,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:37,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:37,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1871650277, now seen corresponding path program 1 times [2024-10-31 21:55:37,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:37,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629995037] [2024-10-31 21:55:37,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:37,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:38,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:38,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:38,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629995037] [2024-10-31 21:55:38,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629995037] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:38,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:38,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:55:38,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102697855] [2024-10-31 21:55:38,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:38,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:55:38,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:38,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:55:38,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:55:38,591 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 19 out of 67 [2024-10-31 21:55:38,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 33 transitions, 105 flow. Second operand has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:38,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:38,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 19 of 67 [2024-10-31 21:55:38,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:39,093 INFO L124 PetriNetUnfolderBase]: 283/572 cut-off events. [2024-10-31 21:55:39,093 INFO L125 PetriNetUnfolderBase]: For 285/293 co-relation queries the response was YES. [2024-10-31 21:55:39,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1337 conditions, 572 events. 283/572 cut-off events. For 285/293 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3260 event pairs, 29 based on Foata normal form. 16/579 useless extension candidates. Maximal degree in co-relation 1320. Up to 307 conditions per place. [2024-10-31 21:55:39,099 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 29 selfloop transitions, 4 changer transitions 17/65 dead transitions. [2024-10-31 21:55:39,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 65 transitions, 292 flow [2024-10-31 21:55:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:55:39,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-10-31 21:55:39,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 204 transitions. [2024-10-31 21:55:39,101 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3805970149253731 [2024-10-31 21:55:39,101 INFO L175 Difference]: Start difference. First operand has 59 places, 33 transitions, 105 flow. Second operand 8 states and 204 transitions. [2024-10-31 21:55:39,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 65 transitions, 292 flow [2024-10-31 21:55:39,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 65 transitions, 272 flow, removed 8 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:39,106 INFO L231 Difference]: Finished difference. Result has 62 places, 35 transitions, 125 flow [2024-10-31 21:55:39,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=125, PETRI_PLACES=62, PETRI_TRANSITIONS=35} [2024-10-31 21:55:39,107 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-31 21:55:39,107 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 35 transitions, 125 flow [2024-10-31 21:55:39,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.857142857142858) internal successors, (146), 7 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:39,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:39,108 INFO L204 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] [2024-10-31 21:55:39,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 21:55:39,108 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:39,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:39,109 INFO L85 PathProgramCache]: Analyzing trace with hash 260474343, now seen corresponding path program 1 times [2024-10-31 21:55:39,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:39,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776489311] [2024-10-31 21:55:39,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:39,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:39,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:39,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:39,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776489311] [2024-10-31 21:55:39,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776489311] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:39,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:39,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 21:55:39,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126853761] [2024-10-31 21:55:39,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:39,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 21:55:39,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:39,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 21:55:39,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 21:55:39,421 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:39,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 35 transitions, 125 flow. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:39,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:39,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:39,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:39,878 INFO L124 PetriNetUnfolderBase]: 878/1438 cut-off events. [2024-10-31 21:55:39,878 INFO L125 PetriNetUnfolderBase]: For 678/688 co-relation queries the response was YES. [2024-10-31 21:55:39,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3667 conditions, 1438 events. 878/1438 cut-off events. For 678/688 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7628 event pairs, 90 based on Foata normal form. 60/1484 useless extension candidates. Maximal degree in co-relation 3648. Up to 817 conditions per place. [2024-10-31 21:55:39,891 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 43 selfloop transitions, 5 changer transitions 1/60 dead transitions. [2024-10-31 21:55:39,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 313 flow [2024-10-31 21:55:39,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 21:55:39,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 21:55:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 109 transitions. [2024-10-31 21:55:39,893 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.40671641791044777 [2024-10-31 21:55:39,893 INFO L175 Difference]: Start difference. First operand has 62 places, 35 transitions, 125 flow. Second operand 4 states and 109 transitions. [2024-10-31 21:55:39,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 313 flow [2024-10-31 21:55:39,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 60 transitions, 298 flow, removed 4 selfloop flow, removed 5 redundant places. [2024-10-31 21:55:39,898 INFO L231 Difference]: Finished difference. Result has 58 places, 38 transitions, 148 flow [2024-10-31 21:55:39,898 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=58, PETRI_TRANSITIONS=38} [2024-10-31 21:55:39,899 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -14 predicate places. [2024-10-31 21:55:39,901 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 38 transitions, 148 flow [2024-10-31 21:55:39,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:39,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:39,901 INFO L204 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] [2024-10-31 21:55:39,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 21:55:39,902 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:39,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:39,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1597669328, now seen corresponding path program 1 times [2024-10-31 21:55:39,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:39,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010244835] [2024-10-31 21:55:39,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:39,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:39,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:40,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:40,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:40,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010244835] [2024-10-31 21:55:40,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010244835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:40,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:40,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:40,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845899767] [2024-10-31 21:55:40,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:40,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:40,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:40,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:40,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 38 transitions, 148 flow. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:40,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:40,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:40,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:40,836 INFO L124 PetriNetUnfolderBase]: 1211/2144 cut-off events. [2024-10-31 21:55:40,836 INFO L125 PetriNetUnfolderBase]: For 1448/1481 co-relation queries the response was YES. [2024-10-31 21:55:40,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5823 conditions, 2144 events. 1211/2144 cut-off events. For 1448/1481 co-relation queries the response was YES. Maximal size of possible extension queue 145. Compared 13024 event pairs, 244 based on Foata normal form. 31/2117 useless extension candidates. Maximal degree in co-relation 5805. Up to 768 conditions per place. [2024-10-31 21:55:40,860 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 34 selfloop transitions, 3 changer transitions 21/73 dead transitions. [2024-10-31 21:55:40,861 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 73 transitions, 388 flow [2024-10-31 21:55:40,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:55:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:55:40,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 149 transitions. [2024-10-31 21:55:40,862 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3706467661691542 [2024-10-31 21:55:40,862 INFO L175 Difference]: Start difference. First operand has 58 places, 38 transitions, 148 flow. Second operand 6 states and 149 transitions. [2024-10-31 21:55:40,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 73 transitions, 388 flow [2024-10-31 21:55:40,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 73 transitions, 376 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-10-31 21:55:40,866 INFO L231 Difference]: Finished difference. Result has 64 places, 38 transitions, 154 flow [2024-10-31 21:55:40,866 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=154, PETRI_PLACES=64, PETRI_TRANSITIONS=38} [2024-10-31 21:55:40,867 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-10-31 21:55:40,867 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 38 transitions, 154 flow [2024-10-31 21:55:40,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:40,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:40,868 INFO L204 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] [2024-10-31 21:55:40,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 21:55:40,868 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:40,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:40,868 INFO L85 PathProgramCache]: Analyzing trace with hash 113963556, now seen corresponding path program 2 times [2024-10-31 21:55:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031836820] [2024-10-31 21:55:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:41,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:41,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031836820] [2024-10-31 21:55:41,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031836820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:41,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:41,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 21:55:41,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344527088] [2024-10-31 21:55:41,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:41,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:55:41,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:41,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:55:41,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:55:41,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:41,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 38 transitions, 154 flow. Second operand has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:41,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:41,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:41,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:41,506 INFO L124 PetriNetUnfolderBase]: 642/1080 cut-off events. [2024-10-31 21:55:41,506 INFO L125 PetriNetUnfolderBase]: For 734/748 co-relation queries the response was YES. [2024-10-31 21:55:41,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2944 conditions, 1080 events. 642/1080 cut-off events. For 734/748 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 5085 event pairs, 40 based on Foata normal form. 56/1122 useless extension candidates. Maximal degree in co-relation 2923. Up to 481 conditions per place. [2024-10-31 21:55:41,517 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 50 selfloop transitions, 8 changer transitions 1/70 dead transitions. [2024-10-31 21:55:41,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 385 flow [2024-10-31 21:55:41,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:55:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 21:55:41,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2024-10-31 21:55:41,519 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.408955223880597 [2024-10-31 21:55:41,519 INFO L175 Difference]: Start difference. First operand has 64 places, 38 transitions, 154 flow. Second operand 5 states and 137 transitions. [2024-10-31 21:55:41,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 385 flow [2024-10-31 21:55:41,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 369 flow, removed 4 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:41,523 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 186 flow [2024-10-31 21:55:41,524 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=186, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-10-31 21:55:41,524 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-31 21:55:41,524 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 186 flow [2024-10-31 21:55:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.2) internal successors, (96), 5 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:41,525 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:41,525 INFO L204 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] [2024-10-31 21:55:41,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 21:55:41,525 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:41,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:41,526 INFO L85 PathProgramCache]: Analyzing trace with hash -785000857, now seen corresponding path program 1 times [2024-10-31 21:55:41,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:41,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854586496] [2024-10-31 21:55:41,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:41,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:41,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:41,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:41,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854586496] [2024-10-31 21:55:41,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854586496] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:41,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:41,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:55:41,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962434741] [2024-10-31 21:55:41,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:41,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:41,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:41,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:41,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:41,853 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:41,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 186 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:41,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:41,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:41,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:42,359 INFO L124 PetriNetUnfolderBase]: 723/1360 cut-off events. [2024-10-31 21:55:42,359 INFO L125 PetriNetUnfolderBase]: For 979/1025 co-relation queries the response was YES. [2024-10-31 21:55:42,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3775 conditions, 1360 events. 723/1360 cut-off events. For 979/1025 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 7819 event pairs, 376 based on Foata normal form. 35/1344 useless extension candidates. Maximal degree in co-relation 3756. Up to 578 conditions per place. [2024-10-31 21:55:42,370 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 26 selfloop transitions, 2 changer transitions 33/79 dead transitions. [2024-10-31 21:55:42,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 79 transitions, 448 flow [2024-10-31 21:55:42,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:55:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:55:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 168 transitions. [2024-10-31 21:55:42,372 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3582089552238806 [2024-10-31 21:55:42,372 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 186 flow. Second operand 7 states and 168 transitions. [2024-10-31 21:55:42,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 79 transitions, 448 flow [2024-10-31 21:55:42,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 79 transitions, 422 flow, removed 6 selfloop flow, removed 4 redundant places. [2024-10-31 21:55:42,376 INFO L231 Difference]: Finished difference. Result has 68 places, 41 transitions, 178 flow [2024-10-31 21:55:42,376 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=68, PETRI_TRANSITIONS=41} [2024-10-31 21:55:42,377 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2024-10-31 21:55:42,377 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 41 transitions, 178 flow [2024-10-31 21:55:42,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:42,377 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:42,378 INFO L204 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] [2024-10-31 21:55:42,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 21:55:42,378 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:42,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:42,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1759933487, now seen corresponding path program 2 times [2024-10-31 21:55:42,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:42,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8376764] [2024-10-31 21:55:42,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:42,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:42,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:42,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:42,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:42,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8376764] [2024-10-31 21:55:42,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8376764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:42,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:42,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:55:42,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443661481] [2024-10-31 21:55:42,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:42,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:42,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:42,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:42,697 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:42,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 41 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:42,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:42,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:42,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:43,027 INFO L124 PetriNetUnfolderBase]: 371/635 cut-off events. [2024-10-31 21:55:43,027 INFO L125 PetriNetUnfolderBase]: For 449/476 co-relation queries the response was YES. [2024-10-31 21:55:43,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 635 events. 371/635 cut-off events. For 449/476 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2489 event pairs, 21 based on Foata normal form. 38/658 useless extension candidates. Maximal degree in co-relation 1811. Up to 228 conditions per place. [2024-10-31 21:55:43,033 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 45 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-10-31 21:55:43,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 68 transitions, 376 flow [2024-10-31 21:55:43,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:55:43,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:55:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2024-10-31 21:55:43,035 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3756218905472637 [2024-10-31 21:55:43,035 INFO L175 Difference]: Start difference. First operand has 68 places, 41 transitions, 178 flow. Second operand 6 states and 151 transitions. [2024-10-31 21:55:43,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 68 transitions, 376 flow [2024-10-31 21:55:43,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 343 flow, removed 7 selfloop flow, removed 9 redundant places. [2024-10-31 21:55:43,037 INFO L231 Difference]: Finished difference. Result has 62 places, 41 transitions, 187 flow [2024-10-31 21:55:43,038 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=151, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=187, PETRI_PLACES=62, PETRI_TRANSITIONS=41} [2024-10-31 21:55:43,038 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2024-10-31 21:55:43,038 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 41 transitions, 187 flow [2024-10-31 21:55:43,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:43,039 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:43,039 INFO L204 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, 1, 1, 1] [2024-10-31 21:55:43,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-31 21:55:43,039 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:43,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:43,040 INFO L85 PathProgramCache]: Analyzing trace with hash 344995280, now seen corresponding path program 1 times [2024-10-31 21:55:43,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:43,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156826771] [2024-10-31 21:55:43,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:43,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:43,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:43,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:43,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156826771] [2024-10-31 21:55:43,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156826771] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:43,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:43,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:55:43,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972670815] [2024-10-31 21:55:43,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:43,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:43,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:43,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:43,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:43,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:43,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 41 transitions, 187 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:43,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:43,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:43,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:43,775 INFO L124 PetriNetUnfolderBase]: 422/856 cut-off events. [2024-10-31 21:55:43,776 INFO L125 PetriNetUnfolderBase]: For 578/592 co-relation queries the response was YES. [2024-10-31 21:55:43,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2216 conditions, 856 events. 422/856 cut-off events. For 578/592 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4380 event pairs, 151 based on Foata normal form. 8/825 useless extension candidates. Maximal degree in co-relation 2199. Up to 336 conditions per place. [2024-10-31 21:55:43,782 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 24 selfloop transitions, 1 changer transitions 22/65 dead transitions. [2024-10-31 21:55:43,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 347 flow [2024-10-31 21:55:43,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:55:43,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 21:55:43,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-10-31 21:55:43,784 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.35323383084577115 [2024-10-31 21:55:43,784 INFO L175 Difference]: Start difference. First operand has 62 places, 41 transitions, 187 flow. Second operand 6 states and 142 transitions. [2024-10-31 21:55:43,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 347 flow [2024-10-31 21:55:43,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 65 transitions, 283 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-31 21:55:43,790 INFO L231 Difference]: Finished difference. Result has 63 places, 39 transitions, 132 flow [2024-10-31 21:55:43,790 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=132, PETRI_PLACES=63, PETRI_TRANSITIONS=39} [2024-10-31 21:55:43,791 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -9 predicate places. [2024-10-31 21:55:43,791 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 39 transitions, 132 flow [2024-10-31 21:55:43,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:43,791 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:43,791 INFO L204 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, 1, 1, 1] [2024-10-31 21:55:43,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-31 21:55:43,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:43,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:43,792 INFO L85 PathProgramCache]: Analyzing trace with hash -639670470, now seen corresponding path program 2 times [2024-10-31 21:55:43,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:43,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930481574] [2024-10-31 21:55:43,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:43,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:55:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 21:55:44,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:55:44,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930481574] [2024-10-31 21:55:44,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930481574] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:55:44,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:55:44,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:55:44,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853096718] [2024-10-31 21:55:44,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:55:44,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:55:44,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:55:44,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:55:44,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:55:44,099 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 67 [2024-10-31 21:55:44,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 39 transitions, 132 flow. Second operand has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:44,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 21:55:44,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 67 [2024-10-31 21:55:44,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 21:55:44,435 INFO L124 PetriNetUnfolderBase]: 363/770 cut-off events. [2024-10-31 21:55:44,436 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-10-31 21:55:44,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 770 events. 363/770 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3888 event pairs, 216 based on Foata normal form. 8/742 useless extension candidates. Maximal degree in co-relation 1724. Up to 336 conditions per place. [2024-10-31 21:55:44,440 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 23 selfloop transitions, 2 changer transitions 25/68 dead transitions. [2024-10-31 21:55:44,440 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 68 transitions, 312 flow [2024-10-31 21:55:44,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 21:55:44,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-10-31 21:55:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 163 transitions. [2024-10-31 21:55:44,441 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.34754797441364604 [2024-10-31 21:55:44,441 INFO L175 Difference]: Start difference. First operand has 63 places, 39 transitions, 132 flow. Second operand 7 states and 163 transitions. [2024-10-31 21:55:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 68 transitions, 312 flow [2024-10-31 21:55:44,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 294 flow, removed 5 selfloop flow, removed 6 redundant places. [2024-10-31 21:55:44,444 INFO L231 Difference]: Finished difference. Result has 64 places, 39 transitions, 135 flow [2024-10-31 21:55:44,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=135, PETRI_PLACES=64, PETRI_TRANSITIONS=39} [2024-10-31 21:55:44,444 INFO L277 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2024-10-31 21:55:44,444 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 39 transitions, 135 flow [2024-10-31 21:55:44,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.0) internal successors, (114), 6 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 21:55:44,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 21:55:44,445 INFO L204 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, 1, 1, 1] [2024-10-31 21:55:44,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-31 21:55:44,445 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 44 more)] === [2024-10-31 21:55:44,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:55:44,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1376472974, now seen corresponding path program 3 times [2024-10-31 21:55:44,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:55:44,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772093963] [2024-10-31 21:55:44,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:55:44,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:55:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:44,518 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:55:44,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:55:44,644 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:55:44,644 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:55:44,645 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (46 of 47 remaining) [2024-10-31 21:55:44,647 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 47 remaining) [2024-10-31 21:55:44,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 47 remaining) [2024-10-31 21:55:44,648 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 47 remaining) [2024-10-31 21:55:44,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 47 remaining) [2024-10-31 21:55:44,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 47 remaining) [2024-10-31 21:55:44,649 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 47 remaining) [2024-10-31 21:55:44,650 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 47 remaining) [2024-10-31 21:55:44,651 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 47 remaining) [2024-10-31 21:55:44,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 47 remaining) [2024-10-31 21:55:44,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 47 remaining) [2024-10-31 21:55:44,652 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 47 remaining) [2024-10-31 21:55:44,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 47 remaining) [2024-10-31 21:55:44,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 47 remaining) [2024-10-31 21:55:44,654 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (21 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 47 remaining) [2024-10-31 21:55:44,655 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 47 remaining) [2024-10-31 21:55:44,656 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 47 remaining) [2024-10-31 21:55:44,657 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 47 remaining) [2024-10-31 21:55:44,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-31 21:55:44,659 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 21:55:44,786 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 21:55:44,787 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 21:55:44,791 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 09:55:44 BasicIcfg [2024-10-31 21:55:44,791 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 21:55:44,792 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 21:55:44,792 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 21:55:44,792 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 21:55:44,793 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:29" (3/4) ... [2024-10-31 21:55:44,795 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 21:55:44,796 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 21:55:44,797 INFO L158 Benchmark]: Toolchain (without parser) took 17438.03ms. Allocated memory was 138.4MB in the beginning and 501.2MB in the end (delta: 362.8MB). Free memory was 95.8MB in the beginning and 365.6MB in the end (delta: -269.7MB). Peak memory consumption was 96.1MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,797 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:55:44,797 INFO L158 Benchmark]: CACSL2BoogieTranslator took 728.15ms. Allocated memory is still 138.4MB. Free memory was 95.2MB in the beginning and 70.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,798 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.72ms. Allocated memory is still 138.4MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,798 INFO L158 Benchmark]: Boogie Preprocessor took 65.27ms. Allocated memory is still 138.4MB. Free memory was 67.4MB in the beginning and 64.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,798 INFO L158 Benchmark]: RCFGBuilder took 1600.68ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 64.2MB in the beginning and 129.1MB in the end (delta: -64.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,799 INFO L158 Benchmark]: TraceAbstraction took 14968.82ms. Allocated memory was 172.0MB in the beginning and 501.2MB in the end (delta: 329.3MB). Free memory was 128.1MB in the beginning and 365.6MB in the end (delta: -237.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. [2024-10-31 21:55:44,799 INFO L158 Benchmark]: Witness Printer took 4.26ms. Allocated memory is still 501.2MB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 21:55:44,801 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.16ms. Allocated memory is still 138.4MB. Free memory was 105.7MB in the beginning and 105.5MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 728.15ms. Allocated memory is still 138.4MB. Free memory was 95.2MB in the beginning and 70.0MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.72ms. Allocated memory is still 138.4MB. Free memory was 70.0MB in the beginning and 67.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.27ms. Allocated memory is still 138.4MB. Free memory was 67.4MB in the beginning and 64.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1600.68ms. Allocated memory was 138.4MB in the beginning and 172.0MB in the end (delta: 33.6MB). Free memory was 64.2MB in the beginning and 129.1MB in the end (delta: -64.9MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14968.82ms. Allocated memory was 172.0MB in the beginning and 501.2MB in the end (delta: 329.3MB). Free memory was 128.1MB in the beginning and 365.6MB in the end (delta: -237.5MB). Peak memory consumption was 91.8MB. Max. memory is 16.1GB. * Witness Printer took 4.26ms. Allocated memory is still 501.2MB. Free memory is still 365.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L738] 0 int y = 0; [L739] 0 _Bool y$flush_delayed; [L740] 0 int y$mem_tmp; [L741] 0 _Bool y$r_buff0_thd0; [L742] 0 _Bool y$r_buff0_thd1; [L743] 0 _Bool y$r_buff0_thd2; [L744] 0 _Bool y$r_buff0_thd3; [L745] 0 _Bool y$r_buff1_thd0; [L746] 0 _Bool y$r_buff1_thd1; [L747] 0 _Bool y$r_buff1_thd2; [L748] 0 _Bool y$r_buff1_thd3; [L749] 0 _Bool y$read_delayed; [L750] 0 int *y$read_delayed_var; [L751] 0 int y$w_buff0; [L752] 0 _Bool y$w_buff0_used; [L753] 0 int y$w_buff1; [L754] 0 _Bool y$w_buff1_used; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L834] 0 pthread_t t2109; [L835] FCALL, FORK 0 pthread_create(&t2109, ((void *)0), P0, ((void *)0)) VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2109=-1, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L761] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 1 y$flush_delayed = weak$$choice2 [L764] EXPR 1 \read(y) [L764] 1 y$mem_tmp = y [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] EXPR 1 \read(y) [L765] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L765] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L766] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L767] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L768] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L769] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L770] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L771] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L773] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L774] EXPR 1 \read(y) [L774] 1 __unbuffered_p0_EAX = y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L775] 1 y = y$flush_delayed ? y$mem_tmp : y [L776] 1 y$flush_delayed = (_Bool)0 VAL [\old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L836] 0 pthread_t t2110; [L837] FCALL, FORK 0 pthread_create(&t2110, ((void *)0), P1, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2109=-1, t2110=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L779] 1 __unbuffered_p0_EBX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L838] 0 pthread_t t2111; [L839] FCALL, FORK 0 pthread_create(&t2111, ((void *)0), P2, ((void *)0)) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2109=-1, t2110=0, t2111=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L791] 2 x = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, 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=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L794] 2 x = 2 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L806] 3 __unbuffered_p2_EAX = x VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L809] 3 y = 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 \read(y) [L812] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L812] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L812] 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) [L813] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L814] 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 [L815] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L816] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L784] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L819] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L841] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2109=-1, t2110=0, t2111=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L843] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L843] RET 0 assume_abort_if_not(main$tmp_guard0) [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 \read(y) [L845] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L845] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L845] 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) [L846] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L847] 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 [L848] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L849] 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 [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2109=-1, t2110=0, t2111=1, weak$$choice0=1, weak$$choice1=0, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L852] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L853] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L853] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L853] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 2) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2109=-1, t2110=0, t2111=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L856] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] [L18] 0 __assert_fail ("0", "safe014_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\old(arg)={0:0}, \old(arg)={0:0}, \old(arg)={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice1=1, weak$$choice2=1, x=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 832]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 835]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 108 locations, 47 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: 14.6s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 631 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 582 mSDsluCounter, 158 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 128 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1746 IncrementalHoareTripleChecker+Invalid, 1788 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 30 mSDtfsCounter, 1746 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=16, InterpolantAutomatonStates: 98, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 370 NumberOfCodeBlocks, 370 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 322 ConstructedInterpolants, 0 QuantifiedInterpolants, 1597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 [2024-10-31 21:55:44,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --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 bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:55:47,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:55:47,484 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 21:55:47,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:55:47,494 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:55:47,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:55:47,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:55:47,536 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:55:47,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:55:47,537 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:55:47,537 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:55:47,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:55:47,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:55:47,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:55:47,543 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:55:47,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:55:47,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:55:47,544 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:55:47,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:55:47,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:55:47,545 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 21:55:47,547 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 21:55:47,548 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 21:55:47,548 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:55:47,548 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 21:55:47,548 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 21:55:47,549 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:55:47,549 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 21:55:47,549 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 21:55:47,549 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:55:47,550 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:55:47,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:55:47,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:55:47,551 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:55:47,551 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:55:47,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:47,552 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:55:47,552 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:55:47,552 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 21:55:47,552 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 21:55:47,553 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:55:47,554 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:55:47,554 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:55:47,554 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:55:47,554 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 21:55:47,555 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_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/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_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> bb32390c6e08fa980f308e05dcc5f75aadd246c70ded8fbe4d875fa3ae4239fa [2024-10-31 21:55:47,949 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:55:47,980 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:55:47,983 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:55:47,984 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:55:47,985 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:55:47,988 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i Unable to find full path for "g++" [2024-10-31 21:55:50,017 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:55:50,326 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:55:50,327 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/sv-benchmarks/c/pthread-wmm/safe014_rmo.oepc.i [2024-10-31 21:55:50,342 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/4e02500bd/8bed23c682134ea2860f8802dcde443f/FLAG029481aec [2024-10-31 21:55:50,583 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/data/4e02500bd/8bed23c682134ea2860f8802dcde443f [2024-10-31 21:55:50,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:55:50,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:55:50,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:50,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:55:50,596 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:55:50,597 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:50" (1/1) ... [2024-10-31 21:55:50,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@671c0965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:50, skipping insertion in model container [2024-10-31 21:55:50,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:55:50" (1/1) ... [2024-10-31 21:55:50,656 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:55:51,307 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:51,339 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:55:51,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:55:51,507 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:55:51,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51 WrapperNode [2024-10-31 21:55:51,508 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:55:51,509 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:51,510 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:55:51,510 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:55:51,518 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,547 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,588 INFO L138 Inliner]: procedures = 179, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 128 [2024-10-31 21:55:51,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:55:51,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:55:51,592 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:55:51,592 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:55:51,606 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,607 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,616 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,639 INFO L175 MemorySlicer]: Split 15 memory accesses to 2 slices as follows [2, 13]. 87 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 5 writes are split as follows [0, 5]. [2024-10-31 21:55:51,640 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,640 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,656 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,660 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,666 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,668 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:55:51,680 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:55:51,680 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:55:51,680 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:55:51,681 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (1/1) ... [2024-10-31 21:55:51,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:55:51,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:55:51,740 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:55:51,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7d8b5a80-9749-4a15-9e79-c776595bf9ed/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:55:51,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 21:55:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 21:55:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 21:55:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:55:51,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 21:55:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 21:55:51,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 21:55:51,788 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 21:55:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-10-31 21:55:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-10-31 21:55:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 21:55:51,789 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 21:55:51,789 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 21:55:51,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 21:55:51,790 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 21:55:51,790 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 21:55:51,790 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 21:55:51,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:55:51,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:55:51,794 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-31 21:55:52,006 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:55:52,007 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:55:52,686 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 21:55:52,686 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:55:53,459 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:55:53,459 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 21:55:53,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:53 BoogieIcfgContainer [2024-10-31 21:55:53,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:55:53,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:55:53,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:55:53,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:55:53,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:55:50" (1/3) ... [2024-10-31 21:55:53,470 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100a1f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:53, skipping insertion in model container [2024-10-31 21:55:53,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:55:51" (2/3) ... [2024-10-31 21:55:53,471 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@100a1f14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:55:53, skipping insertion in model container [2024-10-31 21:55:53,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:55:53" (3/3) ... [2024-10-31 21:55:53,475 INFO L112 eAbstractionObserver]: Analyzing ICFG safe014_rmo.oepc.i [2024-10-31 21:55:53,497 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:55:53,497 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-10-31 21:55:53,498 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 21:55:53,647 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 21:55:53,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 67 transitions, 146 flow