./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX --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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:02:32,228 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:02:32,349 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-11-12 01:02:32,363 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:02:32,364 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:02:32,415 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:02:32,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:02:32,417 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:02:32,418 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:02:32,423 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:02:32,424 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:02:32,425 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:02:32,426 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:02:32,427 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-11-12 01:02:32,428 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:02:32,428 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:02:32,429 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-11-12 01:02:32,429 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-11-12 01:02:32,430 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:02:32,430 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-11-12 01:02:32,431 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-11-12 01:02:32,431 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-11-12 01:02:32,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 01:02:32,433 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 01:02:32,434 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:02:32,434 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:02:32,435 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:02:32,435 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:02:32,436 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:02:32,436 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 01:02:32,437 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 01:02:32,438 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 01:02:32,438 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:02:32,438 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:02:32,439 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 01:02:32,439 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:02:32,439 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:02:32,439 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:02:32,440 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:02:32,440 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:32,440 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:02:32,441 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:02:32,441 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-11-12 01:02:32,441 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 01:02:32,442 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:02:32,442 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:02:32,442 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_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/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_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2023-11-12 01:02:32,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:02:32,818 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:02:32,821 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:02:32,823 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:02:32,824 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:02:32,826 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-12 01:02:35,921 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:02:36,253 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:02:36,256 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-12 01:02:36,286 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/23abc5d6d/8e2e5f750702432ab643d28721c86481/FLAG6f216947b [2023-11-12 01:02:36,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/23abc5d6d/8e2e5f750702432ab643d28721c86481 [2023-11-12 01:02:36,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:02:36,319 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:02:36,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:36,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:02:36,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:02:36,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:36" (1/1) ... [2023-11-12 01:02:36,330 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68dc14bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:36, skipping insertion in model container [2023-11-12 01:02:36,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:02:36" (1/1) ... [2023-11-12 01:02:36,384 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:02:36,857 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:36,870 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:02:36,994 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:02:37,046 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:37,046 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:02:37,055 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:02:37,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37 WrapperNode [2023-11-12 01:02:37,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:02:37,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:37,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:02:37,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:02:37,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,105 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,161 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 166 [2023-11-12 01:02:37,162 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:02:37,163 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:02:37,163 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:02:37,164 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:02:37,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,205 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,224 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,237 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,241 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:02:37,242 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:02:37,242 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:02:37,243 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:02:37,248 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (1/1) ... [2023-11-12 01:02:37,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:02:37,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:02:37,288 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:02:37,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:02:37,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 01:02:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 01:02:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:02:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:02:37,333 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:02:37,334 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 01:02:37,335 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 01:02:37,336 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 01:02:37,336 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 01:02:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 01:02:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 01:02:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 01:02:37,337 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 01:02:37,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 01:02:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 01:02:37,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:02:37,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:02:37,341 WARN L210 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 01:02:37,536 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:02:37,539 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 01:02:37,983 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 01:02:38,270 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 01:02:38,274 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 01:02:38,278 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:38 BoogieIcfgContainer [2023-11-12 01:02:38,278 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 01:02:38,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 01:02:38,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 01:02:38,287 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 01:02:38,287 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 01:02:36" (1/3) ... [2023-11-12 01:02:38,288 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d943d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:38, skipping insertion in model container [2023-11-12 01:02:38,289 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:02:37" (2/3) ... [2023-11-12 01:02:38,291 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15d943d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 01:02:38, skipping insertion in model container [2023-11-12 01:02:38,291 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:38" (3/3) ... [2023-11-12 01:02:38,293 INFO L112 eAbstractionObserver]: Analyzing ICFG mix027_tso.i [2023-11-12 01:02:38,315 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 01:02:38,315 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 01:02:38,316 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 01:02:38,457 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 01:02:38,499 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2023-11-12 01:02:38,514 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-12 01:02:38,518 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 160 places, 150 transitions, 316 flow [2023-11-12 01:02:38,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 160 places, 150 transitions, 316 flow [2023-11-12 01:02:38,594 INFO L124 PetriNetUnfolderBase]: 3/146 cut-off events. [2023-11-12 01:02:38,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 01:02:38,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 146 events. 3/146 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 117 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 106. Up to 2 conditions per place. [2023-11-12 01:02:38,609 INFO L119 LiptonReduction]: Number of co-enabled transitions 4046 [2023-11-12 01:02:45,327 INFO L134 LiptonReduction]: Checked pairs total: 11411 [2023-11-12 01:02:45,327 INFO L136 LiptonReduction]: Total number of compositions: 150 [2023-11-12 01:02:45,339 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 57 places, 45 transitions, 106 flow [2023-11-12 01:02:45,752 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:45,779 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 01:02:45,787 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;@417dc1af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-12 01:02:45,788 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-12 01:02:45,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2023-11-12 01:02:45,847 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:45,848 INFO L195 NwaCegarLoop]: trace histogram [1] [2023-11-12 01:02:45,849 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:45,858 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:45,859 INFO L85 PathProgramCache]: Analyzing trace with hash 656, now seen corresponding path program 1 times [2023-11-12 01:02:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751380932] [2023-11-12 01:02:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:45,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:46,012 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-12 01:02:46,015 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:46,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751380932] [2023-11-12 01:02:46,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751380932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:46,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:46,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 01:02:46,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499074354] [2023-11-12 01:02:46,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:46,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 01:02:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 01:02:46,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:46,076 INFO L87 Difference]: Start difference. First operand has 6444 states, 6427 states have (on average 4.144390851096935) internal successors, (26636), 6443 states have internal predecessors, (26636), 0 states have call successors, (0), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:46,283 INFO L93 Difference]: Finished difference Result 6072 states and 24528 transitions. [2023-11-12 01:02:46,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 01:02:46,286 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 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 1 [2023-11-12 01:02:46,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:46,391 INFO L225 Difference]: With dead ends: 6072 [2023-11-12 01:02:46,392 INFO L226 Difference]: Without dead ends: 6072 [2023-11-12 01:02:46,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 01:02:46,398 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:46,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:46,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2023-11-12 01:02:46,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 6072. [2023-11-12 01:02:46,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6072 states, 6067 states have (on average 4.042854788198451) internal successors, (24528), 6071 states have internal predecessors, (24528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6072 states to 6072 states and 24528 transitions. [2023-11-12 01:02:46,900 INFO L78 Accepts]: Start accepts. Automaton has 6072 states and 24528 transitions. Word has length 1 [2023-11-12 01:02:46,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:46,901 INFO L495 AbstractCegarLoop]: Abstraction has 6072 states and 24528 transitions. [2023-11-12 01:02:46,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:46,901 INFO L276 IsEmpty]: Start isEmpty. Operand 6072 states and 24528 transitions. [2023-11-12 01:02:46,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-11-12 01:02:46,902 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:46,902 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-11-12 01:02:46,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 01:02:46,903 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:46,903 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:46,904 INFO L85 PathProgramCache]: Analyzing trace with hash 622496245, now seen corresponding path program 1 times [2023-11-12 01:02:46,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:46,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188884898] [2023-11-12 01:02:46,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:46,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:46,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:47,435 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-12 01:02:47,436 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:47,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188884898] [2023-11-12 01:02:47,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188884898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:47,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:47,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 01:02:47,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611972167] [2023-11-12 01:02:47,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:47,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 01:02:47,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:47,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 01:02:47,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 01:02:47,440 INFO L87 Difference]: Start difference. First operand 6072 states and 24528 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12 01:02:47,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:47,641 INFO L93 Difference]: Finished difference Result 4962 states and 19815 transitions. [2023-11-12 01:02:47,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 01:02:47,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12 01:02:47,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:47,764 INFO L225 Difference]: With dead ends: 4962 [2023-11-12 01:02:47,764 INFO L226 Difference]: Without dead ends: 4812 [2023-11-12 01:02:47,765 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-12 01:02:47,767 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:47,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:02:47,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4812 states. [2023-11-12 01:02:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4812 to 4812. [2023-11-12 01:02:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4812 states, 4810 states have (on average 4.012474012474012) internal successors, (19300), 4811 states have internal predecessors, (19300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:48,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4812 states to 4812 states and 19300 transitions. [2023-11-12 01:02:48,064 INFO L78 Accepts]: Start accepts. Automaton has 4812 states and 19300 transitions. Word has length 5 [2023-11-12 01:02:48,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:48,066 INFO L495 AbstractCegarLoop]: Abstraction has 4812 states and 19300 transitions. [2023-11-12 01:02:48,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 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-12 01:02:48,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4812 states and 19300 transitions. [2023-11-12 01:02:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:02:48,079 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:48,079 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:48,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 01:02:48,080 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:48,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:48,084 INFO L85 PathProgramCache]: Analyzing trace with hash 32615745, now seen corresponding path program 1 times [2023-11-12 01:02:48,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820196367] [2023-11-12 01:02:48,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:48,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:49,190 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-12 01:02:49,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:49,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820196367] [2023-11-12 01:02:49,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820196367] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:49,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:49,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:49,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433304700] [2023-11-12 01:02:49,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:49,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:02:49,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:49,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:02:49,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:49,202 INFO L87 Difference]: Start difference. First operand 4812 states and 19300 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:49,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:49,517 INFO L93 Difference]: Finished difference Result 4062 states and 16125 transitions. [2023-11-12 01:02:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:02:49,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 01:02:49,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:49,634 INFO L225 Difference]: With dead ends: 4062 [2023-11-12 01:02:49,634 INFO L226 Difference]: Without dead ends: 4062 [2023-11-12 01:02:49,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:49,636 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:49,636 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 44 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2023-11-12 01:02:49,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2023-11-12 01:02:49,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:49,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2023-11-12 01:02:49,810 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 12 [2023-11-12 01:02:49,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:49,811 INFO L495 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2023-11-12 01:02:49,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:49,812 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2023-11-12 01:02:49,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-12 01:02:49,813 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:49,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:49,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 01:02:49,814 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:49,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:49,815 INFO L85 PathProgramCache]: Analyzing trace with hash 32615716, now seen corresponding path program 1 times [2023-11-12 01:02:49,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:49,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911983512] [2023-11-12 01:02:49,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:49,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:50,433 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-12 01:02:50,434 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:50,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911983512] [2023-11-12 01:02:50,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911983512] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:50,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:50,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:50,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782672067] [2023-11-12 01:02:50,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:50,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:50,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:50,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:50,437 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:50,973 INFO L93 Difference]: Finished difference Result 5597 states and 21739 transitions. [2023-11-12 01:02:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:02:50,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2023-11-12 01:02:50,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:51,005 INFO L225 Difference]: With dead ends: 5597 [2023-11-12 01:02:51,005 INFO L226 Difference]: Without dead ends: 4700 [2023-11-12 01:02:51,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:02:51,007 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 49 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:51,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 28 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 01:02:51,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4700 states. [2023-11-12 01:02:51,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4700 to 4112. [2023-11-12 01:02:51,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4112 states, 4111 states have (on average 3.935782048163464) internal successors, (16180), 4111 states have internal predecessors, (16180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:51,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4112 states to 4112 states and 16180 transitions. [2023-11-12 01:02:51,285 INFO L78 Accepts]: Start accepts. Automaton has 4112 states and 16180 transitions. Word has length 12 [2023-11-12 01:02:51,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:51,286 INFO L495 AbstractCegarLoop]: Abstraction has 4112 states and 16180 transitions. [2023-11-12 01:02:51,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:51,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4112 states and 16180 transitions. [2023-11-12 01:02:51,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 01:02:51,289 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:51,290 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:51,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 01:02:51,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:51,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:51,292 INFO L85 PathProgramCache]: Analyzing trace with hash 933371974, now seen corresponding path program 1 times [2023-11-12 01:02:51,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:51,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690864013] [2023-11-12 01:02:51,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:51,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:51,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:51,869 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-12 01:02:51,869 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:51,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690864013] [2023-11-12 01:02:51,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690864013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:51,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:51,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:51,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996383715] [2023-11-12 01:02:51,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:51,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:51,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:51,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:51,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:51,872 INFO L87 Difference]: Start difference. First operand 4112 states and 16180 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:52,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:52,340 INFO L93 Difference]: Finished difference Result 4912 states and 18860 transitions. [2023-11-12 01:02:52,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:02:52,341 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-11-12 01:02:52,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:52,364 INFO L225 Difference]: With dead ends: 4912 [2023-11-12 01:02:52,365 INFO L226 Difference]: Without dead ends: 4112 [2023-11-12 01:02:52,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:02:52,366 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:52,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 22 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:02:52,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2023-11-12 01:02:52,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 3662. [2023-11-12 01:02:52,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 3661 states have (on average 3.8951106255121553) internal successors, (14260), 3661 states have internal predecessors, (14260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:52,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14260 transitions. [2023-11-12 01:02:52,581 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14260 transitions. Word has length 13 [2023-11-12 01:02:52,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:52,582 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 14260 transitions. [2023-11-12 01:02:52,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:52,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14260 transitions. [2023-11-12 01:02:52,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-12 01:02:52,590 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:52,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:52,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 01:02:52,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:52,591 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:52,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1236584251, now seen corresponding path program 1 times [2023-11-12 01:02:52,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:52,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086489573] [2023-11-12 01:02:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:53,260 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-12 01:02:53,260 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:53,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086489573] [2023-11-12 01:02:53,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086489573] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:53,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:53,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:53,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755466664] [2023-11-12 01:02:53,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:53,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:53,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:53,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:53,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:53,263 INFO L87 Difference]: Start difference. First operand 3662 states and 14260 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:53,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:53,564 INFO L93 Difference]: Finished difference Result 3962 states and 15065 transitions. [2023-11-12 01:02:53,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:53,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-12 01:02:53,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:53,582 INFO L225 Difference]: With dead ends: 3962 [2023-11-12 01:02:53,582 INFO L226 Difference]: Without dead ends: 3462 [2023-11-12 01:02:53,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:53,583 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:53,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 28 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:53,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2023-11-12 01:02:53,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3442. [2023-11-12 01:02:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3442 states, 3441 states have (on average 3.870677128741645) internal successors, (13319), 3441 states have internal predecessors, (13319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:53,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3442 states to 3442 states and 13319 transitions. [2023-11-12 01:02:53,725 INFO L78 Accepts]: Start accepts. Automaton has 3442 states and 13319 transitions. Word has length 14 [2023-11-12 01:02:53,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:53,726 INFO L495 AbstractCegarLoop]: Abstraction has 3442 states and 13319 transitions. [2023-11-12 01:02:53,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:53,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3442 states and 13319 transitions. [2023-11-12 01:02:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-12 01:02:53,730 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:53,730 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:53,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 01:02:53,731 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:53,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:53,732 INFO L85 PathProgramCache]: Analyzing trace with hash 30588288, now seen corresponding path program 1 times [2023-11-12 01:02:53,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:53,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515509959] [2023-11-12 01:02:53,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:53,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:53,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:54,437 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-12 01:02:54,437 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:54,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515509959] [2023-11-12 01:02:54,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515509959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:54,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:54,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:54,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053757545] [2023-11-12 01:02:54,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:54,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:02:54,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:54,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:02:54,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:54,440 INFO L87 Difference]: Start difference. First operand 3442 states and 13319 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:54,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:54,752 INFO L93 Difference]: Finished difference Result 4718 states and 17937 transitions. [2023-11-12 01:02:54,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:02:54,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2023-11-12 01:02:54,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:54,774 INFO L225 Difference]: With dead ends: 4718 [2023-11-12 01:02:54,774 INFO L226 Difference]: Without dead ends: 4154 [2023-11-12 01:02:54,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:02:54,775 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 63 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:54,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 43 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:54,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4154 states. [2023-11-12 01:02:54,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4154 to 4102. [2023-11-12 01:02:54,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4102 states, 4101 states have (on average 3.8500365764447695) internal successors, (15789), 4101 states have internal predecessors, (15789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:54,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4102 states to 4102 states and 15789 transitions. [2023-11-12 01:02:54,936 INFO L78 Accepts]: Start accepts. Automaton has 4102 states and 15789 transitions. Word has length 15 [2023-11-12 01:02:54,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:54,936 INFO L495 AbstractCegarLoop]: Abstraction has 4102 states and 15789 transitions. [2023-11-12 01:02:54,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:54,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4102 states and 15789 transitions. [2023-11-12 01:02:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-12 01:02:54,944 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:54,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:02:54,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 01:02:54,944 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:54,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:54,945 INFO L85 PathProgramCache]: Analyzing trace with hash -952657055, now seen corresponding path program 1 times [2023-11-12 01:02:54,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:54,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673324465] [2023-11-12 01:02:54,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:54,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:54,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:55,142 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-12 01:02:55,143 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673324465] [2023-11-12 01:02:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673324465] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:02:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463339227] [2023-11-12 01:02:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:55,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:02:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:02:55,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:02:55,146 INFO L87 Difference]: Start difference. First operand 4102 states and 15789 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:55,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:55,336 INFO L93 Difference]: Finished difference Result 4029 states and 14128 transitions. [2023-11-12 01:02:55,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:02:55,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2023-11-12 01:02:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:55,350 INFO L225 Difference]: With dead ends: 4029 [2023-11-12 01:02:55,351 INFO L226 Difference]: Without dead ends: 3051 [2023-11-12 01:02:55,351 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-12 01:02:55,352 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:55,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 25 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:55,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3051 states. [2023-11-12 01:02:55,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3051 to 3051. [2023-11-12 01:02:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3051 states, 3050 states have (on average 3.46) internal successors, (10553), 3050 states have internal predecessors, (10553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:55,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3051 states to 3051 states and 10553 transitions. [2023-11-12 01:02:55,507 INFO L78 Accepts]: Start accepts. Automaton has 3051 states and 10553 transitions. Word has length 17 [2023-11-12 01:02:55,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:55,508 INFO L495 AbstractCegarLoop]: Abstraction has 3051 states and 10553 transitions. [2023-11-12 01:02:55,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:55,508 INFO L276 IsEmpty]: Start isEmpty. Operand 3051 states and 10553 transitions. [2023-11-12 01:02:55,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 01:02:55,516 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:55,516 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-12 01:02:55,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 01:02:55,517 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:55,518 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:55,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1336892040, now seen corresponding path program 1 times [2023-11-12 01:02:55,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:55,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118012975] [2023-11-12 01:02:55,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:55,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:55,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:55,813 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-12 01:02:55,813 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:55,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118012975] [2023-11-12 01:02:55,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118012975] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:55,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:55,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:02:55,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243316038] [2023-11-12 01:02:55,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:55,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:02:55,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:55,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:02:55,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:02:55,817 INFO L87 Difference]: Start difference. First operand 3051 states and 10553 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-12 01:02:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:56,053 INFO L93 Difference]: Finished difference Result 2426 states and 7751 transitions. [2023-11-12 01:02:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 01:02:56,054 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-12 01:02:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:56,064 INFO L225 Difference]: With dead ends: 2426 [2023-11-12 01:02:56,065 INFO L226 Difference]: Without dead ends: 1856 [2023-11-12 01:02:56,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:56,067 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 62 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:56,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 35 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:56,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2023-11-12 01:02:56,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1668. [2023-11-12 01:02:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1668 states, 1667 states have (on average 3.0893821235752847) internal successors, (5150), 1667 states have internal predecessors, (5150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:56,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1668 states to 1668 states and 5150 transitions. [2023-11-12 01:02:56,135 INFO L78 Accepts]: Start accepts. Automaton has 1668 states and 5150 transitions. Word has length 18 [2023-11-12 01:02:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:56,140 INFO L495 AbstractCegarLoop]: Abstraction has 1668 states and 5150 transitions. [2023-11-12 01:02:56,140 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-12 01:02:56,141 INFO L276 IsEmpty]: Start isEmpty. Operand 1668 states and 5150 transitions. [2023-11-12 01:02:56,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-12 01:02:56,148 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:56,148 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-12 01:02:56,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 01:02:56,149 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:56,149 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1618360891, now seen corresponding path program 1 times [2023-11-12 01:02:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:56,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189234836] [2023-11-12 01:02:56,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:56,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:56,463 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-12 01:02:56,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:56,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189234836] [2023-11-12 01:02:56,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189234836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:56,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:56,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 01:02:56,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682464024] [2023-11-12 01:02:56,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:56,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 01:02:56,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:56,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 01:02:56,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-12 01:02:56,466 INFO L87 Difference]: Start difference. First operand 1668 states and 5150 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12 01:02:56,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:56,735 INFO L93 Difference]: Finished difference Result 1399 states and 4311 transitions. [2023-11-12 01:02:56,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:02:56,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12 01:02:56,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:56,741 INFO L225 Difference]: With dead ends: 1399 [2023-11-12 01:02:56,741 INFO L226 Difference]: Without dead ends: 1245 [2023-11-12 01:02:56,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:02:56,742 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 77 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:56,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 45 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:02:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2023-11-12 01:02:56,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1149. [2023-11-12 01:02:56,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1149 states, 1148 states have (on average 3.137630662020906) internal successors, (3602), 1148 states have internal predecessors, (3602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:56,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 3602 transitions. [2023-11-12 01:02:56,778 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 3602 transitions. Word has length 21 [2023-11-12 01:02:56,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:56,778 INFO L495 AbstractCegarLoop]: Abstraction has 1149 states and 3602 transitions. [2023-11-12 01:02:56,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 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-12 01:02:56,778 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 3602 transitions. [2023-11-12 01:02:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 01:02:56,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:56,783 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] [2023-11-12 01:02:56,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 01:02:56,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:56,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:56,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1095044073, now seen corresponding path program 1 times [2023-11-12 01:02:56,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:56,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117032686] [2023-11-12 01:02:56,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:56,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:56,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:02:58,532 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-12 01:02:58,533 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:02:58,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117032686] [2023-11-12 01:02:58,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117032686] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:02:58,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:02:58,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 01:02:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532116767] [2023-11-12 01:02:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:02:58,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 01:02:58,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:02:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 01:02:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:02:58,535 INFO L87 Difference]: Start difference. First operand 1149 states and 3602 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:59,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:02:59,796 INFO L93 Difference]: Finished difference Result 2390 states and 7238 transitions. [2023-11-12 01:02:59,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-12 01:02:59,796 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-12 01:02:59,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:02:59,808 INFO L225 Difference]: With dead ends: 2390 [2023-11-12 01:02:59,808 INFO L226 Difference]: Without dead ends: 2335 [2023-11-12 01:02:59,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2023-11-12 01:02:59,809 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 166 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-12 01:02:59,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 89 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-12 01:02:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2023-11-12 01:02:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1518. [2023-11-12 01:02:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1518 states, 1517 states have (on average 3.076466710613052) internal successors, (4667), 1517 states have internal predecessors, (4667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:59,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1518 states to 1518 states and 4667 transitions. [2023-11-12 01:02:59,859 INFO L78 Accepts]: Start accepts. Automaton has 1518 states and 4667 transitions. Word has length 25 [2023-11-12 01:02:59,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:02:59,859 INFO L495 AbstractCegarLoop]: Abstraction has 1518 states and 4667 transitions. [2023-11-12 01:02:59,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:02:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1518 states and 4667 transitions. [2023-11-12 01:02:59,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 01:02:59,864 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:02:59,864 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] [2023-11-12 01:02:59,865 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 01:02:59,865 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:02:59,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:02:59,865 INFO L85 PathProgramCache]: Analyzing trace with hash 789167851, now seen corresponding path program 2 times [2023-11-12 01:02:59,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:02:59,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400722863] [2023-11-12 01:02:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:02:59,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:02:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:00,818 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-12 01:03:00,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:00,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400722863] [2023-11-12 01:03:00,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400722863] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:00,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:00,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 01:03:00,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640479193] [2023-11-12 01:03:00,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:00,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 01:03:00,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:00,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 01:03:00,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:03:00,820 INFO L87 Difference]: Start difference. First operand 1518 states and 4667 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:01,545 INFO L93 Difference]: Finished difference Result 3551 states and 10547 transitions. [2023-11-12 01:03:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-12 01:03:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-12 01:03:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:01,554 INFO L225 Difference]: With dead ends: 3551 [2023-11-12 01:03:01,554 INFO L226 Difference]: Without dead ends: 2460 [2023-11-12 01:03:01,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2023-11-12 01:03:01,555 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 102 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:01,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 106 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-12 01:03:01,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2460 states. [2023-11-12 01:03:01,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2460 to 1976. [2023-11-12 01:03:01,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1976 states, 1975 states have (on average 3.050126582278481) internal successors, (6024), 1975 states have internal predecessors, (6024), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:01,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1976 states to 1976 states and 6024 transitions. [2023-11-12 01:03:01,618 INFO L78 Accepts]: Start accepts. Automaton has 1976 states and 6024 transitions. Word has length 25 [2023-11-12 01:03:01,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:01,618 INFO L495 AbstractCegarLoop]: Abstraction has 1976 states and 6024 transitions. [2023-11-12 01:03:01,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:01,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1976 states and 6024 transitions. [2023-11-12 01:03:01,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 01:03:01,625 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:01,625 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] [2023-11-12 01:03:01,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 01:03:01,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:01,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:01,626 INFO L85 PathProgramCache]: Analyzing trace with hash -254215995, now seen corresponding path program 3 times [2023-11-12 01:03:01,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:01,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050216696] [2023-11-12 01:03:01,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:01,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:01,868 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-12 01:03:01,868 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:01,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050216696] [2023-11-12 01:03:01,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050216696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:01,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:01,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 01:03:01,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247902478] [2023-11-12 01:03:01,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:01,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 01:03:01,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:01,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 01:03:01,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:03:01,871 INFO L87 Difference]: Start difference. First operand 1976 states and 6024 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:02,088 INFO L93 Difference]: Finished difference Result 2373 states and 7109 transitions. [2023-11-12 01:03:02,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 01:03:02,088 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-12 01:03:02,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:02,095 INFO L225 Difference]: With dead ends: 2373 [2023-11-12 01:03:02,095 INFO L226 Difference]: Without dead ends: 1896 [2023-11-12 01:03:02,095 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:03:02,096 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:02,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 35 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:03:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2023-11-12 01:03:02,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1432. [2023-11-12 01:03:02,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1432 states, 1431 states have (on average 2.997204751921733) internal successors, (4289), 1431 states have internal predecessors, (4289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1432 states to 1432 states and 4289 transitions. [2023-11-12 01:03:02,139 INFO L78 Accepts]: Start accepts. Automaton has 1432 states and 4289 transitions. Word has length 25 [2023-11-12 01:03:02,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:02,139 INFO L495 AbstractCegarLoop]: Abstraction has 1432 states and 4289 transitions. [2023-11-12 01:03:02,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,140 INFO L276 IsEmpty]: Start isEmpty. Operand 1432 states and 4289 transitions. [2023-11-12 01:03:02,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 01:03:02,144 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:02,144 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] [2023-11-12 01:03:02,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 01:03:02,144 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:02,145 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:02,145 INFO L85 PathProgramCache]: Analyzing trace with hash -468556295, now seen corresponding path program 1 times [2023-11-12 01:03:02,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:02,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105407358] [2023-11-12 01:03:02,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:02,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:02,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:02,382 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-12 01:03:02,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:02,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105407358] [2023-11-12 01:03:02,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105407358] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:02,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 01:03:02,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834900227] [2023-11-12 01:03:02,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:02,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 01:03:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:02,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 01:03:02,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 01:03:02,384 INFO L87 Difference]: Start difference. First operand 1432 states and 4289 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:02,524 INFO L93 Difference]: Finished difference Result 2014 states and 5887 transitions. [2023-11-12 01:03:02,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 01:03:02,525 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-12 01:03:02,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:02,529 INFO L225 Difference]: With dead ends: 2014 [2023-11-12 01:03:02,529 INFO L226 Difference]: Without dead ends: 1314 [2023-11-12 01:03:02,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 01:03:02,530 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 28 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:02,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 22 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 01:03:02,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2023-11-12 01:03:02,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1258. [2023-11-12 01:03:02,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 2.870326173428799) internal successors, (3608), 1257 states have internal predecessors, (3608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 3608 transitions. [2023-11-12 01:03:02,563 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 3608 transitions. Word has length 25 [2023-11-12 01:03:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:02,563 INFO L495 AbstractCegarLoop]: Abstraction has 1258 states and 3608 transitions. [2023-11-12 01:03:02,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:02,563 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 3608 transitions. [2023-11-12 01:03:02,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-12 01:03:02,567 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:02,567 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] [2023-11-12 01:03:02,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-12 01:03:02,568 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:02,568 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:02,568 INFO L85 PathProgramCache]: Analyzing trace with hash -108445335, now seen corresponding path program 2 times [2023-11-12 01:03:02,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:02,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154877609] [2023-11-12 01:03:02,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:02,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:02,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:02,837 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-12 01:03:02,838 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:02,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154877609] [2023-11-12 01:03:02,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154877609] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:02,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:02,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 01:03:02,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535110055] [2023-11-12 01:03:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:02,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 01:03:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:02,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 01:03:02,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-12 01:03:02,840 INFO L87 Difference]: Start difference. First operand 1258 states and 3608 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:03,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:03,075 INFO L93 Difference]: Finished difference Result 1207 states and 3505 transitions. [2023-11-12 01:03:03,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 01:03:03,075 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2023-11-12 01:03:03,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:03,077 INFO L225 Difference]: With dead ends: 1207 [2023-11-12 01:03:03,077 INFO L226 Difference]: Without dead ends: 492 [2023-11-12 01:03:03,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-11-12 01:03:03,078 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:03,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 32 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 01:03:03,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-11-12 01:03:03,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 436. [2023-11-12 01:03:03,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 435 states have (on average 2.6735632183908047) internal successors, (1163), 435 states have internal predecessors, (1163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:03,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 1163 transitions. [2023-11-12 01:03:03,091 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 1163 transitions. Word has length 25 [2023-11-12 01:03:03,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:03,091 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 1163 transitions. [2023-11-12 01:03:03,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:03,092 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 1163 transitions. [2023-11-12 01:03:03,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 01:03:03,094 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:03,094 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] [2023-11-12 01:03:03,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-12 01:03:03,094 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:03,095 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:03,095 INFO L85 PathProgramCache]: Analyzing trace with hash 372686603, now seen corresponding path program 1 times [2023-11-12 01:03:03,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:03,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929740627] [2023-11-12 01:03:03,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:03,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:04,604 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-12 01:03:04,604 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:04,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929740627] [2023-11-12 01:03:04,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929740627] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:04,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:04,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 01:03:04,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107578364] [2023-11-12 01:03:04,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:04,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 01:03:04,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:04,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 01:03:04,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-12 01:03:04,607 INFO L87 Difference]: Start difference. First operand 436 states and 1163 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:04,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:04,978 INFO L93 Difference]: Finished difference Result 571 states and 1533 transitions. [2023-11-12 01:03:04,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:03:04,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-12 01:03:04,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:04,980 INFO L225 Difference]: With dead ends: 571 [2023-11-12 01:03:04,981 INFO L226 Difference]: Without dead ends: 492 [2023-11-12 01:03:04,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:03:04,981 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:04,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 45 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 01:03:04,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2023-11-12 01:03:04,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 324. [2023-11-12 01:03:04,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 324 states, 323 states have (on average 2.653250773993808) internal successors, (857), 323 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:04,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 857 transitions. [2023-11-12 01:03:04,992 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 857 transitions. Word has length 29 [2023-11-12 01:03:04,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:04,993 INFO L495 AbstractCegarLoop]: Abstraction has 324 states and 857 transitions. [2023-11-12 01:03:04,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:04,993 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 857 transitions. [2023-11-12 01:03:04,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 01:03:04,994 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:04,995 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] [2023-11-12 01:03:04,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-12 01:03:04,995 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:04,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:04,996 INFO L85 PathProgramCache]: Analyzing trace with hash 738735917, now seen corresponding path program 2 times [2023-11-12 01:03:04,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:04,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448871484] [2023-11-12 01:03:04,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:04,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 01:03:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 01:03:07,149 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-11-12 01:03:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448871484] [2023-11-12 01:03:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448871484] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 01:03:07,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 01:03:07,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 01:03:07,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343931636] [2023-11-12 01:03:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 01:03:07,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 01:03:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-11-12 01:03:07,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 01:03:07,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-11-12 01:03:07,151 INFO L87 Difference]: Start difference. First operand 324 states and 857 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:07,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 01:03:07,672 INFO L93 Difference]: Finished difference Result 381 states and 995 transitions. [2023-11-12 01:03:07,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 01:03:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2023-11-12 01:03:07,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 01:03:07,680 INFO L225 Difference]: With dead ends: 381 [2023-11-12 01:03:07,681 INFO L226 Difference]: Without dead ends: 266 [2023-11-12 01:03:07,681 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-12 01:03:07,681 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 75 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 01:03:07,682 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 76 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 01:03:07,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-11-12 01:03:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2023-11-12 01:03:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 2.660377358490566) internal successors, (705), 265 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 705 transitions. [2023-11-12 01:03:07,689 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 705 transitions. Word has length 29 [2023-11-12 01:03:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 01:03:07,690 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 705 transitions. [2023-11-12 01:03:07,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 10 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 01:03:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 705 transitions. [2023-11-12 01:03:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-12 01:03:07,691 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 01:03:07,691 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] [2023-11-12 01:03:07,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-12 01:03:07,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 01:03:07,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 01:03:07,693 INFO L85 PathProgramCache]: Analyzing trace with hash 831553577, now seen corresponding path program 3 times [2023-11-12 01:03:07,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-11-12 01:03:07,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358342176] [2023-11-12 01:03:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 01:03:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 01:03:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 01:03:07,783 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-12 01:03:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-12 01:03:07,941 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-11-12 01:03:07,942 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-12 01:03:07,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-12 01:03:07,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-12 01:03:07,948 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-12 01:03:07,950 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-12 01:03:07,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-12 01:03:07,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-12 01:03:07,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-12 01:03:07,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-12 01:03:07,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-12 01:03:07,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-12 01:03:07,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-12 01:03:07,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-12 01:03:07,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-12 01:03:07,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-12 01:03:07,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-12 01:03:07,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-12 01:03:07,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-12 01:03:07,959 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 01:03:07,965 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-12 01:03:07,965 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 01:03:08,054 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-12 01:03:08,057 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-12 01:03:08,067 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-12 01:03:08,069 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-12 01:03:08,081 WARN L1567 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-12 01:03:08,107 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 01:03:08 BasicIcfg [2023-11-12 01:03:08,107 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 01:03:08,108 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 01:03:08,108 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 01:03:08,108 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 01:03:08,109 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 01:02:38" (3/4) ... [2023-11-12 01:03:08,111 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-12 01:03:08,112 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 01:03:08,113 INFO L158 Benchmark]: Toolchain (without parser) took 31793.12ms. Allocated memory was 184.5MB in the beginning and 740.3MB in the end (delta: 555.7MB). Free memory was 132.5MB in the beginning and 187.5MB in the end (delta: -54.9MB). Peak memory consumption was 501.8MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,113 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 184.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 01:03:08,114 INFO L158 Benchmark]: CACSL2BoogieTranslator took 732.78ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 108.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,114 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.63ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 105.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,115 INFO L158 Benchmark]: Boogie Preprocessor took 78.28ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,115 INFO L158 Benchmark]: RCFGBuilder took 1036.43ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 103.5MB in the beginning and 244.4MB in the end (delta: -141.0MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,115 INFO L158 Benchmark]: TraceAbstraction took 29825.55ms. Allocated memory was 281.0MB in the beginning and 740.3MB in the end (delta: 459.3MB). Free memory was 243.4MB in the beginning and 187.5MB in the end (delta: 55.9MB). Peak memory consumption was 515.2MB. Max. memory is 16.1GB. [2023-11-12 01:03:08,116 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 740.3MB. Free memory is still 187.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 01:03:08,118 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 184.5MB. Free memory is still 150.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 732.78ms. Allocated memory is still 184.5MB. Free memory was 131.8MB in the beginning and 108.4MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.63ms. Allocated memory is still 184.5MB. Free memory was 108.4MB in the beginning and 105.6MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.28ms. Allocated memory is still 184.5MB. Free memory was 105.6MB in the beginning and 103.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1036.43ms. Allocated memory was 184.5MB in the beginning and 281.0MB in the end (delta: 96.5MB). Free memory was 103.5MB in the beginning and 244.4MB in the end (delta: -141.0MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. * TraceAbstraction took 29825.55ms. Allocated memory was 281.0MB in the beginning and 740.3MB in the end (delta: 459.3MB). Free memory was 243.4MB in the beginning and 187.5MB in the end (delta: 55.9MB). Peak memory consumption was 515.2MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 740.3MB. Free memory is still 187.5MB. 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~pre3 could not be translated - 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 The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 160 PlacesBefore, 57 PlacesAfterwards, 150 TransitionsBefore, 45 TransitionsAfterwards, 4046 CoEnabledTransitionPairs, 7 FixpointIterations, 52 TrivialSequentialCompositions, 84 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 12 ConcurrentYvCompositions, 2 ChoiceCompositions, 150 TotalNumberOfCompositions, 11411 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4842, independent: 4613, independent conditional: 0, independent unconditional: 4613, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2798, independent: 2737, independent conditional: 0, independent unconditional: 2737, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2798, independent: 2711, independent conditional: 0, independent unconditional: 2711, dependent: 87, dependent conditional: 0, dependent unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 61, dependent conditional: 0, dependent unconditional: 61, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 590, independent: 46, independent conditional: 0, independent unconditional: 46, dependent: 544, dependent conditional: 0, dependent unconditional: 544, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4842, independent: 1876, independent conditional: 0, independent unconditional: 1876, dependent: 168, dependent conditional: 0, dependent unconditional: 168, unknown: 2798, unknown conditional: 0, unknown unconditional: 2798] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 208, Positive conditional cache size: 0, Positive unconditional cache size: 208, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=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] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L774] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L774] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7: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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, 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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L750] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=2] [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=2] [L786] 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) [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] 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 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L806] 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) [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] 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 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] 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 [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 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) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 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 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 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 [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t737={5:0}, t738={6:0}, t739={7:0}, t740={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_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L886] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix027_tso.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=2] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 849]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 852]: 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: 858]: 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: 856]: 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: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 186 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 29.5s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.1s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 970 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 970 mSDsluCounter, 690 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 495 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3273 IncrementalHoareTripleChecker+Invalid, 3447 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 195 mSDtfsCounter, 3273 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6444occurred in iteration=0, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 3439 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 11.2s InterpolantComputationTime, 340 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 294 ConstructedInterpolants, 0 QuantifiedInterpolants, 4372 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-12 01:03:08,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix027_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX --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 ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 01:03:10,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 01:03:10,927 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2023-11-12 01:03:10,938 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 01:03:10,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 01:03:10,989 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 01:03:10,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 01:03:10,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 01:03:10,992 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 01:03:10,997 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 01:03:10,997 INFO L153 SettingsManager]: * User list type=DISABLED [2023-11-12 01:03:10,998 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-11-12 01:03:10,998 INFO L153 SettingsManager]: * Explicit value domain=true [2023-11-12 01:03:11,000 INFO L153 SettingsManager]: * Octagon Domain=false [2023-11-12 01:03:11,001 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-11-12 01:03:11,001 INFO L153 SettingsManager]: * Interval Domain=false [2023-11-12 01:03:11,002 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 01:03:11,002 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 01:03:11,003 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 01:03:11,004 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 01:03:11,005 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 01:03:11,006 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 01:03:11,006 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 01:03:11,006 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 01:03:11,007 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 01:03:11,007 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 01:03:11,008 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 01:03:11,008 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 01:03:11,009 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-12 01:03:11,009 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-12 01:03:11,010 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 01:03:11,011 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 01:03:11,011 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 01:03:11,011 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 01:03:11,012 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 01:03:11,012 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 01:03:11,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:03:11,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 01:03:11,014 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 01:03:11,014 INFO L153 SettingsManager]: * Trace refinement strategy=WALRUS [2023-11-12 01:03:11,014 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-12 01:03:11,014 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-11-12 01:03:11,015 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 01:03:11,015 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_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/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_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX 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 -> ca8042a994ed433e8dc5deebabd166a79d030a0388291f832432b8dc85340f9d [2023-11-12 01:03:11,475 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 01:03:11,508 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 01:03:11,510 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 01:03:11,512 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 01:03:11,512 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 01:03:11,514 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/../../sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-12 01:03:14,896 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 01:03:15,265 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 01:03:15,268 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/sv-benchmarks/c/pthread-wmm/mix027_tso.i [2023-11-12 01:03:15,293 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/6d34a28fe/3f60ad0f01b54d418367fb639ceb90d8/FLAGb7fad4ab7 [2023-11-12 01:03:15,311 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/data/6d34a28fe/3f60ad0f01b54d418367fb639ceb90d8 [2023-11-12 01:03:15,317 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 01:03:15,318 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 01:03:15,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 01:03:15,324 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 01:03:15,329 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 01:03:15,330 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:03:15" (1/1) ... [2023-11-12 01:03:15,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@448bdcd0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:15, skipping insertion in model container [2023-11-12 01:03:15,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 01:03:15" (1/1) ... [2023-11-12 01:03:15,408 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 01:03:15,993 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:03:16,013 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 01:03:16,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 01:03:16,183 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:03:16,184 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 01:03:16,192 INFO L206 MainTranslator]: Completed translation [2023-11-12 01:03:16,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16 WrapperNode [2023-11-12 01:03:16,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 01:03:16,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 01:03:16,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 01:03:16,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 01:03:16,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,297 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 167 [2023-11-12 01:03:16,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 01:03:16,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 01:03:16,299 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 01:03:16,299 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 01:03:16,308 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,358 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,366 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,371 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 01:03:16,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 01:03:16,372 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 01:03:16,372 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 01:03:16,373 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 01:03:16" (1/1) ... [2023-11-12 01:03:16,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 01:03:16,396 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 [2023-11-12 01:03:16,413 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 01:03:16,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_61987a4a-dda4-4160-bade-566856eccf52/bin/utaipan-verify-NcY6lQBIFX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 01:03:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 01:03:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 01:03:16,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 01:03:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 01:03:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-12 01:03:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-12 01:03:16,458 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 01:03:16,458 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 01:03:16,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 01:03:16,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 01:03:16,461 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 01:03:16,461 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 01:03:16,462 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 01:03:16,462 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 01:03:16,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 01:03:16,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 01:03:16,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 01:03:16,464 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 01:03:16,647 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 01:03:16,649 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation