./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe009_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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 d4dfc0bbdb080812f042fcb42d1e3b37e9e0d49ae456458f71f0b25bb99756b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:22,846 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:22,945 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:07:22,953 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:22,956 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:22,992 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:22,993 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:22,993 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:22,994 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:22,995 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:22,996 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:22,996 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:22,997 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:22,999 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:23,000 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:23,000 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:23,001 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:23,001 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:23,001 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:23,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:23,005 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:07:23,005 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:07:23,005 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:07:23,006 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:23,006 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:07:23,006 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:23,007 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:23,007 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:23,007 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:23,007 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:23,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:23,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:23,022 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:23,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:23,023 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:23,023 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:23,024 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:07:23,024 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:07:23,024 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:23,024 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:23,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:23,027 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:23,027 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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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 -> d4dfc0bbdb080812f042fcb42d1e3b37e9e0d49ae456458f71f0b25bb99756b4 [2024-10-31 22:07:23,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:07:23,382 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:07:23,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:07:23,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:07:23,387 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:07:23,388 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i Unable to find full path for "g++" [2024-10-31 22:07:25,559 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:07:25,864 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:07:25,865 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i [2024-10-31 22:07:25,886 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data/a0d5b6527/a05d988e52a446eb864db2a01e722880/FLAG1b0a66e15 [2024-10-31 22:07:26,150 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data/a0d5b6527/a05d988e52a446eb864db2a01e722880 [2024-10-31 22:07:26,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:07:26,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:07:26,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:26,158 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:07:26,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:07:26,165 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:26" (1/1) ... [2024-10-31 22:07:26,166 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a77358 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:26, skipping insertion in model container [2024-10-31 22:07:26,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:07:26" (1/1) ... [2024-10-31 22:07:26,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:07:26,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:26,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:07:26,965 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:07:27,017 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:07:27,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27 WrapperNode [2024-10-31 22:07:27,019 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:07:27,020 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:27,020 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:07:27,021 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:07:27,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,053 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,105 INFO L138 Inliner]: procedures = 175, calls = 63, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 161 [2024-10-31 22:07:27,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:07:27,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:07:27,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:07:27,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:07:27,127 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,127 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,136 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,170 INFO L175 MemorySlicer]: Split 24 memory accesses to 2 slices as follows [2, 22]. 92 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1]. The 9 writes are split as follows [0, 9]. [2024-10-31 22:07:27,170 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,170 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,179 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,182 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,184 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,191 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,201 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:07:27,202 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:07:27,202 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:07:27,203 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:07:27,203 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (1/1) ... [2024-10-31 22:07:27,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:27,222 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:07:27,241 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:07:27,248 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:07:27,280 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:07:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:07:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:07:27,281 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:07:27,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-10-31 22:07:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:07:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2024-10-31 22:07:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2024-10-31 22:07:27,283 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2024-10-31 22:07:27,283 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2024-10-31 22:07:27,284 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2024-10-31 22:07:27,285 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2024-10-31 22:07:27,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:07:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:07:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-10-31 22:07:27,286 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:07:27,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:07:27,288 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 22:07:27,470 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:07:27,476 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:07:28,230 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-31 22:07:28,230 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:07:29,283 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:07:29,284 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:07:29,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:29 BoogieIcfgContainer [2024-10-31 22:07:29,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:07:29,287 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:07:29,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:07:29,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:07:29,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:07:26" (1/3) ... [2024-10-31 22:07:29,293 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800409e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:29, skipping insertion in model container [2024-10-31 22:07:29,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:07:27" (2/3) ... [2024-10-31 22:07:29,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2800409e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:07:29, skipping insertion in model container [2024-10-31 22:07:29,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:29" (3/3) ... [2024-10-31 22:07:29,296 INFO L112 eAbstractionObserver]: Analyzing ICFG safe009_rmo.oepc.i [2024-10-31 22:07:29,318 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:07:29,318 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2024-10-31 22:07:29,318 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-31 22:07:29,465 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-31 22:07:29,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 92 places, 84 transitions, 180 flow [2024-10-31 22:07:29,585 INFO L124 PetriNetUnfolderBase]: 2/81 cut-off events. [2024-10-31 22:07:29,585 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:29,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91 conditions, 81 events. 2/81 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 298 event pairs, 0 based on Foata normal form. 0/35 useless extension candidates. Maximal degree in co-relation 83. Up to 2 conditions per place. [2024-10-31 22:07:29,591 INFO L82 GeneralOperation]: Start removeDead. Operand has 92 places, 84 transitions, 180 flow [2024-10-31 22:07:29,598 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 89 places, 81 transitions, 171 flow [2024-10-31 22:07:29,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:07:29,624 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;@7bd3f30, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:07:29,624 INFO L334 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2024-10-31 22:07:29,630 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-31 22:07:29,630 INFO L124 PetriNetUnfolderBase]: 0/5 cut-off events. [2024-10-31 22:07:29,630 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:29,631 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:29,631 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:07:29,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:29,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:29,639 INFO L85 PathProgramCache]: Analyzing trace with hash 25020954, now seen corresponding path program 1 times [2024-10-31 22:07:29,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:29,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421865122] [2024-10-31 22:07:29,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:29,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:30,153 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 22:07:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:30,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421865122] [2024-10-31 22:07:30,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421865122] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:30,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:30,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157473300] [2024-10-31 22:07:30,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:30,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:30,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:30,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:30,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:30,223 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:30,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 81 transitions, 171 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:07:30,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:30,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:30,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:33,306 INFO L124 PetriNetUnfolderBase]: 6663/10444 cut-off events. [2024-10-31 22:07:33,306 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-31 22:07:33,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19987 conditions, 10444 events. 6663/10444 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 824. Compared 79362 event pairs, 6663 based on Foata normal form. 392/6639 useless extension candidates. Maximal degree in co-relation 19976. Up to 9472 conditions per place. [2024-10-31 22:07:33,403 INFO L140 encePairwiseOnDemand]: 51/84 looper letters, 33 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2024-10-31 22:07:33,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 48 transitions, 173 flow [2024-10-31 22:07:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:33,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2024-10-31 22:07:33,418 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4642857142857143 [2024-10-31 22:07:33,421 INFO L175 Difference]: Start difference. First operand has 89 places, 81 transitions, 171 flow. Second operand 3 states and 117 transitions. [2024-10-31 22:07:33,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 48 transitions, 173 flow [2024-10-31 22:07:33,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 48 transitions, 170 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:07:33,433 INFO L231 Difference]: Finished difference. Result has 57 places, 48 transitions, 104 flow [2024-10-31 22:07:33,438 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=57, PETRI_TRANSITIONS=48} [2024-10-31 22:07:33,443 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2024-10-31 22:07:33,444 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 48 transitions, 104 flow [2024-10-31 22:07:33,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:07:33,445 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:33,445 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-10-31 22:07:33,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:07:33,446 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:33,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:33,448 INFO L85 PathProgramCache]: Analyzing trace with hash 25020955, now seen corresponding path program 1 times [2024-10-31 22:07:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972387725] [2024-10-31 22:07:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:33,645 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 22:07:33,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:33,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972387725] [2024-10-31 22:07:33,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972387725] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:33,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:33,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:33,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021561092] [2024-10-31 22:07:33,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:33,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:33,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:33,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:33,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:33,649 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:33,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:07:33,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:33,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:33,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:34,451 INFO L124 PetriNetUnfolderBase]: 1135/1974 cut-off events. [2024-10-31 22:07:34,451 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:34,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3704 conditions, 1974 events. 1135/1974 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 12941 event pairs, 1135 based on Foata normal form. 0/1848 useless extension candidates. Maximal degree in co-relation 3698. Up to 1694 conditions per place. [2024-10-31 22:07:34,467 INFO L140 encePairwiseOnDemand]: 73/84 looper letters, 22 selfloop transitions, 1 changer transitions 1/38 dead transitions. [2024-10-31 22:07:34,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 38 transitions, 132 flow [2024-10-31 22:07:34,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:34,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:34,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2024-10-31 22:07:34,470 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3373015873015873 [2024-10-31 22:07:34,470 INFO L175 Difference]: Start difference. First operand has 57 places, 48 transitions, 104 flow. Second operand 3 states and 85 transitions. [2024-10-31 22:07:34,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 38 transitions, 132 flow [2024-10-31 22:07:34,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 38 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:07:34,472 INFO L231 Difference]: Finished difference. Result has 48 places, 37 transitions, 83 flow [2024-10-31 22:07:34,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=83, PETRI_PLACES=48, PETRI_TRANSITIONS=37} [2024-10-31 22:07:34,474 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -41 predicate places. [2024-10-31 22:07:34,474 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 37 transitions, 83 flow [2024-10-31 22:07:34,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 0 states have call successors, (0), 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 22:07:34,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:34,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:07:34,476 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 718792702, now seen corresponding path program 1 times [2024-10-31 22:07:34,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:34,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798700890] [2024-10-31 22:07:34,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:34,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:34,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:34,772 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 22:07:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798700890] [2024-10-31 22:07:34,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798700890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:34,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:34,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:34,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319602719] [2024-10-31 22:07:34,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:34,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:34,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:34,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:34,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:34,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:34,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 37 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:07:34,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:34,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:34,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:35,493 INFO L124 PetriNetUnfolderBase]: 951/1699 cut-off events. [2024-10-31 22:07:35,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:35,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3166 conditions, 1699 events. 951/1699 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 10596 event pairs, 365 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 3159. Up to 1109 conditions per place. [2024-10-31 22:07:35,538 INFO L140 encePairwiseOnDemand]: 80/84 looper letters, 38 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-10-31 22:07:35,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 201 flow [2024-10-31 22:07:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:35,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2024-10-31 22:07:35,540 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.36904761904761907 [2024-10-31 22:07:35,540 INFO L175 Difference]: Start difference. First operand has 48 places, 37 transitions, 83 flow. Second operand 3 states and 93 transitions. [2024-10-31 22:07:35,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 201 flow [2024-10-31 22:07:35,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:07:35,542 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 92 flow [2024-10-31 22:07:35,542 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=46, 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=3, PETRI_FLOW=92, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2024-10-31 22:07:35,543 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -40 predicate places. [2024-10-31 22:07:35,544 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 92 flow [2024-10-31 22:07:35,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:07:35,544 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:35,544 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:35,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:07:35,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:35,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:35,546 INFO L85 PathProgramCache]: Analyzing trace with hash -729907887, now seen corresponding path program 1 times [2024-10-31 22:07:35,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:35,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916661215] [2024-10-31 22:07:35,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:35,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:35,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:35,761 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 22:07:35,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916661215] [2024-10-31 22:07:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916661215] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:35,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:35,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813171343] [2024-10-31 22:07:35,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:35,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:07:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:07:35,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:07:35,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:35,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 37 transitions, 92 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 22:07:35,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:35,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:35,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:36,312 INFO L124 PetriNetUnfolderBase]: 887/1841 cut-off events. [2024-10-31 22:07:36,313 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-10-31 22:07:36,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3522 conditions, 1841 events. 887/1841 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 12728 event pairs, 199 based on Foata normal form. 0/1816 useless extension candidates. Maximal degree in co-relation 3513. Up to 1012 conditions per place. [2024-10-31 22:07:36,328 INFO L140 encePairwiseOnDemand]: 81/84 looper letters, 37 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2024-10-31 22:07:36,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 204 flow [2024-10-31 22:07:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:07:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:07:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2024-10-31 22:07:36,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.32142857142857145 [2024-10-31 22:07:36,331 INFO L175 Difference]: Start difference. First operand has 49 places, 37 transitions, 92 flow. Second operand 4 states and 108 transitions. [2024-10-31 22:07:36,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 204 flow [2024-10-31 22:07:36,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 53 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:36,334 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 88 flow [2024-10-31 22:07:36,334 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=84, 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=88, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2024-10-31 22:07:36,335 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -40 predicate places. [2024-10-31 22:07:36,335 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 88 flow [2024-10-31 22:07:36,335 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 22:07:36,336 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:36,336 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:36,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:07:36,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:36,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:36,337 INFO L85 PathProgramCache]: Analyzing trace with hash -729907886, now seen corresponding path program 1 times [2024-10-31 22:07:36,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:36,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378857858] [2024-10-31 22:07:36,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:36,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:36,846 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 22:07:36,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:36,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378857858] [2024-10-31 22:07:36,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378857858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:36,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:36,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:07:36,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396080866] [2024-10-31 22:07:36,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:36,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:07:36,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:36,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:07:36,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:07:36,850 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:36,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 88 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 22:07:36,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:36,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:36,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:37,367 INFO L124 PetriNetUnfolderBase]: 823/1745 cut-off events. [2024-10-31 22:07:37,368 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2024-10-31 22:07:37,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3298 conditions, 1745 events. 823/1745 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 12069 event pairs, 183 based on Foata normal form. 32/1768 useless extension candidates. Maximal degree in co-relation 3289. Up to 916 conditions per place. [2024-10-31 22:07:37,382 INFO L140 encePairwiseOnDemand]: 81/84 looper letters, 36 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2024-10-31 22:07:37,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 52 transitions, 198 flow [2024-10-31 22:07:37,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:07:37,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:07:37,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2024-10-31 22:07:37,384 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.31845238095238093 [2024-10-31 22:07:37,384 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 88 flow. Second operand 4 states and 107 transitions. [2024-10-31 22:07:37,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 52 transitions, 198 flow [2024-10-31 22:07:37,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 193 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-31 22:07:37,386 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 83 flow [2024-10-31 22:07:37,386 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=83, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2024-10-31 22:07:37,387 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -41 predicate places. [2024-10-31 22:07:37,387 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 83 flow [2024-10-31 22:07:37,387 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 22:07:37,387 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:37,388 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:37,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:07:37,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:37,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:37,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1369027971, now seen corresponding path program 1 times [2024-10-31 22:07:37,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:37,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129328500] [2024-10-31 22:07:37,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:37,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:37,477 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 22:07:37,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:37,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129328500] [2024-10-31 22:07:37,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129328500] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:37,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:37,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-31 22:07:37,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714454467] [2024-10-31 22:07:37,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:37,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:07:37,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:37,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:07:37,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:07:37,482 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 84 [2024-10-31 22:07:37,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 83 flow. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:07:37,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:37,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 84 [2024-10-31 22:07:37,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:37,843 INFO L124 PetriNetUnfolderBase]: 823/1470 cut-off events. [2024-10-31 22:07:37,844 INFO L125 PetriNetUnfolderBase]: For 138/138 co-relation queries the response was YES. [2024-10-31 22:07:37,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3022 conditions, 1470 events. 823/1470 cut-off events. For 138/138 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 9289 event pairs, 823 based on Foata normal form. 48/1488 useless extension candidates. Maximal degree in co-relation 3014. Up to 1238 conditions per place. [2024-10-31 22:07:37,854 INFO L140 encePairwiseOnDemand]: 82/84 looper letters, 19 selfloop transitions, 1 changer transitions 1/34 dead transitions. [2024-10-31 22:07:37,854 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 34 transitions, 123 flow [2024-10-31 22:07:37,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:07:37,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-31 22:07:37,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2024-10-31 22:07:37,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2777777777777778 [2024-10-31 22:07:37,856 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 83 flow. Second operand 3 states and 70 transitions. [2024-10-31 22:07:37,856 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 34 transitions, 123 flow [2024-10-31 22:07:37,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 34 transitions, 120 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:37,857 INFO L231 Difference]: Finished difference. Result has 47 places, 33 transitions, 78 flow [2024-10-31 22:07:37,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=47, PETRI_TRANSITIONS=33} [2024-10-31 22:07:37,858 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -42 predicate places. [2024-10-31 22:07:37,859 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 33 transitions, 78 flow [2024-10-31 22:07:37,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 22:07:37,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:37,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:37,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:07:37,860 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:37,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:37,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1369029391, now seen corresponding path program 1 times [2024-10-31 22:07:37,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:37,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322067270] [2024-10-31 22:07:37,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:37,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:37,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:38,142 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 22:07:38,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:38,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322067270] [2024-10-31 22:07:38,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322067270] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:38,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:38,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:07:38,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542842804] [2024-10-31 22:07:38,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:38,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:07:38,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:38,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:07:38,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:07:38,150 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 84 [2024-10-31 22:07:38,151 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 33 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 22:07:38,151 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:38,152 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 84 [2024-10-31 22:07:38,153 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:38,848 INFO L124 PetriNetUnfolderBase]: 1678/2776 cut-off events. [2024-10-31 22:07:38,848 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-31 22:07:38,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5717 conditions, 2776 events. 1678/2776 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 16515 event pairs, 186 based on Foata normal form. 100/2868 useless extension candidates. Maximal degree in co-relation 5709. Up to 1579 conditions per place. [2024-10-31 22:07:38,876 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 43 selfloop transitions, 5 changer transitions 1/58 dead transitions. [2024-10-31 22:07:38,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 58 transitions, 234 flow [2024-10-31 22:07:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:07:38,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-31 22:07:38,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2024-10-31 22:07:38,879 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30654761904761907 [2024-10-31 22:07:38,880 INFO L175 Difference]: Start difference. First operand has 47 places, 33 transitions, 78 flow. Second operand 4 states and 103 transitions. [2024-10-31 22:07:38,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 58 transitions, 234 flow [2024-10-31 22:07:38,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 58 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-31 22:07:38,882 INFO L231 Difference]: Finished difference. Result has 50 places, 36 transitions, 111 flow [2024-10-31 22:07:38,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=111, PETRI_PLACES=50, PETRI_TRANSITIONS=36} [2024-10-31 22:07:38,883 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -39 predicate places. [2024-10-31 22:07:38,883 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 36 transitions, 111 flow [2024-10-31 22:07:38,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 0 states have call successors, (0), 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 22:07:38,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:38,884 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 22:07:38,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:07:38,884 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:38,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:38,885 INFO L85 PathProgramCache]: Analyzing trace with hash 598132751, now seen corresponding path program 1 times [2024-10-31 22:07:38,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:38,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744760915] [2024-10-31 22:07:38,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:38,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:39,287 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 22:07:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744760915] [2024-10-31 22:07:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744760915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:39,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:39,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:07:39,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711190747] [2024-10-31 22:07:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:39,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:07:39,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:07:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:07:39,302 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 84 [2024-10-31 22:07:39,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 36 transitions, 111 flow. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 22:07:39,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:39,303 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 84 [2024-10-31 22:07:39,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:39,908 INFO L124 PetriNetUnfolderBase]: 1036/1738 cut-off events. [2024-10-31 22:07:39,908 INFO L125 PetriNetUnfolderBase]: For 401/401 co-relation queries the response was YES. [2024-10-31 22:07:39,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4172 conditions, 1738 events. 1036/1738 cut-off events. For 401/401 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 9087 event pairs, 98 based on Foata normal form. 82/1812 useless extension candidates. Maximal degree in co-relation 4161. Up to 697 conditions per place. [2024-10-31 22:07:39,922 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 54 selfloop transitions, 8 changer transitions 1/72 dead transitions. [2024-10-31 22:07:39,922 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 336 flow [2024-10-31 22:07:39,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:07:39,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-31 22:07:39,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 130 transitions. [2024-10-31 22:07:39,923 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.30952380952380953 [2024-10-31 22:07:39,924 INFO L175 Difference]: Start difference. First operand has 50 places, 36 transitions, 111 flow. Second operand 5 states and 130 transitions. [2024-10-31 22:07:39,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 336 flow [2024-10-31 22:07:39,926 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 72 transitions, 326 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-10-31 22:07:39,927 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 151 flow [2024-10-31 22:07:39,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=151, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2024-10-31 22:07:39,928 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -35 predicate places. [2024-10-31 22:07:39,928 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 151 flow [2024-10-31 22:07:39,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 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 22:07:39,929 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:39,929 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] [2024-10-31 22:07:39,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:07:39,929 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:39,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:39,930 INFO L85 PathProgramCache]: Analyzing trace with hash 132868083, now seen corresponding path program 1 times [2024-10-31 22:07:39,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:39,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534704008] [2024-10-31 22:07:39,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:39,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:40,452 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 22:07:40,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:40,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534704008] [2024-10-31 22:07:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534704008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:40,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:40,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:40,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723804971] [2024-10-31 22:07:40,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:40,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:40,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:40,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:40,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:40,461 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 84 [2024-10-31 22:07:40,462 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 151 flow. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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 22:07:40,462 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:40,462 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 84 [2024-10-31 22:07:40,462 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:40,906 INFO L124 PetriNetUnfolderBase]: 579/951 cut-off events. [2024-10-31 22:07:40,906 INFO L125 PetriNetUnfolderBase]: For 732/732 co-relation queries the response was YES. [2024-10-31 22:07:40,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2614 conditions, 951 events. 579/951 cut-off events. For 732/732 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4151 event pairs, 81 based on Foata normal form. 40/983 useless extension candidates. Maximal degree in co-relation 2601. Up to 308 conditions per place. [2024-10-31 22:07:40,913 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 47 selfloop transitions, 11 changer transitions 1/68 dead transitions. [2024-10-31 22:07:40,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 68 transitions, 341 flow [2024-10-31 22:07:40,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:40,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:40,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2024-10-31 22:07:40,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2757936507936508 [2024-10-31 22:07:40,915 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 151 flow. Second operand 6 states and 139 transitions. [2024-10-31 22:07:40,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 68 transitions, 341 flow [2024-10-31 22:07:40,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 68 transitions, 316 flow, removed 4 selfloop flow, removed 4 redundant places. [2024-10-31 22:07:40,922 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 165 flow [2024-10-31 22:07:40,922 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-10-31 22:07:40,923 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2024-10-31 22:07:40,923 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 165 flow [2024-10-31 22:07:40,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 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 22:07:40,923 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:40,924 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] [2024-10-31 22:07:40,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:07:40,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:40,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:40,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1451787101, now seen corresponding path program 1 times [2024-10-31 22:07:40,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:40,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851817059] [2024-10-31 22:07:40,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:40,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:41,570 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 22:07:41,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:41,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851817059] [2024-10-31 22:07:41,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851817059] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:41,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:41,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:07:41,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303479573] [2024-10-31 22:07:41,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:41,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:07:41,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:41,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:07:41,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:07:41,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 84 [2024-10-31 22:07:41,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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 22:07:41,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:41,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 84 [2024-10-31 22:07:41,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:42,037 INFO L124 PetriNetUnfolderBase]: 709/1339 cut-off events. [2024-10-31 22:07:42,037 INFO L125 PetriNetUnfolderBase]: For 672/686 co-relation queries the response was YES. [2024-10-31 22:07:42,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3249 conditions, 1339 events. 709/1339 cut-off events. For 672/686 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7543 event pairs, 251 based on Foata normal form. 8/1298 useless extension candidates. Maximal degree in co-relation 3235. Up to 386 conditions per place. [2024-10-31 22:07:42,044 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 34 selfloop transitions, 3 changer transitions 17/71 dead transitions. [2024-10-31 22:07:42,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 351 flow [2024-10-31 22:07:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:42,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:42,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2024-10-31 22:07:42,046 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.2876984126984127 [2024-10-31 22:07:42,046 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 165 flow. Second operand 6 states and 145 transitions. [2024-10-31 22:07:42,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 351 flow [2024-10-31 22:07:42,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 287 flow, removed 14 selfloop flow, removed 8 redundant places. [2024-10-31 22:07:42,055 INFO L231 Difference]: Finished difference. Result has 57 places, 39 transitions, 123 flow [2024-10-31 22:07:42,055 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=123, PETRI_PLACES=57, PETRI_TRANSITIONS=39} [2024-10-31 22:07:42,057 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -32 predicate places. [2024-10-31 22:07:42,057 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 39 transitions, 123 flow [2024-10-31 22:07:42,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 0 states have call successors, (0), 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 22:07:42,058 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:42,058 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] [2024-10-31 22:07:42,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:07:42,058 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:42,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:42,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1977232621, now seen corresponding path program 2 times [2024-10-31 22:07:42,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:42,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232764038] [2024-10-31 22:07:42,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:42,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:44,220 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 22:07:44,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:44,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232764038] [2024-10-31 22:07:44,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232764038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:44,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:44,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:07:44,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621071127] [2024-10-31 22:07:44,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:44,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:07:44,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:44,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:07:44,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:07:44,232 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:44,233 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 39 transitions, 123 flow. Second operand has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 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 22:07:44,233 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:44,233 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:44,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:44,688 INFO L124 PetriNetUnfolderBase]: 363/720 cut-off events. [2024-10-31 22:07:44,689 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-31 22:07:44,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 720 events. 363/720 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3459 event pairs, 128 based on Foata normal form. 8/699 useless extension candidates. Maximal degree in co-relation 1484. Up to 315 conditions per place. [2024-10-31 22:07:44,693 INFO L140 encePairwiseOnDemand]: 77/84 looper letters, 24 selfloop transitions, 4 changer transitions 11/58 dead transitions. [2024-10-31 22:07:44,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 58 transitions, 245 flow [2024-10-31 22:07:44,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:44,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-10-31 22:07:44,695 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28174603174603174 [2024-10-31 22:07:44,696 INFO L175 Difference]: Start difference. First operand has 57 places, 39 transitions, 123 flow. Second operand 6 states and 142 transitions. [2024-10-31 22:07:44,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 58 transitions, 245 flow [2024-10-31 22:07:44,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 58 transitions, 229 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-31 22:07:44,699 INFO L231 Difference]: Finished difference. Result has 58 places, 41 transitions, 136 flow [2024-10-31 22:07:44,700 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=58, PETRI_TRANSITIONS=41} [2024-10-31 22:07:44,700 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -31 predicate places. [2024-10-31 22:07:44,700 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 41 transitions, 136 flow [2024-10-31 22:07:44,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.125) internal successors, (153), 8 states have internal predecessors, (153), 0 states have call successors, (0), 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 22:07:44,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:44,702 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] [2024-10-31 22:07:44,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:07:44,703 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:44,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:44,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1043681243, now seen corresponding path program 3 times [2024-10-31 22:07:44,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:44,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445243216] [2024-10-31 22:07:44,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:44,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:44,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:07:47,427 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 22:07:47,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:07:47,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445243216] [2024-10-31 22:07:47,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445243216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:07:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:07:47,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:07:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602730305] [2024-10-31 22:07:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:07:47,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:07:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:07:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:07:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:07:47,439 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 84 [2024-10-31 22:07:47,440 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 41 transitions, 136 flow. Second operand has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 22:07:47,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-31 22:07:47,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 84 [2024-10-31 22:07:47,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-31 22:07:47,893 INFO L124 PetriNetUnfolderBase]: 442/879 cut-off events. [2024-10-31 22:07:47,893 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2024-10-31 22:07:47,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1911 conditions, 879 events. 442/879 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 4551 event pairs, 166 based on Foata normal form. 8/848 useless extension candidates. Maximal degree in co-relation 1898. Up to 346 conditions per place. [2024-10-31 22:07:47,898 INFO L140 encePairwiseOnDemand]: 78/84 looper letters, 23 selfloop transitions, 3 changer transitions 13/58 dead transitions. [2024-10-31 22:07:47,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 254 flow [2024-10-31 22:07:47,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:07:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-31 22:07:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2024-10-31 22:07:47,900 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.28174603174603174 [2024-10-31 22:07:47,900 INFO L175 Difference]: Start difference. First operand has 58 places, 41 transitions, 136 flow. Second operand 6 states and 142 transitions. [2024-10-31 22:07:47,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 254 flow [2024-10-31 22:07:47,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 58 transitions, 243 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-10-31 22:07:47,902 INFO L231 Difference]: Finished difference. Result has 60 places, 39 transitions, 133 flow [2024-10-31 22:07:47,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=133, PETRI_PLACES=60, PETRI_TRANSITIONS=39} [2024-10-31 22:07:47,906 INFO L277 CegarLoopForPetriNet]: 89 programPoint places, -29 predicate places. [2024-10-31 22:07:47,906 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 39 transitions, 133 flow [2024-10-31 22:07:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 18.88888888888889) internal successors, (170), 9 states have internal predecessors, (170), 0 states have call successors, (0), 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 22:07:47,907 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-31 22:07:47,908 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] [2024-10-31 22:07:47,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:07:47,908 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 68 more)] === [2024-10-31 22:07:47,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:07:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 2107790261, now seen corresponding path program 4 times [2024-10-31 22:07:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:07:47,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982539133] [2024-10-31 22:07:47,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:07:47,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:07:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:48,078 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:07:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:07:48,255 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:07:48,256 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:07:48,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK (70 of 71 remaining) [2024-10-31 22:07:48,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 71 remaining) [2024-10-31 22:07:48,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 71 remaining) [2024-10-31 22:07:48,259 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 71 remaining) [2024-10-31 22:07:48,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 71 remaining) [2024-10-31 22:07:48,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 71 remaining) [2024-10-31 22:07:48,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 71 remaining) [2024-10-31 22:07:48,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 71 remaining) [2024-10-31 22:07:48,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 71 remaining) [2024-10-31 22:07:48,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK (27 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 71 remaining) [2024-10-31 22:07:48,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 71 remaining) [2024-10-31 22:07:48,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 71 remaining) [2024-10-31 22:07:48,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 71 remaining) [2024-10-31 22:07:48,269 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 71 remaining) [2024-10-31 22:07:48,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:07:48,270 INFO L407 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:07:48,395 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-31 22:07:48,395 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:07:48,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:07:48 BasicIcfg [2024-10-31 22:07:48,401 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:07:48,401 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:07:48,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:07:48,402 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:07:48,402 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:07:29" (3/4) ... [2024-10-31 22:07:48,404 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:07:48,406 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:07:48,406 INFO L158 Benchmark]: Toolchain (without parser) took 22251.38ms. Allocated memory was 148.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 105.9MB in the beginning and 485.0MB in the end (delta: -379.0MB). Peak memory consumption was 627.6MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,407 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 148.9MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:07:48,407 INFO L158 Benchmark]: CACSL2BoogieTranslator took 862.22ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 78.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 89.05ms. Allocated memory is still 148.9MB. Free memory was 78.1MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,408 INFO L158 Benchmark]: Boogie Preprocessor took 91.45ms. Allocated memory is still 148.9MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,408 INFO L158 Benchmark]: RCFGBuilder took 2082.40ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 71.3MB in the beginning and 110.7MB in the end (delta: -39.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,408 INFO L158 Benchmark]: TraceAbstraction took 19113.69ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 943.7MB). Free memory was 109.6MB in the beginning and 486.0MB in the end (delta: -376.4MB). Peak memory consumption was 569.4MB. Max. memory is 16.1GB. [2024-10-31 22:07:48,409 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 1.2GB. Free memory was 486.0MB in the beginning and 485.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:07:48,410 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33ms. Allocated memory is still 148.9MB. Free memory is still 117.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 862.22ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 78.1MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 89.05ms. Allocated memory is still 148.9MB. Free memory was 78.1MB in the beginning and 75.5MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.45ms. Allocated memory is still 148.9MB. Free memory was 75.5MB in the beginning and 71.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2082.40ms. Allocated memory was 148.9MB in the beginning and 209.7MB in the end (delta: 60.8MB). Free memory was 71.3MB in the beginning and 110.7MB in the end (delta: -39.4MB). Peak memory consumption was 51.2MB. Max. memory is 16.1GB. * TraceAbstraction took 19113.69ms. Allocated memory was 209.7MB in the beginning and 1.2GB in the end (delta: 943.7MB). Free memory was 109.6MB in the beginning and 486.0MB in the end (delta: -376.4MB). Peak memory consumption was 569.4MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 1.2GB. Free memory was 486.0MB in the beginning and 485.0MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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_p1_EAX = 0; [L731] 0 _Bool main$tmp_guard0; [L732] 0 _Bool main$tmp_guard1; [L734] 0 int x = 0; [L736] 0 int y = 0; [L736] 0 int y = 0; [L737] 0 _Bool y$flush_delayed; [L738] 0 int y$mem_tmp; [L739] 0 _Bool y$r_buff0_thd0; [L740] 0 _Bool y$r_buff0_thd1; [L741] 0 _Bool y$r_buff0_thd2; [L742] 0 _Bool y$r_buff0_thd3; [L743] 0 _Bool y$r_buff1_thd0; [L744] 0 _Bool y$r_buff1_thd1; [L745] 0 _Bool y$r_buff1_thd2; [L746] 0 _Bool y$r_buff1_thd3; [L747] 0 _Bool y$read_delayed; [L748] 0 int *y$read_delayed_var; [L749] 0 int y$w_buff0; [L750] 0 _Bool y$w_buff0_used; [L751] 0 int y$w_buff1; [L752] 0 _Bool y$w_buff1_used; [L753] 0 _Bool weak$$choice0; [L754] 0 _Bool weak$$choice1; [L755] 0 _Bool weak$$choice2; [L834] 0 pthread_t t1997; [L835] FCALL, FORK 0 pthread_create(&t1997, ((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_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t1997=-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}] [L759] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L760] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L761] 1 y$flush_delayed = weak$$choice2 [L762] EXPR 1 \read(y) [L762] 1 y$mem_tmp = y [L763] 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) [L763] EXPR 1 \read(y) [L763] 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) [L763] 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) [L764] 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)) [L765] 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)) [L766] 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)) [L767] 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)) [L768] 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)) [L769] 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)) [L770] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L771] 1 __unbuffered_p0_EAX$read_delayed_var = &y [L772] EXPR 1 \read(y) [L772] 1 __unbuffered_p0_EAX = y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] EXPR 1 y$flush_delayed ? y$mem_tmp : y [L773] 1 y = y$flush_delayed ? y$mem_tmp : y [L774] 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_p1_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}] [L777] 1 x = 1 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_p1_EAX=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}] [L836] 0 pthread_t t1998; [L837] FCALL, FORK 0 pthread_create(&t1998, ((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_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1997=-1, t1998=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}] [L789] 2 __unbuffered_p1_EAX = 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_p1_EAX=1, 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}] [L838] 0 pthread_t t1999; [L839] FCALL, FORK 0 pthread_create(&t1999, ((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_p1_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1997=-1, t1998=0, t1999=1, 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}] [L792] 2 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_p1_EAX=1, 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}] [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 \read(y) [L795] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L795] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L795] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L799] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 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_p1_EAX=1, 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}] [L809] 3 y = 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_p1_EAX=1, 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}] [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_p1_EAX=1, 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}] [L782] 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_p1_EAX=1, 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}] [L802] 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_p1_EAX=1, 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}] [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_p1_EAX=1, 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}] [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_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1997=-1, t1998=0, t1999=1, 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}] [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_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1997=-1, t1998=0, t1999=1, 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}] [L852] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L853] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L854] 0 y$flush_delayed = weak$$choice2 [L855] EXPR 0 \read(y) [L855] 0 y$mem_tmp = y [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] EXPR 0 \read(y) [L856] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L856] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L857] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L858] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L859] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L860] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L861] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L862] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L863] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L864] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L864] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L864] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L865] EXPR 0 \read(y) [L865] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1) [L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L866] EXPR 0 \read(y) [L866] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L866] 0 y = y$flush_delayed ? y$mem_tmp : y [L867] 0 y$flush_delayed = (_Bool)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=2, __unbuffered_p1_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1997=-1, t1998=0, t1999=1, weak$$choice0=1, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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}] [L869] 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=2, __unbuffered_p1_EAX=1, 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=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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", "safe009_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=2, __unbuffered_p1_EAX=1, 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=0, x=1, y$flush_delayed=0, y$mem_tmp=2, 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: -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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 71 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: 18.8s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 9.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 438 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 426 mSDsluCounter, 45 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 41 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 889 IncrementalHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 4 mSDtfsCounter, 889 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=0, InterpolantAutomatonStates: 53, 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, 1.0s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 22:07:48,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe009_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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 d4dfc0bbdb080812f042fcb42d1e3b37e9e0d49ae456458f71f0b25bb99756b4 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:07:50,893 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:07:50,983 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3bb9e46-ca2a-4625-a191-f419d7b0e394/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:07:50,990 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:07:50,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:07:51,044 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:07:51,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:07:51,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:07:51,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:07:51,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:07:51,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:07:51,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:07:51,049 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:07:51,049 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:07:51,050 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:07:51,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:07:51,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:07:51,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:07:51,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:07:51,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:07:51,057 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:07:51,058 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:07:51,058 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:07:51,058 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:07:51,059 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:07:51,059 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:07:51,059 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:07:51,059 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:07:51,060 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:07:51,060 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:07:51,060 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:07:51,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:07:51,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:07:51,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:07:51,063 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:07:51,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:07:51,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:07:51,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:07:51,064 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:07:51,064 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:07:51,064 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:07:51,070 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:07:51,070 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:07:51,070 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:07:51,070 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:07:51,070 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_f3bb9e46-ca2a-4625-a191-f419d7b0e394/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