./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:37:00,028 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:37:00,155 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-23 20:37:00,163 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:37:00,163 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:37:00,207 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:37:00,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:37:00,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:37:00,209 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:37:00,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:37:00,215 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:37:00,216 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:37:00,216 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:37:00,218 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-23 20:37:00,219 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:37:00,219 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:37:00,219 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-23 20:37:00,221 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-23 20:37:00,222 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:37:00,222 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-23 20:37:00,223 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-23 20:37:00,223 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-23 20:37:00,224 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:37:00,224 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:37:00,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:37:00,225 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:37:00,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:37:00,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:37:00,227 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:37:00,227 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:37:00,228 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:37:00,229 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:37:00,229 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:37:00,229 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:37:00,229 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:37:00,230 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:37:00,230 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:37:00,230 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:37:00,230 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:37:00,230 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:37:00,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:37:00,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:37:00,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:37:00,232 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-23 20:37:00,232 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 20:37:00,232 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:37:00,233 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:37:00,233 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:37:00,233 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/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_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire 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 -> Taipan 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2023-11-23 20:37:00,561 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:37:00,593 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:37:00,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:37:00,598 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:37:00,598 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:37:00,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-23 20:37:03,771 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 20:37:04,158 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 20:37:04,159 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/sv-benchmarks/c/pthread-wmm/safe012_power.opt.i [2023-11-23 20:37:04,181 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data/8c4915ab7/3649b645775c4b7db86c53a0c89d9ccc/FLAGc1bb66ded [2023-11-23 20:37:04,196 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data/8c4915ab7/3649b645775c4b7db86c53a0c89d9ccc [2023-11-23 20:37:04,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 20:37:04,203 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 20:37:04,206 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 20:37:04,207 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 20:37:04,212 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 20:37:04,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:04,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f630822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04, skipping insertion in model container [2023-11-23 20:37:04,214 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:04,287 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 20:37:04,738 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:37:04,757 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 20:37:04,824 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 20:37:04,879 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:37:04,879 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 20:37:04,887 INFO L206 MainTranslator]: Completed translation [2023-11-23 20:37:04,887 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04 WrapperNode [2023-11-23 20:37:04,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 20:37:04,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 20:37:04,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 20:37:04,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 20:37:04,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:04,935 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:04,993 INFO L138 Inliner]: procedures = 176, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 187 [2023-11-23 20:37:04,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 20:37:04,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 20:37:04,997 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 20:37:04,997 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 20:37:05,007 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,008 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,025 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,027 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,039 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,063 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,076 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,080 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 20:37:05,088 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 20:37:05,088 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 20:37:05,088 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 20:37:05,089 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (1/1) ... [2023-11-23 20:37:05,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:37:05,109 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/z3 [2023-11-23 20:37:05,132 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 20:37:05,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 20:37:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-23 20:37:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 20:37:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 20:37:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 20:37:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 20:37:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 20:37:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 20:37:05,174 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 20:37:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 20:37:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 20:37:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 20:37:05,175 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 20:37:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 20:37:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 20:37:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 20:37:05,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 20:37:05,180 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 20:37:05,403 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 20:37:05,406 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 20:37:06,069 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 20:37:06,613 WARN L1821 r$LargeBlockEncoding]: Complex 4:9 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2023-11-23 20:37:06,747 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 20:37:06,748 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 20:37:06,749 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:06 BoogieIcfgContainer [2023-11-23 20:37:06,749 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 20:37:06,753 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 20:37:06,753 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 20:37:06,757 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 20:37:06,757 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:37:04" (1/3) ... [2023-11-23 20:37:06,758 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36210593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:37:06, skipping insertion in model container [2023-11-23 20:37:06,758 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:37:04" (2/3) ... [2023-11-23 20:37:06,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36210593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:37:06, skipping insertion in model container [2023-11-23 20:37:06,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:06" (3/3) ... [2023-11-23 20:37:06,762 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_power.opt.i [2023-11-23 20:37:06,784 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 20:37:06,784 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-23 20:37:06,784 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 20:37:07,055 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 20:37:07,097 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 91 places, 110 transitions, 232 flow [2023-11-23 20:37:10,050 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 48025 states, 46876 states have (on average 4.882306510794437) internal successors, (228863), 48024 states have internal predecessors, (228863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:10,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 20:37:10,204 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@cdf247f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 20:37:10,205 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-11-23 20:37:10,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 48025 states, 46876 states have (on average 4.882306510794437) internal successors, (228863), 48024 states have internal predecessors, (228863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:10,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:37:10,344 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:10,345 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:37:10,346 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:10,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:10,352 INFO L85 PathProgramCache]: Analyzing trace with hash 28312, now seen corresponding path program 1 times [2023-11-23 20:37:10,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:10,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776910988] [2023-11-23 20:37:10,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:10,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:10,718 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776910988] [2023-11-23 20:37:10,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776910988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:10,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:10,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:37:10,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45191416] [2023-11-23 20:37:10,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:10,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:10,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:10,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:10,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:10,875 INFO L87 Difference]: Start difference. First operand has 48025 states, 46876 states have (on average 4.882306510794437) internal successors, (228863), 48024 states have internal predecessors, (228863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:12,043 INFO L93 Difference]: Finished difference Result 22236 states and 85679 transitions. [2023-11-23 20:37:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:12,046 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:37:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:12,547 INFO L225 Difference]: With dead ends: 22236 [2023-11-23 20:37:12,548 INFO L226 Difference]: Without dead ends: 22236 [2023-11-23 20:37:12,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:12,554 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 59 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:12,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 29 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-23 20:37:12,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22236 states. [2023-11-23 20:37:13,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22236 to 22236. [2023-11-23 20:37:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22236 states, 21844 states have (on average 3.9223127632301775) internal successors, (85679), 22235 states have internal predecessors, (85679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:14,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22236 states to 22236 states and 85679 transitions. [2023-11-23 20:37:14,568 INFO L78 Accepts]: Start accepts. Automaton has 22236 states and 85679 transitions. Word has length 2 [2023-11-23 20:37:14,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:14,569 INFO L495 AbstractCegarLoop]: Abstraction has 22236 states and 85679 transitions. [2023-11-23 20:37:14,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:14,571 INFO L276 IsEmpty]: Start isEmpty. Operand 22236 states and 85679 transitions. [2023-11-23 20:37:14,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-23 20:37:14,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:14,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-23 20:37:14,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 20:37:14,574 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:14,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:14,576 INFO L85 PathProgramCache]: Analyzing trace with hash 28313, now seen corresponding path program 1 times [2023-11-23 20:37:14,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:14,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855574421] [2023-11-23 20:37:14,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:14,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:14,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:14,782 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:14,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855574421] [2023-11-23 20:37:14,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855574421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:14,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:14,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:37:14,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339111602] [2023-11-23 20:37:14,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:14,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:14,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:14,789 INFO L87 Difference]: Start difference. First operand 22236 states and 85679 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:15,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:15,686 INFO L93 Difference]: Finished difference Result 22235 states and 85678 transitions. [2023-11-23 20:37:15,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:15,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-23 20:37:15,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:15,941 INFO L225 Difference]: With dead ends: 22235 [2023-11-23 20:37:15,941 INFO L226 Difference]: Without dead ends: 22235 [2023-11-23 20:37:15,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:15,950 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 58 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:15,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 30 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:16,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22235 states. [2023-11-23 20:37:17,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22235 to 22235. [2023-11-23 20:37:17,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22235 states, 21844 states have (on average 3.9222669840688518) internal successors, (85678), 22234 states have internal predecessors, (85678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:17,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22235 states to 22235 states and 85678 transitions. [2023-11-23 20:37:17,553 INFO L78 Accepts]: Start accepts. Automaton has 22235 states and 85678 transitions. Word has length 2 [2023-11-23 20:37:17,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:17,553 INFO L495 AbstractCegarLoop]: Abstraction has 22235 states and 85678 transitions. [2023-11-23 20:37:17,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:17,554 INFO L276 IsEmpty]: Start isEmpty. Operand 22235 states and 85678 transitions. [2023-11-23 20:37:17,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:37:17,554 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:17,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:37:17,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 20:37:17,555 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:17,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:17,556 INFO L85 PathProgramCache]: Analyzing trace with hash 844362636, now seen corresponding path program 1 times [2023-11-23 20:37:17,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:17,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022300860] [2023-11-23 20:37:17,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:17,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:17,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:17,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:17,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022300860] [2023-11-23 20:37:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022300860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:17,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:17,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:37:17,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401650547] [2023-11-23 20:37:17,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:17,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:17,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:17,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:17,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:17,635 INFO L87 Difference]: Start difference. First operand 22235 states and 85678 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:18,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:18,410 INFO L93 Difference]: Finished difference Result 22228 states and 85665 transitions. [2023-11-23 20:37:18,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:18,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:37:18,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:18,626 INFO L225 Difference]: With dead ends: 22228 [2023-11-23 20:37:18,626 INFO L226 Difference]: Without dead ends: 22228 [2023-11-23 20:37:18,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:18,637 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 55 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:18,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 34 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:18,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22228 states. [2023-11-23 20:37:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22228 to 22228. [2023-11-23 20:37:19,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22228 states, 21838 states have (on average 3.922749336019782) internal successors, (85665), 22227 states have internal predecessors, (85665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:19,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22228 states to 22228 states and 85665 transitions. [2023-11-23 20:37:19,853 INFO L78 Accepts]: Start accepts. Automaton has 22228 states and 85665 transitions. Word has length 5 [2023-11-23 20:37:19,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:19,854 INFO L495 AbstractCegarLoop]: Abstraction has 22228 states and 85665 transitions. [2023-11-23 20:37:19,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:19,855 INFO L276 IsEmpty]: Start isEmpty. Operand 22228 states and 85665 transitions. [2023-11-23 20:37:19,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-23 20:37:19,855 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:19,855 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 20:37:19,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 20:37:19,856 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:19,856 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:19,857 INFO L85 PathProgramCache]: Analyzing trace with hash 844362637, now seen corresponding path program 1 times [2023-11-23 20:37:19,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:19,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742128597] [2023-11-23 20:37:19,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:19,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:20,034 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:20,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742128597] [2023-11-23 20:37:20,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742128597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:20,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:20,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:37:20,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631376717] [2023-11-23 20:37:20,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:20,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:20,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:20,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:20,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:20,037 INFO L87 Difference]: Start difference. First operand 22228 states and 85665 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:20,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:20,816 INFO L93 Difference]: Finished difference Result 22221 states and 85652 transitions. [2023-11-23 20:37:20,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:20,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-11-23 20:37:20,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:21,005 INFO L225 Difference]: With dead ends: 22221 [2023-11-23 20:37:21,005 INFO L226 Difference]: Without dead ends: 22221 [2023-11-23 20:37:21,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:21,015 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 54 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:21,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 35 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:21,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22221 states. [2023-11-23 20:37:21,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22221 to 22221. [2023-11-23 20:37:21,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22221 states, 21832 states have (on average 3.9232319530963724) internal successors, (85652), 22220 states have internal predecessors, (85652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:22,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22221 states to 22221 states and 85652 transitions. [2023-11-23 20:37:22,038 INFO L78 Accepts]: Start accepts. Automaton has 22221 states and 85652 transitions. Word has length 5 [2023-11-23 20:37:22,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:22,039 INFO L495 AbstractCegarLoop]: Abstraction has 22221 states and 85652 transitions. [2023-11-23 20:37:22,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:22,039 INFO L276 IsEmpty]: Start isEmpty. Operand 22221 states and 85652 transitions. [2023-11-23 20:37:22,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 20:37:22,040 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:22,041 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:22,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 20:37:22,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:22,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:22,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242569, now seen corresponding path program 1 times [2023-11-23 20:37:22,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:22,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552299528] [2023-11-23 20:37:22,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:22,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:22,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:22,151 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:22,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552299528] [2023-11-23 20:37:22,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552299528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:22,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:22,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:37:22,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389785677] [2023-11-23 20:37:22,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:22,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:22,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:22,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:22,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:22,154 INFO L87 Difference]: Start difference. First operand 22221 states and 85652 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:22,896 INFO L93 Difference]: Finished difference Result 22137 states and 85419 transitions. [2023-11-23 20:37:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:22,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 20:37:22,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:23,014 INFO L225 Difference]: With dead ends: 22137 [2023-11-23 20:37:23,015 INFO L226 Difference]: Without dead ends: 22137 [2023-11-23 20:37:23,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:23,016 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 51 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:23,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 37 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:23,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22137 states. [2023-11-23 20:37:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22137 to 22137. [2023-11-23 20:37:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22137 states, 21754 states have (on average 3.9265882136618555) internal successors, (85419), 22136 states have internal predecessors, (85419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:24,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22137 states to 22137 states and 85419 transitions. [2023-11-23 20:37:24,176 INFO L78 Accepts]: Start accepts. Automaton has 22137 states and 85419 transitions. Word has length 8 [2023-11-23 20:37:24,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:24,181 INFO L495 AbstractCegarLoop]: Abstraction has 22137 states and 85419 transitions. [2023-11-23 20:37:24,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:24,182 INFO L276 IsEmpty]: Start isEmpty. Operand 22137 states and 85419 transitions. [2023-11-23 20:37:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-23 20:37:24,183 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:24,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:24,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 20:37:24,200 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:24,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:24,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1215242568, now seen corresponding path program 1 times [2023-11-23 20:37:24,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:24,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394080846] [2023-11-23 20:37:24,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:24,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:24,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:24,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:24,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394080846] [2023-11-23 20:37:24,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394080846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:24,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:24,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:37:24,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860123252] [2023-11-23 20:37:24,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:24,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:24,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:24,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:24,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:24,379 INFO L87 Difference]: Start difference. First operand 22137 states and 85419 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:24,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:24,690 INFO L93 Difference]: Finished difference Result 22053 states and 85186 transitions. [2023-11-23 20:37:24,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:24,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-23 20:37:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:24,793 INFO L225 Difference]: With dead ends: 22053 [2023-11-23 20:37:24,793 INFO L226 Difference]: Without dead ends: 22053 [2023-11-23 20:37:24,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:24,794 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:24,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 38 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:37:24,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22053 states. [2023-11-23 20:37:25,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22053 to 22053. [2023-11-23 20:37:25,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22053 states, 21676 states have (on average 3.9299686288983207) internal successors, (85186), 22052 states have internal predecessors, (85186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:25,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22053 states to 22053 states and 85186 transitions. [2023-11-23 20:37:25,866 INFO L78 Accepts]: Start accepts. Automaton has 22053 states and 85186 transitions. Word has length 8 [2023-11-23 20:37:25,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:25,867 INFO L495 AbstractCegarLoop]: Abstraction has 22053 states and 85186 transitions. [2023-11-23 20:37:25,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:25,867 INFO L276 IsEmpty]: Start isEmpty. Operand 22053 states and 85186 transitions. [2023-11-23 20:37:25,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-23 20:37:25,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:25,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:25,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 20:37:25,869 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:25,870 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:25,870 INFO L85 PathProgramCache]: Analyzing trace with hash 982196809, now seen corresponding path program 1 times [2023-11-23 20:37:25,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:25,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991771074] [2023-11-23 20:37:25,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:25,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:26,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:26,065 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:26,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991771074] [2023-11-23 20:37:26,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991771074] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:26,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:26,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:37:26,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102807153] [2023-11-23 20:37:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:26,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:26,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:26,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:26,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:26,069 INFO L87 Difference]: Start difference. First operand 22053 states and 85186 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:26,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:26,519 INFO L93 Difference]: Finished difference Result 30229 states and 112410 transitions. [2023-11-23 20:37:26,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:26,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-23 20:37:26,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:26,693 INFO L225 Difference]: With dead ends: 30229 [2023-11-23 20:37:26,693 INFO L226 Difference]: Without dead ends: 30229 [2023-11-23 20:37:26,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:26,695 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:26,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 35 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:26,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30229 states. [2023-11-23 20:37:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30229 to 20212. [2023-11-23 20:37:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20212 states, 19898 states have (on average 3.8524977384661776) internal successors, (76657), 20211 states have internal predecessors, (76657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20212 states to 20212 states and 76657 transitions. [2023-11-23 20:37:28,241 INFO L78 Accepts]: Start accepts. Automaton has 20212 states and 76657 transitions. Word has length 9 [2023-11-23 20:37:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:28,241 INFO L495 AbstractCegarLoop]: Abstraction has 20212 states and 76657 transitions. [2023-11-23 20:37:28,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 20212 states and 76657 transitions. [2023-11-23 20:37:28,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 20:37:28,243 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:28,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:28,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 20:37:28,244 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:28,245 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:28,245 INFO L85 PathProgramCache]: Analyzing trace with hash 383330935, now seen corresponding path program 1 times [2023-11-23 20:37:28,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:28,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474063633] [2023-11-23 20:37:28,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:28,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:28,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:28,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:28,392 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:28,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474063633] [2023-11-23 20:37:28,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474063633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:28,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:28,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 20:37:28,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82253313] [2023-11-23 20:37:28,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:28,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:28,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:28,395 INFO L87 Difference]: Start difference. First operand 20212 states and 76657 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:28,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:28,756 INFO L93 Difference]: Finished difference Result 24510 states and 92563 transitions. [2023-11-23 20:37:28,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:28,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-23 20:37:28,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:28,899 INFO L225 Difference]: With dead ends: 24510 [2023-11-23 20:37:28,899 INFO L226 Difference]: Without dead ends: 24510 [2023-11-23 20:37:28,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:28,900 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 39 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:28,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 52 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:28,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24510 states. [2023-11-23 20:37:30,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24510 to 21654. [2023-11-23 20:37:30,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21654 states, 21356 states have (on average 3.9882468627083725) internal successors, (85173), 21653 states have internal predecessors, (85173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:30,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21654 states to 21654 states and 85173 transitions. [2023-11-23 20:37:30,404 INFO L78 Accepts]: Start accepts. Automaton has 21654 states and 85173 transitions. Word has length 10 [2023-11-23 20:37:30,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:30,405 INFO L495 AbstractCegarLoop]: Abstraction has 21654 states and 85173 transitions. [2023-11-23 20:37:30,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:30,406 INFO L276 IsEmpty]: Start isEmpty. Operand 21654 states and 85173 transitions. [2023-11-23 20:37:30,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 20:37:30,408 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:30,408 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:30,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 20:37:30,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:30,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:30,413 INFO L85 PathProgramCache]: Analyzing trace with hash 383330937, now seen corresponding path program 1 times [2023-11-23 20:37:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:30,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151224804] [2023-11-23 20:37:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:30,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:30,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:30,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:30,635 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:30,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151224804] [2023-11-23 20:37:30,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151224804] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:30,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:30,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:37:30,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288274204] [2023-11-23 20:37:30,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:30,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:37:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:37:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:37:30,642 INFO L87 Difference]: Start difference. First operand 21654 states and 85173 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:31,030 INFO L93 Difference]: Finished difference Result 15942 states and 60047 transitions. [2023-11-23 20:37:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:37:31,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-23 20:37:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:31,094 INFO L225 Difference]: With dead ends: 15942 [2023-11-23 20:37:31,094 INFO L226 Difference]: Without dead ends: 15942 [2023-11-23 20:37:31,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:37:31,095 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 148 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:31,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 59 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:31,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15942 states. [2023-11-23 20:37:31,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15942 to 15018. [2023-11-23 20:37:31,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15018 states, 14891 states have (on average 3.899805251494191) internal successors, (58072), 15017 states have internal predecessors, (58072), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:31,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15018 states to 15018 states and 58072 transitions. [2023-11-23 20:37:31,601 INFO L78 Accepts]: Start accepts. Automaton has 15018 states and 58072 transitions. Word has length 10 [2023-11-23 20:37:31,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:31,602 INFO L495 AbstractCegarLoop]: Abstraction has 15018 states and 58072 transitions. [2023-11-23 20:37:31,602 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:31,602 INFO L276 IsEmpty]: Start isEmpty. Operand 15018 states and 58072 transitions. [2023-11-23 20:37:31,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-11-23 20:37:31,603 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:31,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:31,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 20:37:31,604 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:31,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:31,605 INFO L85 PathProgramCache]: Analyzing trace with hash 383330938, now seen corresponding path program 1 times [2023-11-23 20:37:31,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:31,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409975999] [2023-11-23 20:37:31,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:31,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:31,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:32,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:32,412 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:32,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409975999] [2023-11-23 20:37:32,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409975999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:32,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:32,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:37:32,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562090907] [2023-11-23 20:37:32,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:32,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:37:32,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:32,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:37:32,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:32,415 INFO L87 Difference]: Start difference. First operand 15018 states and 58072 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:32,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:32,653 INFO L93 Difference]: Finished difference Result 8151 states and 30108 transitions. [2023-11-23 20:37:32,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:37:32,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-11-23 20:37:32,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:32,698 INFO L225 Difference]: With dead ends: 8151 [2023-11-23 20:37:32,698 INFO L226 Difference]: Without dead ends: 7892 [2023-11-23 20:37:32,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:32,700 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 126 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:32,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 28 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:37:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7892 states. [2023-11-23 20:37:32,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7892 to 7507. [2023-11-23 20:37:32,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7507 states, 7481 states have (on average 3.6972329902419463) internal successors, (27659), 7506 states have internal predecessors, (27659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7507 states to 7507 states and 27659 transitions. [2023-11-23 20:37:32,917 INFO L78 Accepts]: Start accepts. Automaton has 7507 states and 27659 transitions. Word has length 10 [2023-11-23 20:37:32,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:32,918 INFO L495 AbstractCegarLoop]: Abstraction has 7507 states and 27659 transitions. [2023-11-23 20:37:32,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:32,918 INFO L276 IsEmpty]: Start isEmpty. Operand 7507 states and 27659 transitions. [2023-11-23 20:37:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-23 20:37:32,921 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:32,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:32,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 20:37:32,922 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:32,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:32,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1580534122, now seen corresponding path program 1 times [2023-11-23 20:37:32,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:32,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166712301] [2023-11-23 20:37:32,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:32,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:32,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:33,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:33,030 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:33,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166712301] [2023-11-23 20:37:33,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166712301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:33,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:33,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 20:37:33,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85756410] [2023-11-23 20:37:33,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:33,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 20:37:33,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:33,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 20:37:33,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:33,032 INFO L87 Difference]: Start difference. First operand 7507 states and 27659 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:33,201 INFO L93 Difference]: Finished difference Result 7283 states and 26627 transitions. [2023-11-23 20:37:33,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 20:37:33,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-23 20:37:33,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:33,243 INFO L225 Difference]: With dead ends: 7283 [2023-11-23 20:37:33,244 INFO L226 Difference]: Without dead ends: 7283 [2023-11-23 20:37:33,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 20:37:33,245 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 25 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 34 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:37:33,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7283 states. [2023-11-23 20:37:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7283 to 7283. [2023-11-23 20:37:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7283 states, 7257 states have (on average 3.6691470304533556) internal successors, (26627), 7282 states have internal predecessors, (26627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:33,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7283 states to 7283 states and 26627 transitions. [2023-11-23 20:37:33,466 INFO L78 Accepts]: Start accepts. Automaton has 7283 states and 26627 transitions. Word has length 14 [2023-11-23 20:37:33,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:33,466 INFO L495 AbstractCegarLoop]: Abstraction has 7283 states and 26627 transitions. [2023-11-23 20:37:33,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:33,467 INFO L276 IsEmpty]: Start isEmpty. Operand 7283 states and 26627 transitions. [2023-11-23 20:37:33,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:37:33,469 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:33,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:33,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 20:37:33,469 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:33,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:33,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1525272357, now seen corresponding path program 1 times [2023-11-23 20:37:33,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:33,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635486282] [2023-11-23 20:37:33,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:33,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:33,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:33,582 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:33,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635486282] [2023-11-23 20:37:33,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635486282] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:33,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:33,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:37:33,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068052044] [2023-11-23 20:37:33,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:33,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:37:33,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:33,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:37:33,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:37:33,585 INFO L87 Difference]: Start difference. First operand 7283 states and 26627 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:33,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:33,825 INFO L93 Difference]: Finished difference Result 7983 states and 28137 transitions. [2023-11-23 20:37:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:37:33,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 20:37:33,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:33,866 INFO L225 Difference]: With dead ends: 7983 [2023-11-23 20:37:33,867 INFO L226 Difference]: Without dead ends: 7983 [2023-11-23 20:37:33,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:33,868 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 71 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:33,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 56 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7983 states. [2023-11-23 20:37:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7983 to 7038. [2023-11-23 20:37:34,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7038 states, 7013 states have (on average 3.6690432054755453) internal successors, (25731), 7037 states have internal predecessors, (25731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:34,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7038 states to 7038 states and 25731 transitions. [2023-11-23 20:37:34,324 INFO L78 Accepts]: Start accepts. Automaton has 7038 states and 25731 transitions. Word has length 16 [2023-11-23 20:37:34,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:34,325 INFO L495 AbstractCegarLoop]: Abstraction has 7038 states and 25731 transitions. [2023-11-23 20:37:34,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 7038 states and 25731 transitions. [2023-11-23 20:37:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-23 20:37:34,328 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:34,329 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:34,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 20:37:34,329 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:34,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:34,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1525272358, now seen corresponding path program 1 times [2023-11-23 20:37:34,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:34,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986852500] [2023-11-23 20:37:34,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:34,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:34,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:34,575 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:34,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986852500] [2023-11-23 20:37:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986852500] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:37:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205669289] [2023-11-23 20:37:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:34,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:37:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:34,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:37:34,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:34,579 INFO L87 Difference]: Start difference. First operand 7038 states and 25731 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:34,771 INFO L93 Difference]: Finished difference Result 6793 states and 24835 transitions. [2023-11-23 20:37:34,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:37:34,772 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-23 20:37:34,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:34,802 INFO L225 Difference]: With dead ends: 6793 [2023-11-23 20:37:34,802 INFO L226 Difference]: Without dead ends: 6793 [2023-11-23 20:37:34,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:37:34,803 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 110 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:34,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 43 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 20:37:34,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6793 states. [2023-11-23 20:37:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6793 to 6793. [2023-11-23 20:37:34,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6793 states, 6769 states have (on average 3.668931895405525) internal successors, (24835), 6792 states have internal predecessors, (24835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 24835 transitions. [2023-11-23 20:37:35,005 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 24835 transitions. Word has length 16 [2023-11-23 20:37:35,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:35,005 INFO L495 AbstractCegarLoop]: Abstraction has 6793 states and 24835 transitions. [2023-11-23 20:37:35,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 24835 transitions. [2023-11-23 20:37:35,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:37:35,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:35,011 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:35,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 20:37:35,011 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:35,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:35,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1095896328, now seen corresponding path program 1 times [2023-11-23 20:37:35,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:35,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368521325] [2023-11-23 20:37:35,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:35,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:35,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:35,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:35,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368521325] [2023-11-23 20:37:35,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368521325] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 20:37:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337934886] [2023-11-23 20:37:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:35,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 20:37:35,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:35,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 20:37:35,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:37:35,665 INFO L87 Difference]: Start difference. First operand 6793 states and 24835 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:36,050 INFO L93 Difference]: Finished difference Result 5827 states and 21053 transitions. [2023-11-23 20:37:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:37:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-23 20:37:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:36,076 INFO L225 Difference]: With dead ends: 5827 [2023-11-23 20:37:36,076 INFO L226 Difference]: Without dead ends: 5477 [2023-11-23 20:37:36,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-23 20:37:36,077 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:36,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 187 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 20:37:36,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5477 states. [2023-11-23 20:37:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5477 to 5477. [2023-11-23 20:37:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5477 states, 5465 states have (on average 3.5924977127172917) internal successors, (19633), 5476 states have internal predecessors, (19633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5477 states to 5477 states and 19633 transitions. [2023-11-23 20:37:36,245 INFO L78 Accepts]: Start accepts. Automaton has 5477 states and 19633 transitions. Word has length 18 [2023-11-23 20:37:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:36,246 INFO L495 AbstractCegarLoop]: Abstraction has 5477 states and 19633 transitions. [2023-11-23 20:37:36,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5477 states and 19633 transitions. [2023-11-23 20:37:36,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 20:37:36,251 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:36,251 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:36,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 20:37:36,251 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:36,252 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:36,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1095897674, now seen corresponding path program 1 times [2023-11-23 20:37:36,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:36,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156713581] [2023-11-23 20:37:36,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:36,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:36,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:36,460 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:36,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156713581] [2023-11-23 20:37:36,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156713581] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:36,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:36,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 20:37:36,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847812128] [2023-11-23 20:37:36,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:36,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 20:37:36,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 20:37:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 20:37:36,463 INFO L87 Difference]: Start difference. First operand 5477 states and 19633 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:36,689 INFO L93 Difference]: Finished difference Result 3880 states and 12962 transitions. [2023-11-23 20:37:36,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 20:37:36,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-11-23 20:37:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:36,709 INFO L225 Difference]: With dead ends: 3880 [2023-11-23 20:37:36,709 INFO L226 Difference]: Without dead ends: 3537 [2023-11-23 20:37:36,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:36,711 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:36,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 41 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:36,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3537 states. [2023-11-23 20:37:36,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3537 to 3537. [2023-11-23 20:37:36,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3537 states, 3525 states have (on average 3.369645390070922) internal successors, (11878), 3536 states have internal predecessors, (11878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3537 states to 3537 states and 11878 transitions. [2023-11-23 20:37:36,881 INFO L78 Accepts]: Start accepts. Automaton has 3537 states and 11878 transitions. Word has length 18 [2023-11-23 20:37:36,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:36,881 INFO L495 AbstractCegarLoop]: Abstraction has 3537 states and 11878 transitions. [2023-11-23 20:37:36,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:36,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states and 11878 transitions. [2023-11-23 20:37:36,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-23 20:37:36,887 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:36,887 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:36,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 20:37:36,888 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:36,888 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:36,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1275855655, now seen corresponding path program 1 times [2023-11-23 20:37:36,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:36,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026195716] [2023-11-23 20:37:36,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:36,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:37,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:37,171 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:37,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026195716] [2023-11-23 20:37:37,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026195716] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:37,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:37,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 20:37:37,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776809806] [2023-11-23 20:37:37,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:37,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 20:37:37,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:37,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 20:37:37,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 20:37:37,176 INFO L87 Difference]: Start difference. First operand 3537 states and 11878 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:37,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:37,412 INFO L93 Difference]: Finished difference Result 1779 states and 5543 transitions. [2023-11-23 20:37:37,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 20:37:37,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-11-23 20:37:37,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:37,419 INFO L225 Difference]: With dead ends: 1779 [2023-11-23 20:37:37,419 INFO L226 Difference]: Without dead ends: 1561 [2023-11-23 20:37:37,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-23 20:37:37,421 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 117 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:37,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 53 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2023-11-23 20:37:37,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1561. [2023-11-23 20:37:37,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1561 states, 1555 states have (on average 3.1086816720257233) internal successors, (4834), 1560 states have internal predecessors, (4834), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 4834 transitions. [2023-11-23 20:37:37,472 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 4834 transitions. Word has length 23 [2023-11-23 20:37:37,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:37,473 INFO L495 AbstractCegarLoop]: Abstraction has 1561 states and 4834 transitions. [2023-11-23 20:37:37,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:37,473 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 4834 transitions. [2023-11-23 20:37:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-23 20:37:37,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:37,479 INFO L195 NwaCegarLoop]: 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] [2023-11-23 20:37:37,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 20:37:37,479 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:37,480 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1114567039, now seen corresponding path program 1 times [2023-11-23 20:37:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527695532] [2023-11-23 20:37:37,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:37,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:37,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:37,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:37,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:37,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527695532] [2023-11-23 20:37:37,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527695532] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:37,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:37,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:37:37,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557029391] [2023-11-23 20:37:37,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:37,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:37:37,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:37,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:37:37,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:37:37,809 INFO L87 Difference]: Start difference. First operand 1561 states and 4834 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:38,011 INFO L93 Difference]: Finished difference Result 989 states and 3066 transitions. [2023-11-23 20:37:38,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:37:38,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-23 20:37:38,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:38,017 INFO L225 Difference]: With dead ends: 989 [2023-11-23 20:37:38,017 INFO L226 Difference]: Without dead ends: 921 [2023-11-23 20:37:38,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:37:38,018 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 153 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:38,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 38 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:38,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2023-11-23 20:37:38,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2023-11-23 20:37:38,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 3.110869565217391) internal successors, (2862), 920 states have internal predecessors, (2862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 2862 transitions. [2023-11-23 20:37:38,050 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 2862 transitions. Word has length 28 [2023-11-23 20:37:38,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:38,051 INFO L495 AbstractCegarLoop]: Abstraction has 921 states and 2862 transitions. [2023-11-23 20:37:38,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,051 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 2862 transitions. [2023-11-23 20:37:38,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 20:37:38,056 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:38,056 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:38,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 20:37:38,057 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:38,057 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash 419682570, now seen corresponding path program 1 times [2023-11-23 20:37:38,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:38,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397589385] [2023-11-23 20:37:38,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:38,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 20:37:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 20:37:38,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-23 20:37:38,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397589385] [2023-11-23 20:37:38,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397589385] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 20:37:38,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 20:37:38,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 20:37:38,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223110628] [2023-11-23 20:37:38,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 20:37:38,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 20:37:38,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-23 20:37:38,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 20:37:38,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 20:37:38,592 INFO L87 Difference]: Start difference. First operand 921 states and 2862 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 20:37:38,798 INFO L93 Difference]: Finished difference Result 1241 states and 3776 transitions. [2023-11-23 20:37:38,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 20:37:38,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2023-11-23 20:37:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 20:37:38,802 INFO L225 Difference]: With dead ends: 1241 [2023-11-23 20:37:38,802 INFO L226 Difference]: Without dead ends: 591 [2023-11-23 20:37:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-11-23 20:37:38,803 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 20:37:38,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 69 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 20:37:38,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2023-11-23 20:37:38,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2023-11-23 20:37:38,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 590 states have (on average 2.9101694915254237) internal successors, (1717), 590 states have internal predecessors, (1717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 1717 transitions. [2023-11-23 20:37:38,824 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 1717 transitions. Word has length 33 [2023-11-23 20:37:38,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 20:37:38,825 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 1717 transitions. [2023-11-23 20:37:38,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 20:37:38,825 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 1717 transitions. [2023-11-23 20:37:38,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-23 20:37:38,830 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 20:37:38,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 20:37:38,831 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-11-23 20:37:38,832 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 20:37:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -983557844, now seen corresponding path program 2 times [2023-11-23 20:37:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-23 20:37:38,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114473206] [2023-11-23 20:37:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 20:37:38,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 20:37:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:37:38,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 20:37:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 20:37:39,223 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-23 20:37:39,223 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 20:37:39,225 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (66 of 67 remaining) [2023-11-23 20:37:39,227 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (65 of 67 remaining) [2023-11-23 20:37:39,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 67 remaining) [2023-11-23 20:37:39,229 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 67 remaining) [2023-11-23 20:37:39,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 67 remaining) [2023-11-23 20:37:39,234 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 67 remaining) [2023-11-23 20:37:39,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 67 remaining) [2023-11-23 20:37:39,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 67 remaining) [2023-11-23 20:37:39,235 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 67 remaining) [2023-11-23 20:37:39,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 67 remaining) [2023-11-23 20:37:39,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 67 remaining) [2023-11-23 20:37:39,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 67 remaining) [2023-11-23 20:37:39,236 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 67 remaining) [2023-11-23 20:37:39,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 67 remaining) [2023-11-23 20:37:39,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 67 remaining) [2023-11-23 20:37:39,237 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 67 remaining) [2023-11-23 20:37:39,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 67 remaining) [2023-11-23 20:37:39,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 67 remaining) [2023-11-23 20:37:39,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 67 remaining) [2023-11-23 20:37:39,238 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 67 remaining) [2023-11-23 20:37:39,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 67 remaining) [2023-11-23 20:37:39,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 67 remaining) [2023-11-23 20:37:39,239 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 67 remaining) [2023-11-23 20:37:39,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 67 remaining) [2023-11-23 20:37:39,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 67 remaining) [2023-11-23 20:37:39,240 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 67 remaining) [2023-11-23 20:37:39,241 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 67 remaining) [2023-11-23 20:37:39,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 67 remaining) [2023-11-23 20:37:39,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 67 remaining) [2023-11-23 20:37:39,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 67 remaining) [2023-11-23 20:37:39,242 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 67 remaining) [2023-11-23 20:37:39,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 67 remaining) [2023-11-23 20:37:39,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 67 remaining) [2023-11-23 20:37:39,243 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 67 remaining) [2023-11-23 20:37:39,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 67 remaining) [2023-11-23 20:37:39,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 67 remaining) [2023-11-23 20:37:39,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 67 remaining) [2023-11-23 20:37:39,244 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 67 remaining) [2023-11-23 20:37:39,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (28 of 67 remaining) [2023-11-23 20:37:39,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 67 remaining) [2023-11-23 20:37:39,245 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 67 remaining) [2023-11-23 20:37:39,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 67 remaining) [2023-11-23 20:37:39,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 67 remaining) [2023-11-23 20:37:39,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 67 remaining) [2023-11-23 20:37:39,246 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 67 remaining) [2023-11-23 20:37:39,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 67 remaining) [2023-11-23 20:37:39,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 67 remaining) [2023-11-23 20:37:39,247 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 67 remaining) [2023-11-23 20:37:39,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 67 remaining) [2023-11-23 20:37:39,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 67 remaining) [2023-11-23 20:37:39,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 67 remaining) [2023-11-23 20:37:39,248 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 67 remaining) [2023-11-23 20:37:39,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 67 remaining) [2023-11-23 20:37:39,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 67 remaining) [2023-11-23 20:37:39,249 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 67 remaining) [2023-11-23 20:37:39,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 67 remaining) [2023-11-23 20:37:39,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 67 remaining) [2023-11-23 20:37:39,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 67 remaining) [2023-11-23 20:37:39,250 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 67 remaining) [2023-11-23 20:37:39,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 67 remaining) [2023-11-23 20:37:39,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 67 remaining) [2023-11-23 20:37:39,251 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 67 remaining) [2023-11-23 20:37:39,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 67 remaining) [2023-11-23 20:37:39,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 67 remaining) [2023-11-23 20:37:39,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 67 remaining) [2023-11-23 20:37:39,252 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 67 remaining) [2023-11-23 20:37:39,253 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 67 remaining) [2023-11-23 20:37:39,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 20:37:39,259 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 20:37:39,268 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 20:37:39,268 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 20:37:39,407 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated [2023-11-23 20:37:39,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated [2023-11-23 20:37:39,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated [2023-11-23 20:37:39,446 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 20:37:39,461 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 20:37:39,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:37:39 BasicIcfg [2023-11-23 20:37:39,482 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 20:37:39,483 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 20:37:39,484 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 20:37:39,484 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 20:37:39,485 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:37:06" (3/4) ... [2023-11-23 20:37:39,487 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 20:37:39,488 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 20:37:39,490 INFO L158 Benchmark]: Toolchain (without parser) took 35286.03ms. Allocated memory was 167.8MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 135.7MB in the beginning and 11.3GB in the end (delta: -11.1GB). Peak memory consumption was 1.7GB. Max. memory is 16.1GB. [2023-11-23 20:37:39,491 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:37:39,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.88ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 111.2MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2023-11-23 20:37:39,492 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.90ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:37:39,492 INFO L158 Benchmark]: Boogie Preprocessor took 90.29ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 20:37:39,493 INFO L158 Benchmark]: RCFGBuilder took 1662.19ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.4MB in the end (delta: 16.5MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. [2023-11-23 20:37:39,493 INFO L158 Benchmark]: TraceAbstraction took 32729.90ms. Allocated memory was 167.8MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 89.4MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-11-23 20:37:39,494 INFO L158 Benchmark]: Witness Printer took 5.30ms. Allocated memory is still 13.0GB. Free memory is still 11.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 20:37:39,497 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.34ms. Allocated memory is still 125.8MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.88ms. Allocated memory is still 167.8MB. Free memory was 135.7MB in the beginning and 111.2MB in the end (delta: 24.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.90ms. Allocated memory is still 167.8MB. Free memory was 111.2MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.29ms. Allocated memory is still 167.8MB. Free memory was 108.2MB in the beginning and 105.9MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1662.19ms. Allocated memory is still 167.8MB. Free memory was 105.9MB in the beginning and 89.4MB in the end (delta: 16.5MB). Peak memory consumption was 52.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32729.90ms. Allocated memory was 167.8MB in the beginning and 13.0GB in the end (delta: 12.8GB). Free memory was 89.4MB in the beginning and 11.3GB in the end (delta: -11.2GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. * Witness Printer took 5.30ms. Allocated memory is still 13.0GB. Free memory is still 11.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre29 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L716] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L717] 0 int __unbuffered_p2_EAX$mem_tmp; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L726] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L727] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L728] 0 int __unbuffered_p2_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L730] 0 int __unbuffered_p2_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L738] 0 _Bool y$flush_delayed; [L739] 0 int y$mem_tmp; [L740] 0 _Bool y$r_buff0_thd0; [L741] 0 _Bool y$r_buff0_thd1; [L742] 0 _Bool y$r_buff0_thd2; [L743] 0 _Bool y$r_buff0_thd3; [L744] 0 _Bool y$r_buff1_thd0; [L745] 0 _Bool y$r_buff1_thd1; [L746] 0 _Bool y$r_buff1_thd2; [L747] 0 _Bool y$r_buff1_thd3; [L748] 0 _Bool y$read_delayed; [L749] 0 int *y$read_delayed_var; [L750] 0 int y$w_buff0; [L751] 0 _Bool y$w_buff0_used; [L752] 0 int y$w_buff1; [L753] 0 _Bool y$w_buff1_used; [L755] 0 int z = 0; [L756] 0 _Bool weak$$choice0; [L757] 0 _Bool weak$$choice1; [L758] 0 _Bool weak$$choice2; [L850] 0 pthread_t t2052; [L851] FCALL, FORK 0 pthread_create(&t2052, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, 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}, z=0] [L852] 0 pthread_t t2053; [L853] FCALL, FORK 0 pthread_create(&t2053, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, 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}, z=0] [L854] 0 pthread_t t2054; [L855] FCALL, FORK 0 pthread_create(&t2054, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, 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}, z=0] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 y$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(y) [L809] 3 y$mem_tmp = y [L810] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] EXPR 3 \read(y) [L811] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L811] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L812] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L813] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L814] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L815] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L816] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L817] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L818] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L819] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L820] EXPR 3 \read(y) [L820] 3 __unbuffered_p2_EAX = y [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] EXPR 3 \read(y) [L821] EXPR 3 y$flush_delayed ? y$mem_tmp : y [L821] 3 y = y$flush_delayed ? y$mem_tmp : y [L822] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=0] [L825] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L762] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L765] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L828] 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) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] EXPR 3 \read(y) [L828] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L828] 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) [L828] 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) [L829] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L830] 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 [L831] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L832] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=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}, z=1] [L777] 2 x = 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=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}, z=1] [L780] 2 y$w_buff1 = y$w_buff0 [L781] 2 y$w_buff0 = 1 [L782] 2 y$w_buff1_used = y$w_buff0_used [L783] 2 y$w_buff0_used = (_Bool)1 [L784] CALL 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L784] RET 2 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L785] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L786] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L787] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L788] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L789] 2 y$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L792] 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) [L792] 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) [L793] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L794] 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 [L795] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 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 [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L859] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L859] RET 0 assume_abort_if_not(main$tmp_guard0) [L861] 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) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] EXPR 0 \read(y) [L861] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L861] 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) [L861] 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) [L862] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L863] 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 [L864] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L865] 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 [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L869] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2052={5:0}, t2053={7:0}, t2054={8:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L872] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] [L17] 0 __assert_fail ("0", "safe012_power.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=0, x=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y={3:0}, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -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: 848]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 853]: 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: 855]: 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: 851]: 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, 131 locations, 67 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.2s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1349 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1349 mSDsluCounter, 898 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 507 mSDsCounter, 125 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1656 IncrementalHoareTripleChecker+Invalid, 1781 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 125 mSolverCounterUnsat, 391 mSDtfsCounter, 1656 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48025occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 13.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 15127 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 268 NumberOfCodeBlocks, 268 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 1039 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 20:37:39,552 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 20:37:42,480 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 20:37:42,592 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-23 20:37:42,601 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 20:37:42,602 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 20:37:42,656 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 20:37:42,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 20:37:42,661 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 20:37:42,662 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 20:37:42,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 20:37:42,668 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-23 20:37:42,668 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-23 20:37:42,669 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-23 20:37:42,671 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-23 20:37:42,671 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-23 20:37:42,672 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-23 20:37:42,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 20:37:42,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 20:37:42,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 20:37:42,675 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 20:37:42,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 20:37:42,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 20:37:42,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 20:37:42,677 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 20:37:42,677 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 20:37:42,678 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 20:37:42,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 20:37:42,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 20:37:42,679 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 20:37:42,680 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 20:37:42,681 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 20:37:42,682 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 20:37:42,682 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 20:37:42,683 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 20:37:42,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 20:37:42,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 20:37:42,684 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 20:37:42,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 20:37:42,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 20:37:42,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 20:37:42,687 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-23 20:37:42,687 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 20:37:42,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 20:37:42,688 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-23 20:37:42,688 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 20:37:42,689 INFO L153 SettingsManager]: * Logic for external solver=AUFBV 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_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/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_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire 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 -> Taipan 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 -> 697ff70a4856546a25a8cc2eb04fc80299855e02086960ffcc9a4790310db5da [2023-11-23 20:37:43,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 20:37:43,278 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 20:37:43,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 20:37:43,285 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 20:37:43,285 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 20:37:43,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b99fe915-36ec-49e2-9ec3-cbc7135a5899/bin/utaipan-verify-mE87zJ7Ire/../../sv-benchmarks/c/pthread-wmm/safe012_power.opt.i