./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91 --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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:03:41,953 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:03:42,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-25 00:03:42,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:03:42,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:03:42,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:03:42,189 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:03:42,190 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:03:42,191 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:03:42,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:03:42,200 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:03:42,201 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:03:42,202 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:03:42,204 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-25 00:03:42,205 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:03:42,205 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:03:42,206 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-25 00:03:42,206 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-25 00:03:42,236 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:03:42,237 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-25 00:03:42,237 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-25 00:03:42,238 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-25 00:03:42,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-25 00:03:42,239 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-25 00:03:42,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:03:42,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:03:42,240 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:03:42,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:03:42,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:03:42,241 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-25 00:03:42,242 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-25 00:03:42,242 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-25 00:03:42,243 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:03:42,243 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:03:42,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:03:42,244 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:03:42,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:03:42,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:03:42,244 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:03:42,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:03:42,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:42,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:03:42,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:03:42,246 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-25 00:03:42,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-25 00:03:42,247 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:03:42,247 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:03:42,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:03:42,247 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_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/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_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-25 00:03:42,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:03:42,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:03:42,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:03:42,541 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:03:42,542 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:03:42,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:03:45,827 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:03:46,221 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:03:46,221 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:03:46,252 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/f67af3487/fcef39d886d043ecb46c2a3c15f451b3/FLAGddae9e2f3 [2023-11-25 00:03:46,271 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/f67af3487/fcef39d886d043ecb46c2a3c15f451b3 [2023-11-25 00:03:46,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:03:46,275 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:03:46,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:46,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:03:46,289 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:03:46,290 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:46,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd33b1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46, skipping insertion in model container [2023-11-25 00:03:46,292 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:46,362 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:03:46,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:46,778 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:03:46,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:03:46,949 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:03:46,949 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:03:46,957 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:03:46,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46 WrapperNode [2023-11-25 00:03:46,958 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:03:46,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:46,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:03:46,960 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:03:46,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,009 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,066 INFO L138 Inliner]: procedures = 176, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 134 [2023-11-25 00:03:47,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:03:47,068 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:03:47,068 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:03:47,069 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:03:47,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,079 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,093 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,143 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,145 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,159 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:03:47,161 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:03:47,161 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:03:47,161 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:03:47,162 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (1/1) ... [2023-11-25 00:03:47,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:03:47,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:03:47,201 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:03:47,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:03:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-25 00:03:47,255 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-25 00:03:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:03:47,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:03:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:03:47,258 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-25 00:03:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-25 00:03:47,259 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-25 00:03:47,259 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-25 00:03:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-25 00:03:47,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-25 00:03:47,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-25 00:03:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-25 00:03:47,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:03:47,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:03:47,263 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:03:47,510 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:03:47,514 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:03:48,008 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:03:48,387 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:03:48,387 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:03:48,389 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:48 BoogieIcfgContainer [2023-11-25 00:03:48,390 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:03:48,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:03:48,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:03:48,398 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:03:48,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:03:46" (1/3) ... [2023-11-25 00:03:48,399 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0a9265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:48, skipping insertion in model container [2023-11-25 00:03:48,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:03:46" (2/3) ... [2023-11-25 00:03:48,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e0a9265 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:03:48, skipping insertion in model container [2023-11-25 00:03:48,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:48" (3/3) ... [2023-11-25 00:03:48,404 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:03:48,431 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:03:48,431 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-25 00:03:48,431 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:03:48,493 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-25 00:03:48,534 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 53 transitions, 118 flow [2023-11-25 00:03:48,944 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:48,972 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:03:48,983 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;@2fcdf7a7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:03:48,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-25 00:03:49,012 INFO L276 IsEmpty]: Start isEmpty. Operand has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:49,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-25 00:03:49,019 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:49,020 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-25 00:03:49,021 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:49,033 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:49,034 INFO L85 PathProgramCache]: Analyzing trace with hash 12243, now seen corresponding path program 1 times [2023-11-25 00:03:49,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:49,050 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475565557] [2023-11-25 00:03:49,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:49,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:49,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:49,409 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-25 00:03:49,410 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:49,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475565557] [2023-11-25 00:03:49,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475565557] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:49,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:49,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:03:49,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271385592] [2023-11-25 00:03:49,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:49,420 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:49,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:49,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:49,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:49,501 INFO L87 Difference]: Start difference. First operand has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 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-25 00:03:49,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:49,756 INFO L93 Difference]: Finished difference Result 5562 states and 19230 transitions. [2023-11-25 00:03:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:49,758 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-25 00:03:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:49,923 INFO L225 Difference]: With dead ends: 5562 [2023-11-25 00:03:49,924 INFO L226 Difference]: Without dead ends: 5562 [2023-11-25 00:03:49,925 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-25 00:03:49,929 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:49,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:49,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2023-11-25 00:03:50,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5562. [2023-11-25 00:03:50,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5550 states have (on average 3.464864864864865) internal successors, (19230), 5561 states have internal predecessors, (19230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 19230 transitions. [2023-11-25 00:03:50,442 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 19230 transitions. Word has length 2 [2023-11-25 00:03:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:50,443 INFO L495 AbstractCegarLoop]: Abstraction has 5562 states and 19230 transitions. [2023-11-25 00:03:50,444 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-25 00:03:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 19230 transitions. [2023-11-25 00:03:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-25 00:03:50,446 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:50,446 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-25 00:03:50,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-25 00:03:50,447 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:50,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:50,448 INFO L85 PathProgramCache]: Analyzing trace with hash 12244, now seen corresponding path program 1 times [2023-11-25 00:03:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899058059] [2023-11-25 00:03:50,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:50,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:50,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:50,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:50,680 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:50,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899058059] [2023-11-25 00:03:50,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899058059] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:50,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:50,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:03:50,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135706344] [2023-11-25 00:03:50,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:50,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:50,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:50,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:50,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:50,684 INFO L87 Difference]: Start difference. First operand 5562 states and 19230 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-25 00:03:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:50,838 INFO L93 Difference]: Finished difference Result 5561 states and 19229 transitions. [2023-11-25 00:03:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:50,839 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-25 00:03:50,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:50,951 INFO L225 Difference]: With dead ends: 5561 [2023-11-25 00:03:50,952 INFO L226 Difference]: Without dead ends: 5561 [2023-11-25 00:03:50,952 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-25 00:03:50,954 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:50,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:50,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2023-11-25 00:03:51,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 5561. [2023-11-25 00:03:51,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5561 states, 5550 states have (on average 3.4646846846846846) internal successors, (19229), 5560 states have internal predecessors, (19229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:51,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 19229 transitions. [2023-11-25 00:03:51,268 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 19229 transitions. Word has length 2 [2023-11-25 00:03:51,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:51,269 INFO L495 AbstractCegarLoop]: Abstraction has 5561 states and 19229 transitions. [2023-11-25 00:03:51,269 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-25 00:03:51,269 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 19229 transitions. [2023-11-25 00:03:51,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:03:51,270 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:51,270 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:03:51,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-25 00:03:51,270 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:51,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:51,271 INFO L85 PathProgramCache]: Analyzing trace with hash 365098256, now seen corresponding path program 1 times [2023-11-25 00:03:51,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:51,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434062287] [2023-11-25 00:03:51,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:51,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:51,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:51,344 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-25 00:03:51,344 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:51,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434062287] [2023-11-25 00:03:51,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434062287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:51,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:51,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:51,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516697757] [2023-11-25 00:03:51,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:51,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:51,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:51,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:51,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:51,348 INFO L87 Difference]: Start difference. First operand 5561 states and 19229 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-25 00:03:51,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:51,484 INFO L93 Difference]: Finished difference Result 5554 states and 19216 transitions. [2023-11-25 00:03:51,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:51,485 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-25 00:03:51,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:51,531 INFO L225 Difference]: With dead ends: 5554 [2023-11-25 00:03:51,531 INFO L226 Difference]: Without dead ends: 5554 [2023-11-25 00:03:51,532 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-25 00:03:51,533 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:51,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:51,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2023-11-25 00:03:51,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 5554. [2023-11-25 00:03:51,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5554 states, 5544 states have (on average 3.466089466089466) internal successors, (19216), 5553 states have internal predecessors, (19216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:51,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 19216 transitions. [2023-11-25 00:03:51,875 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 19216 transitions. Word has length 5 [2023-11-25 00:03:51,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:51,876 INFO L495 AbstractCegarLoop]: Abstraction has 5554 states and 19216 transitions. [2023-11-25 00:03:51,876 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-25 00:03:51,876 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 19216 transitions. [2023-11-25 00:03:51,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:03:51,877 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:51,877 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:03:51,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-25 00:03:51,878 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:51,878 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:51,879 INFO L85 PathProgramCache]: Analyzing trace with hash 365098257, now seen corresponding path program 1 times [2023-11-25 00:03:51,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:51,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878385525] [2023-11-25 00:03:51,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:51,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:51,992 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-25 00:03:51,993 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:51,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878385525] [2023-11-25 00:03:51,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878385525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:51,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:51,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:51,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278590387] [2023-11-25 00:03:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:51,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:51,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:51,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:51,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:51,997 INFO L87 Difference]: Start difference. First operand 5554 states and 19216 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-25 00:03:52,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:52,247 INFO L93 Difference]: Finished difference Result 5547 states and 19203 transitions. [2023-11-25 00:03:52,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:52,248 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-25 00:03:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:52,294 INFO L225 Difference]: With dead ends: 5547 [2023-11-25 00:03:52,294 INFO L226 Difference]: Without dead ends: 5547 [2023-11-25 00:03:52,295 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-25 00:03:52,306 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:52,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 35 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:52,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2023-11-25 00:03:52,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 5547. [2023-11-25 00:03:52,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 5538 states have (on average 3.4674972914409534) internal successors, (19203), 5546 states have internal predecessors, (19203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:52,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 19203 transitions. [2023-11-25 00:03:52,537 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 19203 transitions. Word has length 5 [2023-11-25 00:03:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:52,537 INFO L495 AbstractCegarLoop]: Abstraction has 5547 states and 19203 transitions. [2023-11-25 00:03:52,537 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-25 00:03:52,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 19203 transitions. [2023-11-25 00:03:52,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:03:52,538 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:52,538 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:52,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-25 00:03:52,539 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:52,607 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:52,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1785316993, now seen corresponding path program 1 times [2023-11-25 00:03:52,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:52,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325261645] [2023-11-25 00:03:52,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:52,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:52,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:52,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:52,822 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:52,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325261645] [2023-11-25 00:03:52,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325261645] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:52,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:52,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:03:52,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298486248] [2023-11-25 00:03:52,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:52,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:52,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:52,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:52,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:52,825 INFO L87 Difference]: Start difference. First operand 5547 states and 19203 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:03:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:52,983 INFO L93 Difference]: Finished difference Result 4826 states and 16604 transitions. [2023-11-25 00:03:52,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:52,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:03:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:53,009 INFO L225 Difference]: With dead ends: 4826 [2023-11-25 00:03:53,010 INFO L226 Difference]: Without dead ends: 4728 [2023-11-25 00:03:53,010 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-25 00:03:53,011 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:53,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:53,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2023-11-25 00:03:53,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 4728. [2023-11-25 00:03:53,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4728 states, 4724 states have (on average 3.4481371718882303) internal successors, (16289), 4727 states have internal predecessors, (16289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:53,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 16289 transitions. [2023-11-25 00:03:53,272 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 16289 transitions. Word has length 8 [2023-11-25 00:03:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:53,272 INFO L495 AbstractCegarLoop]: Abstraction has 4728 states and 16289 transitions. [2023-11-25 00:03:53,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:03:53,273 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 16289 transitions. [2023-11-25 00:03:53,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:03:53,273 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:53,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:53,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-25 00:03:53,274 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:53,275 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:53,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1785315236, now seen corresponding path program 1 times [2023-11-25 00:03:53,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:53,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58799811] [2023-11-25 00:03:53,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:53,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:53,327 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-25 00:03:53,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:53,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58799811] [2023-11-25 00:03:53,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58799811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:53,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:53,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:53,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860158057] [2023-11-25 00:03:53,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:53,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:53,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:53,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:53,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:53,331 INFO L87 Difference]: Start difference. First operand 4728 states and 16289 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-25 00:03:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:53,439 INFO L93 Difference]: Finished difference Result 4679 states and 16156 transitions. [2023-11-25 00:03:53,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:53,440 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-25 00:03:53,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:53,467 INFO L225 Difference]: With dead ends: 4679 [2023-11-25 00:03:53,468 INFO L226 Difference]: Without dead ends: 4679 [2023-11-25 00:03:53,468 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-25 00:03:53,469 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:53,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2023-11-25 00:03:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4679. [2023-11-25 00:03:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4679 states, 4676 states have (on average 3.4550898203592815) internal successors, (16156), 4678 states have internal predecessors, (16156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 16156 transitions. [2023-11-25 00:03:53,778 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 16156 transitions. Word has length 8 [2023-11-25 00:03:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:53,780 INFO L495 AbstractCegarLoop]: Abstraction has 4679 states and 16156 transitions. [2023-11-25 00:03:53,780 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-25 00:03:53,780 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 16156 transitions. [2023-11-25 00:03:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:03:53,781 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:53,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:03:53,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-25 00:03:53,782 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:53,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1785315237, now seen corresponding path program 1 times [2023-11-25 00:03:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:53,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052575398] [2023-11-25 00:03:53,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:53,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:53,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:53,889 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-25 00:03:53,889 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:53,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052575398] [2023-11-25 00:03:53,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052575398] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:53,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:53,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:03:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547021650] [2023-11-25 00:03:53,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:53,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:03:53,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:53,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:03:53,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:03:53,893 INFO L87 Difference]: Start difference. First operand 4679 states and 16156 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-25 00:03:54,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:54,037 INFO L93 Difference]: Finished difference Result 4630 states and 16023 transitions. [2023-11-25 00:03:54,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:03:54,038 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-25 00:03:54,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:54,070 INFO L225 Difference]: With dead ends: 4630 [2023-11-25 00:03:54,071 INFO L226 Difference]: Without dead ends: 4630 [2023-11-25 00:03:54,071 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-25 00:03:54,074 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:54,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:03:54,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-11-25 00:03:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4630. [2023-11-25 00:03:54,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4628 states have (on average 3.4621866897147795) internal successors, (16023), 4629 states have internal predecessors, (16023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:54,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 16023 transitions. [2023-11-25 00:03:54,316 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 16023 transitions. Word has length 8 [2023-11-25 00:03:54,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:54,316 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 16023 transitions. [2023-11-25 00:03:54,317 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-25 00:03:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 16023 transitions. [2023-11-25 00:03:54,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:03:54,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:54,333 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-25 00:03:54,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-25 00:03:54,335 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:54,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 651239029, now seen corresponding path program 1 times [2023-11-25 00:03:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:54,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895712915] [2023-11-25 00:03:54,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:54,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:55,094 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-25 00:03:55,094 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:55,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895712915] [2023-11-25 00:03:55,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895712915] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:55,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:55,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:03:55,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382843004] [2023-11-25 00:03:55,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:55,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:03:55,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:55,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:03:55,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:03:55,097 INFO L87 Difference]: Start difference. First operand 4630 states and 16023 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-25 00:03:55,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:55,620 INFO L93 Difference]: Finished difference Result 7542 states and 25932 transitions. [2023-11-25 00:03:55,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:03:55,621 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-25 00:03:55,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:55,663 INFO L225 Difference]: With dead ends: 7542 [2023-11-25 00:03:55,663 INFO L226 Difference]: Without dead ends: 6856 [2023-11-25 00:03:55,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:03:55,665 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 81 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:55,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 241 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:03:55,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6856 states. [2023-11-25 00:03:55,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6856 to 6121. [2023-11-25 00:03:55,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 6119 states have (on average 3.455466579506455) internal successors, (21144), 6120 states have internal predecessors, (21144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:56,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 21144 transitions. [2023-11-25 00:03:56,019 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 21144 transitions. Word has length 18 [2023-11-25 00:03:56,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:56,020 INFO L495 AbstractCegarLoop]: Abstraction has 6121 states and 21144 transitions. [2023-11-25 00:03:56,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 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-25 00:03:56,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 21144 transitions. [2023-11-25 00:03:56,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:03:56,027 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:56,027 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-25 00:03:56,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-25 00:03:56,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:56,030 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:56,030 INFO L85 PathProgramCache]: Analyzing trace with hash 651238583, now seen corresponding path program 1 times [2023-11-25 00:03:56,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:56,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723531992] [2023-11-25 00:03:56,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:56,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:56,342 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-25 00:03:56,342 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:56,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723531992] [2023-11-25 00:03:56,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723531992] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:56,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:56,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:03:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358367037] [2023-11-25 00:03:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:56,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:03:56,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:56,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:03:56,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:03:56,351 INFO L87 Difference]: Start difference. First operand 6121 states and 21144 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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-25 00:03:56,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:56,710 INFO L93 Difference]: Finished difference Result 6667 states and 22739 transitions. [2023-11-25 00:03:56,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:03:56,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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-25 00:03:56,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:56,745 INFO L225 Difference]: With dead ends: 6667 [2023-11-25 00:03:56,745 INFO L226 Difference]: Without dead ends: 5981 [2023-11-25 00:03:56,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-25 00:03:56,746 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 84 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:56,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 132 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:03:56,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5981 states. [2023-11-25 00:03:56,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5981 to 5981. [2023-11-25 00:03:56,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5981 states, 5979 states have (on average 3.4460612142498745) internal successors, (20604), 5980 states have internal predecessors, (20604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:56,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5981 states to 5981 states and 20604 transitions. [2023-11-25 00:03:56,999 INFO L78 Accepts]: Start accepts. Automaton has 5981 states and 20604 transitions. Word has length 18 [2023-11-25 00:03:57,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:57,000 INFO L495 AbstractCegarLoop]: Abstraction has 5981 states and 20604 transitions. [2023-11-25 00:03:57,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 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-25 00:03:57,000 INFO L276 IsEmpty]: Start isEmpty. Operand 5981 states and 20604 transitions. [2023-11-25 00:03:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-25 00:03:57,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:57,012 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] [2023-11-25 00:03:57,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-25 00:03:57,013 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:57,013 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash 1598891124, now seen corresponding path program 1 times [2023-11-25 00:03:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485994906] [2023-11-25 00:03:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:57,838 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-25 00:03:57,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:57,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485994906] [2023-11-25 00:03:57,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485994906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:57,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:57,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-25 00:03:57,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719734315] [2023-11-25 00:03:57,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:57,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:03:57,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:57,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:03:57,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:03:57,842 INFO L87 Difference]: Start difference. First operand 5981 states and 20604 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:58,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:58,349 INFO L93 Difference]: Finished difference Result 8546 states and 29511 transitions. [2023-11-25 00:03:58,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:03:58,350 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-25 00:03:58,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:58,400 INFO L225 Difference]: With dead ends: 8546 [2023-11-25 00:03:58,400 INFO L226 Difference]: Without dead ends: 7811 [2023-11-25 00:03:58,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-25 00:03:58,402 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 122 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:58,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 222 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-25 00:03:58,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7811 states. [2023-11-25 00:03:58,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7811 to 3461. [2023-11-25 00:03:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3461 states, 3460 states have (on average 3.4127167630057804) internal successors, (11808), 3460 states have internal predecessors, (11808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:58,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3461 states to 3461 states and 11808 transitions. [2023-11-25 00:03:58,586 INFO L78 Accepts]: Start accepts. Automaton has 3461 states and 11808 transitions. Word has length 20 [2023-11-25 00:03:58,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:58,587 INFO L495 AbstractCegarLoop]: Abstraction has 3461 states and 11808 transitions. [2023-11-25 00:03:58,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:58,587 INFO L276 IsEmpty]: Start isEmpty. Operand 3461 states and 11808 transitions. [2023-11-25 00:03:58,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-25 00:03:58,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:58,592 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] [2023-11-25 00:03:58,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-25 00:03:58,593 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:58,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:58,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1598890678, now seen corresponding path program 1 times [2023-11-25 00:03:58,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:58,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445660510] [2023-11-25 00:03:58,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:58,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:58,835 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-25 00:03:58,836 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:58,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445660510] [2023-11-25 00:03:58,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445660510] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:58,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:58,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:03:58,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92777597] [2023-11-25 00:03:58,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:58,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:03:58,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:58,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:03:58,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:03:58,839 INFO L87 Difference]: Start difference. First operand 3461 states and 11808 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:03:59,345 INFO L93 Difference]: Finished difference Result 4301 states and 14495 transitions. [2023-11-25 00:03:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-25 00:03:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-25 00:03:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:03:59,375 INFO L225 Difference]: With dead ends: 4301 [2023-11-25 00:03:59,375 INFO L226 Difference]: Without dead ends: 3741 [2023-11-25 00:03:59,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2023-11-25 00:03:59,377 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 153 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:03:59,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 161 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:03:59,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3741 states. [2023-11-25 00:03:59,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3741 to 3566. [2023-11-25 00:03:59,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 3565 states have (on average 3.40617110799439) internal successors, (12143), 3565 states have internal predecessors, (12143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:59,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 12143 transitions. [2023-11-25 00:03:59,511 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 12143 transitions. Word has length 20 [2023-11-25 00:03:59,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:03:59,512 INFO L495 AbstractCegarLoop]: Abstraction has 3566 states and 12143 transitions. [2023-11-25 00:03:59,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:03:59,513 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 12143 transitions. [2023-11-25 00:03:59,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-25 00:03:59,521 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:03:59,524 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] [2023-11-25 00:03:59,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-25 00:03:59,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:03:59,525 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:03:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1059630890, now seen corresponding path program 1 times [2023-11-25 00:03:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:03:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550905564] [2023-11-25 00:03:59,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:03:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:03:59,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:03:59,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-25 00:03:59,800 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:03:59,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550905564] [2023-11-25 00:03:59,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550905564] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:03:59,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:03:59,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:03:59,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258901371] [2023-11-25 00:03:59,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:03:59,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:03:59,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:03:59,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:03:59,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:03:59,803 INFO L87 Difference]: Start difference. First operand 3566 states and 12143 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:00,052 INFO L93 Difference]: Finished difference Result 3706 states and 12410 transitions. [2023-11-25 00:04:00,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-25 00:04:00,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-11-25 00:04:00,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:00,070 INFO L225 Difference]: With dead ends: 3706 [2023-11-25 00:04:00,070 INFO L226 Difference]: Without dead ends: 3216 [2023-11-25 00:04:00,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:04:00,071 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 72 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:00,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 133 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:00,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2023-11-25 00:04:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 3216. [2023-11-25 00:04:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3216 states, 3215 states have (on average 3.3788491446345255) internal successors, (10863), 3215 states have internal predecessors, (10863), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3216 states to 3216 states and 10863 transitions. [2023-11-25 00:04:00,190 INFO L78 Accepts]: Start accepts. Automaton has 3216 states and 10863 transitions. Word has length 20 [2023-11-25 00:04:00,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:00,192 INFO L495 AbstractCegarLoop]: Abstraction has 3216 states and 10863 transitions. [2023-11-25 00:04:00,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3216 states and 10863 transitions. [2023-11-25 00:04:00,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-25 00:04:00,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:00,198 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] [2023-11-25 00:04:00,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-25 00:04:00,199 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:00,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:00,199 INFO L85 PathProgramCache]: Analyzing trace with hash -330933319, now seen corresponding path program 1 times [2023-11-25 00:04:00,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:00,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874785956] [2023-11-25 00:04:00,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:00,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:00,535 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-25 00:04:00,535 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:00,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874785956] [2023-11-25 00:04:00,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874785956] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:00,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:00,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-25 00:04:00,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195687054] [2023-11-25 00:04:00,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:00,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-25 00:04:00,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:00,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-25 00:04:00,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-25 00:04:00,538 INFO L87 Difference]: Start difference. First operand 3216 states and 10863 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:00,842 INFO L93 Difference]: Finished difference Result 3923 states and 13072 transitions. [2023-11-25 00:04:00,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:04:00,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2023-11-25 00:04:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:00,854 INFO L225 Difference]: With dead ends: 3923 [2023-11-25 00:04:00,854 INFO L226 Difference]: Without dead ends: 1941 [2023-11-25 00:04:00,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-11-25 00:04:00,855 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 125 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:00,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 115 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1941 states. [2023-11-25 00:04:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1941 to 1941. [2023-11-25 00:04:00,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1940 states have (on average 3.277319587628866) internal successors, (6358), 1940 states have internal predecessors, (6358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 6358 transitions. [2023-11-25 00:04:00,933 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 6358 transitions. Word has length 21 [2023-11-25 00:04:00,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:00,933 INFO L495 AbstractCegarLoop]: Abstraction has 1941 states and 6358 transitions. [2023-11-25 00:04:00,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:00,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 6358 transitions. [2023-11-25 00:04:00,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-25 00:04:00,939 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:00,939 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-25 00:04:00,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-25 00:04:00,940 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:00,940 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:00,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1249711993, now seen corresponding path program 1 times [2023-11-25 00:04:00,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:00,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133272149] [2023-11-25 00:04:00,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:00,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:00,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:01,189 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-25 00:04:01,190 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:01,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133272149] [2023-11-25 00:04:01,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133272149] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:01,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:01,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:04:01,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160301117] [2023-11-25 00:04:01,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:04:01,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:04:01,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:04:01,193 INFO L87 Difference]: Start difference. First operand 1941 states and 6358 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-25 00:04:01,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:01,473 INFO L93 Difference]: Finished difference Result 2521 states and 8137 transitions. [2023-11-25 00:04:01,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:04:01,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-25 00:04:01,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:01,481 INFO L225 Difference]: With dead ends: 2521 [2023-11-25 00:04:01,482 INFO L226 Difference]: Without dead ends: 1191 [2023-11-25 00:04:01,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-25 00:04:01,483 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 99 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:01,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 102 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:01,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2023-11-25 00:04:01,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2023-11-25 00:04:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1190 states have (on average 3.1369747899159663) internal successors, (3733), 1190 states have internal predecessors, (3733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:01,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 3733 transitions. [2023-11-25 00:04:01,536 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 3733 transitions. Word has length 23 [2023-11-25 00:04:01,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:01,537 INFO L495 AbstractCegarLoop]: Abstraction has 1191 states and 3733 transitions. [2023-11-25 00:04:01,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 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-25 00:04:01,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 3733 transitions. [2023-11-25 00:04:01,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-25 00:04:01,541 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:01,542 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] [2023-11-25 00:04:01,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-25 00:04:01,542 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:01,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:01,543 INFO L85 PathProgramCache]: Analyzing trace with hash -1428835901, now seen corresponding path program 1 times [2023-11-25 00:04:01,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:01,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144624940] [2023-11-25 00:04:01,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:01,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:01,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:01,764 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-25 00:04:01,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:01,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144624940] [2023-11-25 00:04:01,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144624940] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:01,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:01,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-25 00:04:01,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355066492] [2023-11-25 00:04:01,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:01,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-25 00:04:01,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:01,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-25 00:04:01,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-25 00:04:01,768 INFO L87 Difference]: Start difference. First operand 1191 states and 3733 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:01,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:01,886 INFO L93 Difference]: Finished difference Result 1147 states and 3405 transitions. [2023-11-25 00:04:01,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-25 00:04:01,887 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2023-11-25 00:04:01,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:01,894 INFO L225 Difference]: With dead ends: 1147 [2023-11-25 00:04:01,894 INFO L226 Difference]: Without dead ends: 999 [2023-11-25 00:04:01,894 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-25 00:04:01,895 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:01,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 36 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:01,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-11-25 00:04:01,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2023-11-25 00:04:01,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 998 states have (on average 3.0250501002004007) internal successors, (3019), 998 states have internal predecessors, (3019), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 3019 transitions. [2023-11-25 00:04:01,939 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 3019 transitions. Word has length 26 [2023-11-25 00:04:01,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:01,939 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 3019 transitions. [2023-11-25 00:04:01,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 3019 transitions. [2023-11-25 00:04:01,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-25 00:04:01,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:01,945 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-25 00:04:01,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-25 00:04:01,945 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:01,946 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:01,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1391821660, now seen corresponding path program 1 times [2023-11-25 00:04:01,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:01,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022108157] [2023-11-25 00:04:01,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:01,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:02,224 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-25 00:04:02,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:02,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022108157] [2023-11-25 00:04:02,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022108157] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:02,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:02,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-25 00:04:02,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890656165] [2023-11-25 00:04:02,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:02,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-25 00:04:02,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:02,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-25 00:04:02,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-25 00:04:02,231 INFO L87 Difference]: Start difference. First operand 999 states and 3019 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-25 00:04:02,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:02,389 INFO L93 Difference]: Finished difference Result 763 states and 2135 transitions. [2023-11-25 00:04:02,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-25 00:04:02,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-25 00:04:02,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:02,394 INFO L225 Difference]: With dead ends: 763 [2023-11-25 00:04:02,394 INFO L226 Difference]: Without dead ends: 659 [2023-11-25 00:04:02,394 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-25 00:04:02,395 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 76 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:02,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 39 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:02,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2023-11-25 00:04:02,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2023-11-25 00:04:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 659 states, 658 states have (on average 2.8069908814589666) internal successors, (1847), 658 states have internal predecessors, (1847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:02,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 1847 transitions. [2023-11-25 00:04:02,424 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 1847 transitions. Word has length 28 [2023-11-25 00:04:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:02,426 INFO L495 AbstractCegarLoop]: Abstraction has 659 states and 1847 transitions. [2023-11-25 00:04:02,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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-25 00:04:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1847 transitions. [2023-11-25 00:04:02,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-25 00:04:02,431 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:02,431 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] [2023-11-25 00:04:02,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-25 00:04:02,432 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:02,432 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:02,433 INFO L85 PathProgramCache]: Analyzing trace with hash -205190043, now seen corresponding path program 1 times [2023-11-25 00:04:02,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:02,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872355867] [2023-11-25 00:04:02,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:02,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:02,787 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-25 00:04:02,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:02,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872355867] [2023-11-25 00:04:02,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872355867] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:02,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:02,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-25 00:04:02,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542597440] [2023-11-25 00:04:02,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:02,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-25 00:04:02,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-25 00:04:02,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-25 00:04:02,791 INFO L87 Difference]: Start difference. First operand 659 states and 1847 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:02,961 INFO L93 Difference]: Finished difference Result 455 states and 1223 transitions. [2023-11-25 00:04:02,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-25 00:04:02,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 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 30 [2023-11-25 00:04:02,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:02,965 INFO L225 Difference]: With dead ends: 455 [2023-11-25 00:04:02,965 INFO L226 Difference]: Without dead ends: 411 [2023-11-25 00:04:02,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:04:02,966 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 98 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:02,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 30 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:02,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-11-25 00:04:02,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-11-25 00:04:02,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 410 states have (on average 2.6902439024390246) internal successors, (1103), 410 states have internal predecessors, (1103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:02,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 1103 transitions. [2023-11-25 00:04:02,983 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 1103 transitions. Word has length 30 [2023-11-25 00:04:02,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:02,984 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 1103 transitions. [2023-11-25 00:04:02,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:02,984 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 1103 transitions. [2023-11-25 00:04:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-25 00:04:02,987 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:02,987 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-25 00:04:02,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-25 00:04:02,988 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:02,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:02,989 INFO L85 PathProgramCache]: Analyzing trace with hash -2004863827, now seen corresponding path program 1 times [2023-11-25 00:04:02,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438159691] [2023-11-25 00:04:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:02,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:04,649 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-25 00:04:04,650 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:04,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438159691] [2023-11-25 00:04:04,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438159691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:04,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:04,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-25 00:04:04,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437887903] [2023-11-25 00:04:04,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:04,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:04:04,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:04,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:04:04,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:04:04,654 INFO L87 Difference]: Start difference. First operand 411 states and 1103 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:04,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:04,996 INFO L93 Difference]: Finished difference Result 601 states and 1612 transitions. [2023-11-25 00:04:04,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-25 00:04:04,997 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:04,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:04,999 INFO L225 Difference]: With dead ends: 601 [2023-11-25 00:04:04,999 INFO L226 Difference]: Without dead ends: 339 [2023-11-25 00:04:04,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2023-11-25 00:04:05,000 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 53 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:05,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 190 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:04:05,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-25 00:04:05,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-11-25 00:04:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 338 states have (on average 2.6242603550295858) internal successors, (887), 338 states have internal predecessors, (887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 887 transitions. [2023-11-25 00:04:05,014 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 887 transitions. Word has length 33 [2023-11-25 00:04:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:05,014 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 887 transitions. [2023-11-25 00:04:05,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 887 transitions. [2023-11-25 00:04:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-25 00:04:05,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:05,017 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-25 00:04:05,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-25 00:04:05,017 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:05,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:05,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1843594511, now seen corresponding path program 2 times [2023-11-25 00:04:05,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:05,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246905440] [2023-11-25 00:04:05,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:05,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:06,255 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-25 00:04:06,255 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-25 00:04:06,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246905440] [2023-11-25 00:04:06,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246905440] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:06,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:06,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-25 00:04:06,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134884519] [2023-11-25 00:04:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:06,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-25 00:04:06,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-25 00:04:06,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-25 00:04:06,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-25 00:04:06,260 INFO L87 Difference]: Start difference. First operand 339 states and 887 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:06,644 INFO L93 Difference]: Finished difference Result 539 states and 1407 transitions. [2023-11-25 00:04:06,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-25 00:04:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:06,647 INFO L225 Difference]: With dead ends: 539 [2023-11-25 00:04:06,647 INFO L226 Difference]: Without dead ends: 373 [2023-11-25 00:04:06,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-25 00:04:06,648 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 59 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:06,648 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 184 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-25 00:04:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-25 00:04:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 285. [2023-11-25 00:04:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 284 states have (on average 2.5211267605633805) internal successors, (716), 284 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:06,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 716 transitions. [2023-11-25 00:04:06,667 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 716 transitions. Word has length 33 [2023-11-25 00:04:06,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:06,667 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 716 transitions. [2023-11-25 00:04:06,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 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-25 00:04:06,670 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 716 transitions. [2023-11-25 00:04:06,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-25 00:04:06,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:06,672 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-25 00:04:06,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-25 00:04:06,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:06,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:06,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1013850669, now seen corresponding path program 3 times [2023-11-25 00:04:06,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-25 00:04:06,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763281945] [2023-11-25 00:04:06,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:06,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-25 00:04:06,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:04:06,772 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-25 00:04:06,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-25 00:04:06,905 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-25 00:04:06,905 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-25 00:04:06,907 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-25 00:04:06,909 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-25 00:04:06,910 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-25 00:04:06,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-25 00:04:06,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-25 00:04:06,911 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-25 00:04:06,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-25 00:04:06,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-25 00:04:06,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-25 00:04:06,912 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-25 00:04:06,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-25 00:04:06,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-25 00:04:06,913 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-25 00:04:06,914 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-25 00:04:06,919 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:06,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-25 00:04:06,929 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-25 00:04:07,011 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-25 00:04:07,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-25 00:04:07,017 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-25 00:04:07,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-25 00:04:07,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-25 00:04:07,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 12:04:07 BasicIcfg [2023-11-25 00:04:07,058 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-25 00:04:07,059 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-25 00:04:07,059 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-25 00:04:07,060 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-25 00:04:07,060 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:03:48" (3/4) ... [2023-11-25 00:04:07,063 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-25 00:04:07,064 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-25 00:04:07,065 INFO L158 Benchmark]: Toolchain (without parser) took 20789.62ms. Allocated memory was 213.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 183.9MB in the beginning and 525.9MB in the end (delta: -342.0MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-25 00:04:07,066 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 125.8MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:04:07,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 682.08ms. Allocated memory is still 213.9MB. Free memory was 183.9MB in the beginning and 160.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-25 00:04:07,067 INFO L158 Benchmark]: Boogie Procedure Inliner took 107.67ms. Allocated memory is still 213.9MB. Free memory was 160.4MB in the beginning and 158.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:04:07,068 INFO L158 Benchmark]: Boogie Preprocessor took 91.45ms. Allocated memory is still 213.9MB. Free memory was 158.2MB in the beginning and 156.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-25 00:04:07,068 INFO L158 Benchmark]: RCFGBuilder took 1229.06ms. Allocated memory is still 213.9MB. Free memory was 155.8MB in the beginning and 176.8MB in the end (delta: -21.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2023-11-25 00:04:07,070 INFO L158 Benchmark]: TraceAbstraction took 18664.98ms. Allocated memory was 213.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 175.7MB in the beginning and 527.0MB in the end (delta: -351.2MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2023-11-25 00:04:07,071 INFO L158 Benchmark]: Witness Printer took 5.12ms. Allocated memory is still 1.7GB. Free memory was 527.0MB in the beginning and 525.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-25 00:04:07,076 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 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 682.08ms. Allocated memory is still 213.9MB. Free memory was 183.9MB in the beginning and 160.4MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 107.67ms. Allocated memory is still 213.9MB. Free memory was 160.4MB in the beginning and 158.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 91.45ms. Allocated memory is still 213.9MB. Free memory was 158.2MB in the beginning and 156.2MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1229.06ms. Allocated memory is still 213.9MB. Free memory was 155.8MB in the beginning and 176.8MB in the end (delta: -21.0MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * TraceAbstraction took 18664.98ms. Allocated memory was 213.9MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 175.7MB in the beginning and 527.0MB in the end (delta: -351.2MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 5.12ms. Allocated memory is still 1.7GB. Free memory was 527.0MB in the beginning and 525.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L721] 0 _Bool x$flush_delayed; [L722] 0 int x$mem_tmp; [L723] 0 _Bool x$r_buff0_thd0; [L724] 0 _Bool x$r_buff0_thd1; [L725] 0 _Bool x$r_buff0_thd2; [L726] 0 _Bool x$r_buff0_thd3; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$r_buff1_thd3; [L731] 0 _Bool x$read_delayed; [L732] 0 int *x$read_delayed_var; [L733] 0 int x$w_buff0; [L734] 0 _Bool x$w_buff0_used; [L735] 0 int x$w_buff1; [L736] 0 _Bool x$w_buff1_used; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool weak$$choice0; [L742] 0 _Bool weak$$choice2; [L831] 0 pthread_t t2055; [L832] FCALL, FORK 0 pthread_create(&t2055, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2056; [L834] FCALL, FORK 0 pthread_create(&t2056, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L786] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L835] 0 pthread_t t2057; [L836] FCALL, FORK 0 pthread_create(&t2057, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L806] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L809] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L810] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L811] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L812] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L813] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L746] 1 __unbuffered_p0_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L816] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L789] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L790] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L791] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L792] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L793] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L796] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L838] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L840] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L840] RET 0 assume_abort_if_not(main$tmp_guard0) [L842] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L843] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L844] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L845] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L846] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L849] 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=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2055={5:0}, t2056={6:0}, t2057={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L18] 0 __assert_fail ("0", "safe012_pso.oepc_pso.opt_rmo.opt.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: 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: 829]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 832]: 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: 834]: 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: 836]: 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, 77 locations, 13 error locations. Started 1 CEGAR loops. OverallTime: 18.4s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1308 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1308 mSDsluCounter, 1831 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1311 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2233 IncrementalHoareTripleChecker+Invalid, 2270 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 520 mSDtfsCounter, 2233 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6121occurred in iteration=8, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 5348 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 361 NumberOfCodeBlocks, 361 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 309 ConstructedInterpolants, 0 QuantifiedInterpolants, 2565 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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-25 00:04:07,122 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91 --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 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-25 00:04:10,419 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-25 00:04:10,545 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-25 00:04:10,552 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-25 00:04:10,553 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-25 00:04:10,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-25 00:04:10,587 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-25 00:04:10,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-25 00:04:10,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-25 00:04:10,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-25 00:04:10,590 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-25 00:04:10,591 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-25 00:04:10,592 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-25 00:04:10,592 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-25 00:04:10,593 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-25 00:04:10,593 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-25 00:04:10,594 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-25 00:04:10,595 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-25 00:04:10,596 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-25 00:04:10,596 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-25 00:04:10,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-25 00:04:10,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-25 00:04:10,598 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-25 00:04:10,598 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-25 00:04:10,599 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-25 00:04:10,599 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-25 00:04:10,600 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-25 00:04:10,600 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-25 00:04:10,601 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-25 00:04:10,601 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-25 00:04:10,602 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-25 00:04:10,602 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-25 00:04:10,603 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-25 00:04:10,603 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-25 00:04:10,604 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-25 00:04:10,604 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-25 00:04:10,605 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-25 00:04:10,605 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:10,606 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-25 00:04:10,606 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-25 00:04:10,607 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-25 00:04:10,608 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-25 00:04:10,608 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-25 00:04:10,609 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-25 00:04:10,609 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-25 00:04:10,609 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_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/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_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91 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 -> 40c07d8b0b9ace0eb5e8218a2dd6fad770e2c982688ab22c161b74af49a1b102 [2023-11-25 00:04:11,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-25 00:04:11,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-25 00:04:11,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-25 00:04:11,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-25 00:04:11,063 INFO L274 PluginConnector]: CDTParser initialized [2023-11-25 00:04:11,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/../../sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:04:14,939 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-25 00:04:15,333 INFO L384 CDTParser]: Found 1 translation units. [2023-11-25 00:04:15,333 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/sv-benchmarks/c/pthread-wmm/safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:04:15,368 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/bae0f2808/217b5f396c66422c94fe82cab1b3fc2c/FLAG317507925 [2023-11-25 00:04:15,391 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/data/bae0f2808/217b5f396c66422c94fe82cab1b3fc2c [2023-11-25 00:04:15,399 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-25 00:04:15,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-25 00:04:15,406 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:15,406 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-25 00:04:15,412 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-25 00:04:15,413 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:15" (1/1) ... [2023-11-25 00:04:15,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31e015d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:15, skipping insertion in model container [2023-11-25 00:04:15,416 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 12:04:15" (1/1) ... [2023-11-25 00:04:15,499 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-25 00:04:16,113 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:16,135 INFO L202 MainTranslator]: Completed pre-run [2023-11-25 00:04:16,239 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-25 00:04:16,302 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:04:16,302 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-25 00:04:16,313 INFO L206 MainTranslator]: Completed translation [2023-11-25 00:04:16,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16 WrapperNode [2023-11-25 00:04:16,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-25 00:04:16,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:16,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-25 00:04:16,317 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-25 00:04:16,327 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,375 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,408 INFO L138 Inliner]: procedures = 179, calls = 55, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 135 [2023-11-25 00:04:16,409 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-25 00:04:16,410 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-25 00:04:16,410 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-25 00:04:16,410 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-25 00:04:16,423 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,423 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,430 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,430 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,447 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,449 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,454 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-25 00:04:16,465 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-25 00:04:16,466 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-25 00:04:16,466 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-25 00:04:16,467 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (1/1) ... [2023-11-25 00:04:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-25 00:04:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 [2023-11-25 00:04:16,517 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-25 00:04:16,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-25 00:04:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-25 00:04:16,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-25 00:04:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-25 00:04:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-25 00:04:16,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-25 00:04:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-25 00:04:16,575 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-25 00:04:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-25 00:04:16,576 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-25 00:04:16,576 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-25 00:04:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-25 00:04:16,577 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-25 00:04:16,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-25 00:04:16,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-25 00:04:16,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-25 00:04:16,580 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-25 00:04:16,801 INFO L241 CfgBuilder]: Building ICFG [2023-11-25 00:04:16,804 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-25 00:04:17,316 INFO L282 CfgBuilder]: Performing block encoding [2023-11-25 00:04:17,688 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-25 00:04:17,689 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-25 00:04:17,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:17 BoogieIcfgContainer [2023-11-25 00:04:17,690 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-25 00:04:17,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-25 00:04:17,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-25 00:04:17,698 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-25 00:04:17,699 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 12:04:15" (1/3) ... [2023-11-25 00:04:17,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60220e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:17, skipping insertion in model container [2023-11-25 00:04:17,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 12:04:16" (2/3) ... [2023-11-25 00:04:17,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60220e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 12:04:17, skipping insertion in model container [2023-11-25 00:04:17,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 12:04:17" (3/3) ... [2023-11-25 00:04:17,705 INFO L112 eAbstractionObserver]: Analyzing ICFG safe012_pso.oepc_pso.opt_rmo.opt.i [2023-11-25 00:04:17,729 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-25 00:04:17,730 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-25 00:04:17,730 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-25 00:04:17,839 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-25 00:04:17,883 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 61 places, 53 transitions, 118 flow [2023-11-25 00:04:18,328 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:18,362 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-25 00:04:18,373 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;@6e8a1b80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-25 00:04:18,374 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-25 00:04:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:18,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-25 00:04:18,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:18,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-25 00:04:18,413 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:18,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:18,420 INFO L85 PathProgramCache]: Analyzing trace with hash 12307, now seen corresponding path program 1 times [2023-11-25 00:04:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:18,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470032513] [2023-11-25 00:04:18,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:18,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:18,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:18,442 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:18,485 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-25 00:04:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:18,609 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:04:18,646 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:18,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-25 00:04:18,786 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-25 00:04:18,799 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:18,800 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:18,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470032513] [2023-11-25 00:04:18,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470032513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:18,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:18,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:04:18,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431211336] [2023-11-25 00:04:18,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:18,811 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:18,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:18,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:18,901 INFO L87 Difference]: Start difference. First operand has 5955 states, 5942 states have (on average 3.605183439919219) internal successors, (21422), 5954 states have internal predecessors, (21422), 0 states have call successors, (0), 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-25 00:04:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:19,288 INFO L93 Difference]: Finished difference Result 5562 states and 19230 transitions. [2023-11-25 00:04:19,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:19,292 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-25 00:04:19,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:19,402 INFO L225 Difference]: With dead ends: 5562 [2023-11-25 00:04:19,403 INFO L226 Difference]: Without dead ends: 5562 [2023-11-25 00:04:19,405 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-25 00:04:19,410 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:19,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 30 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-25 00:04:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2023-11-25 00:04:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 5562. [2023-11-25 00:04:19,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5562 states, 5550 states have (on average 3.464864864864865) internal successors, (19230), 5561 states have internal predecessors, (19230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:20,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5562 states to 5562 states and 19230 transitions. [2023-11-25 00:04:20,172 INFO L78 Accepts]: Start accepts. Automaton has 5562 states and 19230 transitions. Word has length 2 [2023-11-25 00:04:20,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:20,173 INFO L495 AbstractCegarLoop]: Abstraction has 5562 states and 19230 transitions. [2023-11-25 00:04:20,173 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-25 00:04:20,175 INFO L276 IsEmpty]: Start isEmpty. Operand 5562 states and 19230 transitions. [2023-11-25 00:04:20,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-25 00:04:20,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:20,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-25 00:04:20,184 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-25 00:04:20,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:20,380 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:20,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:20,381 INFO L85 PathProgramCache]: Analyzing trace with hash 12308, now seen corresponding path program 1 times [2023-11-25 00:04:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934949805] [2023-11-25 00:04:20,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:20,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:20,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:20,388 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-25 00:04:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:20,497 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-25 00:04:20,499 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:20,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:20,541 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-25 00:04:20,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:20,542 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:20,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934949805] [2023-11-25 00:04:20,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1934949805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:20,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:20,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:04:20,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585029581] [2023-11-25 00:04:20,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:20,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:20,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:20,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:20,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:20,555 INFO L87 Difference]: Start difference. First operand 5562 states and 19230 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-25 00:04:20,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:20,830 INFO L93 Difference]: Finished difference Result 5561 states and 19229 transitions. [2023-11-25 00:04:20,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:20,831 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-25 00:04:20,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:20,904 INFO L225 Difference]: With dead ends: 5561 [2023-11-25 00:04:20,904 INFO L226 Difference]: Without dead ends: 5561 [2023-11-25 00:04:20,905 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-25 00:04:20,907 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:20,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:20,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5561 states. [2023-11-25 00:04:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5561 to 5561. [2023-11-25 00:04:21,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5561 states, 5550 states have (on average 3.4646846846846846) internal successors, (19229), 5560 states have internal predecessors, (19229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:21,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 19229 transitions. [2023-11-25 00:04:21,503 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 19229 transitions. Word has length 2 [2023-11-25 00:04:21,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:21,504 INFO L495 AbstractCegarLoop]: Abstraction has 5561 states and 19229 transitions. [2023-11-25 00:04:21,505 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-25 00:04:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 19229 transitions. [2023-11-25 00:04:21,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:04:21,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:21,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:04:21,536 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-25 00:04:21,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:21,727 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:21,728 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:21,728 INFO L85 PathProgramCache]: Analyzing trace with hash 367006866, now seen corresponding path program 1 times [2023-11-25 00:04:21,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:21,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [47948892] [2023-11-25 00:04:21,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:21,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:21,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:21,731 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:21,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-25 00:04:21,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:21,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:04:21,851 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:21,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-25 00:04:21,874 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-25 00:04:21,875 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:21,875 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:21,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [47948892] [2023-11-25 00:04:21,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [47948892] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:21,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:21,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:21,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518790217] [2023-11-25 00:04:21,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:21,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:21,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:21,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:21,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:21,884 INFO L87 Difference]: Start difference. First operand 5561 states and 19229 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-25 00:04:22,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:22,097 INFO L93 Difference]: Finished difference Result 5554 states and 19216 transitions. [2023-11-25 00:04:22,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:22,098 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-25 00:04:22,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:22,181 INFO L225 Difference]: With dead ends: 5554 [2023-11-25 00:04:22,181 INFO L226 Difference]: Without dead ends: 5554 [2023-11-25 00:04:22,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 00:04:22,186 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:22,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5554 states. [2023-11-25 00:04:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5554 to 5554. [2023-11-25 00:04:22,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5554 states, 5544 states have (on average 3.466089466089466) internal successors, (19216), 5553 states have internal predecessors, (19216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5554 states to 5554 states and 19216 transitions. [2023-11-25 00:04:22,646 INFO L78 Accepts]: Start accepts. Automaton has 5554 states and 19216 transitions. Word has length 5 [2023-11-25 00:04:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:22,647 INFO L495 AbstractCegarLoop]: Abstraction has 5554 states and 19216 transitions. [2023-11-25 00:04:22,647 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-25 00:04:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 5554 states and 19216 transitions. [2023-11-25 00:04:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-25 00:04:22,648 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:22,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-25 00:04:22,661 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:22,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:22,851 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:22,851 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:22,851 INFO L85 PathProgramCache]: Analyzing trace with hash 367006867, now seen corresponding path program 1 times [2023-11-25 00:04:22,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:22,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [733409443] [2023-11-25 00:04:22,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:22,854 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:22,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-25 00:04:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:22,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-25 00:04:22,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:22,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:22,977 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-25 00:04:22,977 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:22,978 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:22,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [733409443] [2023-11-25 00:04:22,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [733409443] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:22,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:22,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:22,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127793513] [2023-11-25 00:04:22,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:22,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:22,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:22,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:22,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:22,981 INFO L87 Difference]: Start difference. First operand 5554 states and 19216 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-25 00:04:23,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:23,269 INFO L93 Difference]: Finished difference Result 5547 states and 19203 transitions. [2023-11-25 00:04:23,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:23,274 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-25 00:04:23,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:23,339 INFO L225 Difference]: With dead ends: 5547 [2023-11-25 00:04:23,339 INFO L226 Difference]: Without dead ends: 5547 [2023-11-25 00:04:23,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 00:04:23,344 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:23,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 35 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:23,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5547 states. [2023-11-25 00:04:23,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5547 to 5547. [2023-11-25 00:04:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5547 states, 5538 states have (on average 3.4674972914409534) internal successors, (19203), 5546 states have internal predecessors, (19203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:23,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5547 states to 5547 states and 19203 transitions. [2023-11-25 00:04:23,922 INFO L78 Accepts]: Start accepts. Automaton has 5547 states and 19203 transitions. Word has length 5 [2023-11-25 00:04:23,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:23,923 INFO L495 AbstractCegarLoop]: Abstraction has 5547 states and 19203 transitions. [2023-11-25 00:04:23,923 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-25 00:04:23,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5547 states and 19203 transitions. [2023-11-25 00:04:23,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:04:23,924 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:23,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:23,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:24,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:24,127 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:24,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:24,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1484822655, now seen corresponding path program 1 times [2023-11-25 00:04:24,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:24,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [244017811] [2023-11-25 00:04:24,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:24,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:24,129 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:24,130 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:24,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-25 00:04:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:24,238 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-25 00:04:24,240 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:24,261 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-25 00:04:24,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:24,262 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:24,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [244017811] [2023-11-25 00:04:24,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [244017811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:24,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:24,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-25 00:04:24,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889803356] [2023-11-25 00:04:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:24,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:24,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:24,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:24,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:24,271 INFO L87 Difference]: Start difference. First operand 5547 states and 19203 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:04:24,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:24,444 INFO L93 Difference]: Finished difference Result 4826 states and 16604 transitions. [2023-11-25 00:04:24,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:24,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:04:24,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:24,490 INFO L225 Difference]: With dead ends: 4826 [2023-11-25 00:04:24,490 INFO L226 Difference]: Without dead ends: 4728 [2023-11-25 00:04:24,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 00:04:24,492 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 27 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:24,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 41 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:24,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4728 states. [2023-11-25 00:04:24,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4728 to 4728. [2023-11-25 00:04:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4728 states, 4724 states have (on average 3.4481371718882303) internal successors, (16289), 4727 states have internal predecessors, (16289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:24,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4728 states to 4728 states and 16289 transitions. [2023-11-25 00:04:24,904 INFO L78 Accepts]: Start accepts. Automaton has 4728 states and 16289 transitions. Word has length 8 [2023-11-25 00:04:24,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:24,905 INFO L495 AbstractCegarLoop]: Abstraction has 4728 states and 16289 transitions. [2023-11-25 00:04:24,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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-25 00:04:24,905 INFO L276 IsEmpty]: Start isEmpty. Operand 4728 states and 16289 transitions. [2023-11-25 00:04:24,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:04:24,907 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:24,907 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:24,912 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:25,111 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:25,112 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:25,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:25,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1484824412, now seen corresponding path program 1 times [2023-11-25 00:04:25,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:25,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1444353306] [2023-11-25 00:04:25,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:25,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:25,115 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:25,116 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:25,161 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-25 00:04:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:25,240 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-25 00:04:25,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:25,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-25 00:04:25,256 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-25 00:04:25,256 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:25,256 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:25,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1444353306] [2023-11-25 00:04:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1444353306] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609289760] [2023-11-25 00:04:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:25,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:25,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:25,259 INFO L87 Difference]: Start difference. First operand 4728 states and 16289 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-25 00:04:25,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:25,455 INFO L93 Difference]: Finished difference Result 4679 states and 16156 transitions. [2023-11-25 00:04:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:25,456 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-25 00:04:25,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:25,512 INFO L225 Difference]: With dead ends: 4679 [2023-11-25 00:04:25,512 INFO L226 Difference]: Without dead ends: 4679 [2023-11-25 00:04:25,512 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 00:04:25,514 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:25,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 37 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:25,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4679 states. [2023-11-25 00:04:25,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4679 to 4679. [2023-11-25 00:04:25,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4679 states, 4676 states have (on average 3.4550898203592815) internal successors, (16156), 4678 states have internal predecessors, (16156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:25,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4679 states to 4679 states and 16156 transitions. [2023-11-25 00:04:25,831 INFO L78 Accepts]: Start accepts. Automaton has 4679 states and 16156 transitions. Word has length 8 [2023-11-25 00:04:25,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:25,832 INFO L495 AbstractCegarLoop]: Abstraction has 4679 states and 16156 transitions. [2023-11-25 00:04:25,832 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-25 00:04:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 4679 states and 16156 transitions. [2023-11-25 00:04:25,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-25 00:04:25,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:25,834 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-25 00:04:25,844 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2023-11-25 00:04:26,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:26,037 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:26,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1484824411, now seen corresponding path program 1 times [2023-11-25 00:04:26,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:26,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218345845] [2023-11-25 00:04:26,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:26,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:26,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:26,041 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:26,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-25 00:04:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-25 00:04:26,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-25 00:04:26,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-25 00:04:26,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-25 00:04:26,199 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-25 00:04:26,200 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-25 00:04:26,200 INFO L136 FreeRefinementEngine]: Strategy WALRUS found an infeasible trace [2023-11-25 00:04:26,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218345845] [2023-11-25 00:04:26,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218345845] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-25 00:04:26,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-25 00:04:26,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-25 00:04:26,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299589874] [2023-11-25 00:04:26,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-25 00:04:26,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-25 00:04:26,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2023-11-25 00:04:26,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-25 00:04:26,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-25 00:04:26,203 INFO L87 Difference]: Start difference. First operand 4679 states and 16156 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-25 00:04:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-25 00:04:26,364 INFO L93 Difference]: Finished difference Result 4630 states and 16023 transitions. [2023-11-25 00:04:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-25 00:04:26,365 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-25 00:04:26,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-25 00:04:26,395 INFO L225 Difference]: With dead ends: 4630 [2023-11-25 00:04:26,395 INFO L226 Difference]: Without dead ends: 4630 [2023-11-25 00:04:26,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 00:04:26,397 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-25 00:04:26,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 38 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-25 00:04:26,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4630 states. [2023-11-25 00:04:26,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4630 to 4630. [2023-11-25 00:04:26,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4630 states, 4628 states have (on average 3.4621866897147795) internal successors, (16023), 4629 states have internal predecessors, (16023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-25 00:04:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4630 states to 4630 states and 16023 transitions. [2023-11-25 00:04:26,684 INFO L78 Accepts]: Start accepts. Automaton has 4630 states and 16023 transitions. Word has length 8 [2023-11-25 00:04:26,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-25 00:04:26,684 INFO L495 AbstractCegarLoop]: Abstraction has 4630 states and 16023 transitions. [2023-11-25 00:04:26,684 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-25 00:04:26,685 INFO L276 IsEmpty]: Start isEmpty. Operand 4630 states and 16023 transitions. [2023-11-25 00:04:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-25 00:04:26,694 INFO L187 NwaCegarLoop]: Found error trace [2023-11-25 00:04:26,694 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-25 00:04:26,704 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-25 00:04:26,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:26,898 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-25 00:04:26,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-25 00:04:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash -264052555, now seen corresponding path program 1 times [2023-11-25 00:04:26,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WALRUS [2023-11-25 00:04:26,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [615071383] [2023-11-25 00:04:26,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-25 00:04:26,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-25 00:04:26,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat [2023-11-25 00:04:26,902 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-25 00:04:26,904 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_31b7ff91-b2f0-4441-bae4-e2fb5162f271/bin/utaipan-verify-SwPr7d2a91/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-25 00:04:27,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat