./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a0165632 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_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje --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 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-09 04:54:33,587 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 04:54:33,685 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2024-11-09 04:54:33,692 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 04:54:33,692 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 04:54:33,737 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 04:54:33,737 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 04:54:33,738 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 04:54:33,738 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 04:54:33,739 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 04:54:33,739 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-09 04:54:33,739 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-09 04:54:33,740 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-09 04:54:33,756 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-09 04:54:33,757 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-09 04:54:33,757 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-09 04:54:33,758 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-09 04:54:33,758 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-09 04:54:33,758 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-09 04:54:33,759 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-09 04:54:33,759 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-09 04:54:33,761 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-09 04:54:33,761 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 04:54:33,762 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 04:54:33,762 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 04:54:33,763 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 04:54:33,763 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 04:54:33,763 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 04:54:33,764 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 04:54:33,764 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 04:54:33,764 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 04:54:33,765 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 04:54:33,765 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 04:54:33,766 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 04:54:33,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 04:54:33,766 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 04:54:33,767 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 04:54:33,767 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 04:54:33,767 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 04:54:33,768 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 04:54:33,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 04:54:33,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:54:33,769 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 04:54:33,769 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 04:54:33,769 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-09 04:54:33,769 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 04:54:33,769 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 04:54:33,770 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-09 04:54:33,770 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 04:54:33,770 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_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/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_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje 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 -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2024-11-09 04:54:34,066 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 04:54:34,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 04:54:34,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 04:54:34,105 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 04:54:34,105 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 04:54:34,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i Unable to find full path for "g++" [2024-11-09 04:54:36,074 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 04:54:36,376 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 04:54:36,377 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-11-09 04:54:36,397 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/data/3826f7a6e/90eb001f41d54d9495676ca12884df9f/FLAG00c51e9eb [2024-11-09 04:54:36,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/data/3826f7a6e/90eb001f41d54d9495676ca12884df9f [2024-11-09 04:54:36,416 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 04:54:36,417 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 04:54:36,419 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 04:54:36,419 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 04:54:36,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 04:54:36,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:54:36" (1/1) ... [2024-11-09 04:54:36,427 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34acc841 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:36, skipping insertion in model container [2024-11-09 04:54:36,428 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 04:54:36" (1/1) ... [2024-11-09 04:54:36,483 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 04:54:37,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:54:37,189 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 04:54:37,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 04:54:37,338 INFO L204 MainTranslator]: Completed translation [2024-11-09 04:54:37,339 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37 WrapperNode [2024-11-09 04:54:37,339 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 04:54:37,340 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 04:54:37,340 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 04:54:37,341 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 04:54:37,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,373 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,414 INFO L138 Inliner]: procedures = 372, calls = 99, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 248 [2024-11-09 04:54:37,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 04:54:37,417 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 04:54:37,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 04:54:37,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 04:54:37,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,431 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,436 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,437 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,449 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,457 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 04:54:37,462 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 04:54:37,462 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 04:54:37,462 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 04:54:37,463 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (1/1) ... [2024-11-09 04:54:37,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-09 04:54:37,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:54:37,499 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-09 04:54:37,501 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-09 04:54:37,523 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 04:54:37,524 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 04:54:37,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 04:54:37,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-09 04:54:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 04:54:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 04:54:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 04:54:37,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 04:54:37,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 04:54:37,529 WARN L207 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 04:54:37,696 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 04:54:37,698 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 04:54:38,526 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 04:54:38,526 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 04:54:39,068 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 04:54:39,070 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 04:54:39,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:54:39 BoogieIcfgContainer [2024-11-09 04:54:39,071 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 04:54:39,074 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 04:54:39,075 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 04:54:39,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 04:54:39,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 04:54:36" (1/3) ... [2024-11-09 04:54:39,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be5b6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:54:39, skipping insertion in model container [2024-11-09 04:54:39,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 04:54:37" (2/3) ... [2024-11-09 04:54:39,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@be5b6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 04:54:39, skipping insertion in model container [2024-11-09 04:54:39,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:54:39" (3/3) ... [2024-11-09 04:54:39,084 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2024-11-09 04:54:39,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 04:54:39,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 75 error locations. [2024-11-09 04:54:39,103 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 04:54:39,192 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-09 04:54:39,282 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 133 places, 131 transitions, 266 flow [2024-11-09 04:54:39,365 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 494 states, 335 states have (on average 2.5671641791044775) internal successors, (860), 493 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:39,404 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 04:54:39,414 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b62a799, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 04:54:39,414 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-11-09 04:54:39,418 INFO L276 IsEmpty]: Start isEmpty. Operand has 494 states, 335 states have (on average 2.5671641791044775) internal successors, (860), 493 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 04:54:39,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:39,427 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 04:54:39,428 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 22502305, now seen corresponding path program 1 times [2024-11-09 04:54:39,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:39,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253196392] [2024-11-09 04:54:39,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:39,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:39,888 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:39,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253196392] [2024-11-09 04:54:39,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253196392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:39,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:39,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:54:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641723003] [2024-11-09 04:54:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:39,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:54:39,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:39,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:54:39,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:54:39,932 INFO L87 Difference]: Start difference. First operand has 494 states, 335 states have (on average 2.5671641791044775) internal successors, (860), 493 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:40,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:40,175 INFO L93 Difference]: Finished difference Result 987 states and 1719 transitions. [2024-11-09 04:54:40,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:54:40,181 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-09 04:54:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:40,205 INFO L225 Difference]: With dead ends: 987 [2024-11-09 04:54:40,205 INFO L226 Difference]: Without dead ends: 496 [2024-11-09 04:54:40,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:54:40,218 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 1 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:40,220 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 178 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:40,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-09 04:54:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2024-11-09 04:54:40,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 337 states have (on average 2.5578635014836797) internal successors, (862), 495 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:40,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 862 transitions. [2024-11-09 04:54:40,316 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 862 transitions. Word has length 4 [2024-11-09 04:54:40,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:40,316 INFO L471 AbstractCegarLoop]: Abstraction has 496 states and 862 transitions. [2024-11-09 04:54:40,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:40,318 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 862 transitions. [2024-11-09 04:54:40,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-09 04:54:40,318 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:40,318 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 04:54:40,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 04:54:40,319 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:40,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash 149685954, now seen corresponding path program 1 times [2024-11-09 04:54:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744547110] [2024-11-09 04:54:40,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:40,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:40,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:40,484 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:40,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744547110] [2024-11-09 04:54:40,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744547110] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:54:40,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253876347] [2024-11-09 04:54:40,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:40,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:54:40,488 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:54:40,490 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:54:40,493 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 04:54:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:40,668 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 04:54:40,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:54:40,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:40,715 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:54:40,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:40,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253876347] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:54:40,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1692717745] [2024-11-09 04:54:40,749 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 04:54:40,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:54:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-09 04:54:40,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626138249] [2024-11-09 04:54:40,756 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:54:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:54:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:40,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:54:40,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:54:40,760 INFO L87 Difference]: Start difference. First operand 496 states and 862 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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) [2024-11-09 04:54:41,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:41,006 INFO L93 Difference]: Finished difference Result 992 states and 1727 transitions. [2024-11-09 04:54:41,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 04:54:41,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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 6 [2024-11-09 04:54:41,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:41,016 INFO L225 Difference]: With dead ends: 992 [2024-11-09 04:54:41,016 INFO L226 Difference]: Without dead ends: 501 [2024-11-09 04:54:41,018 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:54:41,022 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 2 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:41,023 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 353 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:41,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-11-09 04:54:41,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 501. [2024-11-09 04:54:41,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 501 states, 342 states have (on average 2.5321637426900585) internal successors, (866), 500 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 866 transitions. [2024-11-09 04:54:41,083 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 866 transitions. Word has length 6 [2024-11-09 04:54:41,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:41,084 INFO L471 AbstractCegarLoop]: Abstraction has 501 states and 866 transitions. [2024-11-09 04:54:41,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 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) [2024-11-09 04:54:41,084 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 866 transitions. [2024-11-09 04:54:41,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:54:41,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:41,085 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2024-11-09 04:54:41,104 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 04:54:41,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-09 04:54:41,286 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:41,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:41,287 INFO L85 PathProgramCache]: Analyzing trace with hash -1427067227, now seen corresponding path program 2 times [2024-11-09 04:54:41,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:41,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695981145] [2024-11-09 04:54:41,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:41,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:41,422 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:41,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695981145] [2024-11-09 04:54:41,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695981145] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:54:41,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806619980] [2024-11-09 04:54:41,423 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 04:54:41,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:54:41,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:54:41,425 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:54:41,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 04:54:41,545 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2024-11-09 04:54:41,546 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 04:54:41,547 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 04:54:41,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:54:41,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 04:54:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:54:41,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 04:54:41,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806619980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:41,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 04:54:41,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2024-11-09 04:54:41,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449389241] [2024-11-09 04:54:41,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:41,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:54:41,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:41,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:54:41,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:41,616 INFO L87 Difference]: Start difference. First operand 501 states and 866 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:41,822 INFO L93 Difference]: Finished difference Result 501 states and 866 transitions. [2024-11-09 04:54:41,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:54:41,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 [2024-11-09 04:54:41,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:41,828 INFO L225 Difference]: With dead ends: 501 [2024-11-09 04:54:41,828 INFO L226 Difference]: Without dead ends: 491 [2024-11-09 04:54:41,829 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:41,830 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 15 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:41,830 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 96 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:41,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-09 04:54:41,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-11-09 04:54:41,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 342 states have (on average 2.502923976608187) internal successors, (856), 490 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:41,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 856 transitions. [2024-11-09 04:54:41,847 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 856 transitions. Word has length 12 [2024-11-09 04:54:41,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:41,848 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 856 transitions. [2024-11-09 04:54:41,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:41,849 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 856 transitions. [2024-11-09 04:54:41,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-09 04:54:41,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:41,849 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1] [2024-11-09 04:54:41,870 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 04:54:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-09 04:54:42,050 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:42,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:42,051 INFO L85 PathProgramCache]: Analyzing trace with hash -1427067228, now seen corresponding path program 1 times [2024-11-09 04:54:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796875946] [2024-11-09 04:54:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:42,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:42,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:54:42,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:42,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796875946] [2024-11-09 04:54:42,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796875946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:42,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:42,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:54:42,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701943640] [2024-11-09 04:54:42,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:42,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:54:42,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:54:42,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:54:42,180 INFO L87 Difference]: Start difference. First operand 491 states and 856 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:42,349 INFO L93 Difference]: Finished difference Result 491 states and 856 transitions. [2024-11-09 04:54:42,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:54:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 [2024-11-09 04:54:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:42,353 INFO L225 Difference]: With dead ends: 491 [2024-11-09 04:54:42,353 INFO L226 Difference]: Without dead ends: 481 [2024-11-09 04:54:42,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:54:42,355 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:42,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:42,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-11-09 04:54:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 481. [2024-11-09 04:54:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 342 states have (on average 2.473684210526316) internal successors, (846), 480 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 846 transitions. [2024-11-09 04:54:42,371 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 846 transitions. Word has length 12 [2024-11-09 04:54:42,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:42,371 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 846 transitions. [2024-11-09 04:54:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,372 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 846 transitions. [2024-11-09 04:54:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:54:42,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:42,372 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:42,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 04:54:42,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:42,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1317015137, now seen corresponding path program 1 times [2024-11-09 04:54:42,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:42,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788380271] [2024-11-09 04:54:42,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:42,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:42,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-09 04:54:42,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788380271] [2024-11-09 04:54:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788380271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:42,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:54:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695610065] [2024-11-09 04:54:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:42,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 04:54:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:42,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 04:54:42,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:42,667 INFO L87 Difference]: Start difference. First operand 481 states and 846 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:42,828 INFO L93 Difference]: Finished difference Result 481 states and 846 transitions. [2024-11-09 04:54:42,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:54:42,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 04:54:42,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:42,832 INFO L225 Difference]: With dead ends: 481 [2024-11-09 04:54:42,832 INFO L226 Difference]: Without dead ends: 435 [2024-11-09 04:54:42,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:42,837 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:42,838 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 22 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:42,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-09 04:54:42,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2024-11-09 04:54:42,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 322 states have (on average 2.3664596273291925) internal successors, (762), 434 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 762 transitions. [2024-11-09 04:54:42,856 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 762 transitions. Word has length 14 [2024-11-09 04:54:42,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:42,856 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 762 transitions. [2024-11-09 04:54:42,856 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:42,857 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 762 transitions. [2024-11-09 04:54:42,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 04:54:42,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:42,857 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:42,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 04:54:42,858 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:42,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:42,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1317015136, now seen corresponding path program 1 times [2024-11-09 04:54:42,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:42,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921104495] [2024-11-09 04:54:42,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:42,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:42,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:43,016 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:43,017 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921104495] [2024-11-09 04:54:43,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1921104495] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 04:54:43,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762191456] [2024-11-09 04:54:43,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:43,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 04:54:43,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 [2024-11-09 04:54:43,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 04:54:43,023 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 04:54:43,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:43,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 04:54:43,161 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 04:54:43,191 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:43,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 04:54:43,268 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 04:54:43,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [762191456] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 04:54:43,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [669501771] [2024-11-09 04:54:43,269 FATAL L? ?]: Ignoring exception! java.lang.UnsupportedOperationException: Construction of path programs is not yet supported for concurrent programs at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram$PathProgramConstructor.(PathProgram.java:259) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:118) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:236) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-11-09 04:54:43,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 04:54:43,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-09 04:54:43,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155279944] [2024-11-09 04:54:43,270 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 04:54:43,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:54:43,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:43,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:54:43,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:54:43,274 INFO L87 Difference]: Start difference. First operand 435 states and 762 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:43,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:43,479 INFO L93 Difference]: Finished difference Result 872 states and 1531 transitions. [2024-11-09 04:54:43,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:54:43,480 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 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 [2024-11-09 04:54:43,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:43,484 INFO L225 Difference]: With dead ends: 872 [2024-11-09 04:54:43,484 INFO L226 Difference]: Without dead ends: 447 [2024-11-09 04:54:43,485 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:54:43,487 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 2 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:43,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 301 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-09 04:54:43,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2024-11-09 04:54:43,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 334 states have (on average 2.317365269461078) internal successors, (774), 446 states have internal predecessors, (774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 774 transitions. [2024-11-09 04:54:43,502 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 774 transitions. Word has length 14 [2024-11-09 04:54:43,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:43,503 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 774 transitions. [2024-11-09 04:54:43,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:43,503 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 774 transitions. [2024-11-09 04:54:43,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-09 04:54:43,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:43,504 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:43,525 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 04:54:43,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 04:54:43,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:43,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash -947935962, now seen corresponding path program 2 times [2024-11-09 04:54:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060335038] [2024-11-09 04:54:43,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:43,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:44,099 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:44,100 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:44,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060335038] [2024-11-09 04:54:44,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060335038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:44,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:44,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 04:54:44,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556560948] [2024-11-09 04:54:44,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:44,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:54:44,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:44,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:54:44,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:54:44,102 INFO L87 Difference]: Start difference. First operand 447 states and 774 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:44,443 INFO L93 Difference]: Finished difference Result 447 states and 774 transitions. [2024-11-09 04:54:44,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:44,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-09 04:54:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:44,447 INFO L225 Difference]: With dead ends: 447 [2024-11-09 04:54:44,447 INFO L226 Difference]: Without dead ends: 421 [2024-11-09 04:54:44,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:54:44,449 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 189 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:44,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 8 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:54:44,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-09 04:54:44,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-11-09 04:54:44,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 323 states have (on average 2.2476780185758516) internal successors, (726), 420 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:44,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 726 transitions. [2024-11-09 04:54:44,462 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 726 transitions. Word has length 26 [2024-11-09 04:54:44,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:44,463 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 726 transitions. [2024-11-09 04:54:44,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:44,463 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 726 transitions. [2024-11-09 04:54:44,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:54:44,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:44,464 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:44,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 04:54:44,465 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:44,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:44,467 INFO L85 PathProgramCache]: Analyzing trace with hash 143759198, now seen corresponding path program 1 times [2024-11-09 04:54:44,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:44,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057696187] [2024-11-09 04:54:44,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:44,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:44,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:45,126 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:45,127 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:45,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057696187] [2024-11-09 04:54:45,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057696187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:45,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:45,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:54:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895189159] [2024-11-09 04:54:45,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:54:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:54:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:45,129 INFO L87 Difference]: Start difference. First operand 421 states and 726 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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) [2024-11-09 04:54:45,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:45,561 INFO L93 Difference]: Finished difference Result 421 states and 726 transitions. [2024-11-09 04:54:45,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:54:45,562 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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 30 [2024-11-09 04:54:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:45,565 INFO L225 Difference]: With dead ends: 421 [2024-11-09 04:54:45,566 INFO L226 Difference]: Without dead ends: 416 [2024-11-09 04:54:45,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:54:45,567 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 458 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 458 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:45,567 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 142 Invalid, 471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 458 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:54:45,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2024-11-09 04:54:45,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2024-11-09 04:54:45,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 323 states have (on average 2.2321981424148607) internal successors, (721), 415 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:45,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 721 transitions. [2024-11-09 04:54:45,579 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 721 transitions. Word has length 30 [2024-11-09 04:54:45,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:45,580 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 721 transitions. [2024-11-09 04:54:45,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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) [2024-11-09 04:54:45,581 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 721 transitions. [2024-11-09 04:54:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 04:54:45,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:45,583 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:45,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 04:54:45,584 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:45,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:45,584 INFO L85 PathProgramCache]: Analyzing trace with hash 143759199, now seen corresponding path program 1 times [2024-11-09 04:54:45,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:45,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235012350] [2024-11-09 04:54:45,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:45,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:46,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:46,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235012350] [2024-11-09 04:54:46,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235012350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:46,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:46,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:54:46,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157973093] [2024-11-09 04:54:46,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:46,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:54:46,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:46,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:54:46,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:46,355 INFO L87 Difference]: Start difference. First operand 416 states and 721 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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) [2024-11-09 04:54:46,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:46,821 INFO L93 Difference]: Finished difference Result 416 states and 721 transitions. [2024-11-09 04:54:46,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:54:46,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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 30 [2024-11-09 04:54:46,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:46,827 INFO L225 Difference]: With dead ends: 416 [2024-11-09 04:54:46,830 INFO L226 Difference]: Without dead ends: 414 [2024-11-09 04:54:46,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:54:46,831 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:46,831 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 118 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 04:54:46,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-09 04:54:46,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-11-09 04:54:46,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 323 states have (on average 2.2260061919504643) internal successors, (719), 413 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:46,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 719 transitions. [2024-11-09 04:54:46,845 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 719 transitions. Word has length 30 [2024-11-09 04:54:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:46,846 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 719 transitions. [2024-11-09 04:54:46,846 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 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) [2024-11-09 04:54:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 719 transitions. [2024-11-09 04:54:46,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:54:46,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:46,847 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:46,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 04:54:46,848 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 713660713, now seen corresponding path program 1 times [2024-11-09 04:54:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:46,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984273004] [2024-11-09 04:54:46,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:47,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984273004] [2024-11-09 04:54:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984273004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:54:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746766965] [2024-11-09 04:54:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:47,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:54:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:54:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:54:47,008 INFO L87 Difference]: Start difference. First operand 414 states and 719 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2024-11-09 04:54:47,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:47,224 INFO L93 Difference]: Finished difference Result 414 states and 719 transitions. [2024-11-09 04:54:47,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:47,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 32 [2024-11-09 04:54:47,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:47,227 INFO L225 Difference]: With dead ends: 414 [2024-11-09 04:54:47,228 INFO L226 Difference]: Without dead ends: 413 [2024-11-09 04:54:47,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:47,229 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 9 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:47,229 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-09 04:54:47,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-09 04:54:47,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 323 states have (on average 2.222910216718266) internal successors, (718), 412 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:47,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 718 transitions. [2024-11-09 04:54:47,241 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 718 transitions. Word has length 32 [2024-11-09 04:54:47,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:47,241 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 718 transitions. [2024-11-09 04:54:47,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2024-11-09 04:54:47,242 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 718 transitions. [2024-11-09 04:54:47,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 04:54:47,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:47,242 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:47,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 04:54:47,243 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:47,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:47,243 INFO L85 PathProgramCache]: Analyzing trace with hash 713660714, now seen corresponding path program 1 times [2024-11-09 04:54:47,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:47,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436590379] [2024-11-09 04:54:47,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:47,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:47,525 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:47,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436590379] [2024-11-09 04:54:47,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436590379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:47,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:47,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:54:47,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873525900] [2024-11-09 04:54:47,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:47,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:54:47,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:47,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:54:47,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:54:47,527 INFO L87 Difference]: Start difference. First operand 413 states and 718 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2024-11-09 04:54:47,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:47,790 INFO L93 Difference]: Finished difference Result 413 states and 718 transitions. [2024-11-09 04:54:47,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:47,791 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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 32 [2024-11-09 04:54:47,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:47,794 INFO L225 Difference]: With dead ends: 413 [2024-11-09 04:54:47,794 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 04:54:47,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:47,795 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:47,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 91 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:47,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 04:54:47,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-11-09 04:54:47,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 323 states have (on average 2.219814241486068) internal successors, (717), 411 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:47,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 717 transitions. [2024-11-09 04:54:47,808 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 717 transitions. Word has length 32 [2024-11-09 04:54:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:47,809 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 717 transitions. [2024-11-09 04:54:47,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 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) [2024-11-09 04:54:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 717 transitions. [2024-11-09 04:54:47,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 04:54:47,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:47,812 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:47,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 04:54:47,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:47,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:47,813 INFO L85 PathProgramCache]: Analyzing trace with hash 578982132, now seen corresponding path program 1 times [2024-11-09 04:54:47,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:47,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630361062] [2024-11-09 04:54:47,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:47,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:48,504 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:48,504 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:48,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630361062] [2024-11-09 04:54:48,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630361062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:48,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:48,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 04:54:48,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853778854] [2024-11-09 04:54:48,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:48,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 04:54:48,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:48,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 04:54:48,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 04:54:48,507 INFO L87 Difference]: Start difference. First operand 412 states and 717 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2024-11-09 04:54:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:48,809 INFO L93 Difference]: Finished difference Result 412 states and 717 transitions. [2024-11-09 04:54:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:48,810 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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 35 [2024-11-09 04:54:48,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:48,813 INFO L225 Difference]: With dead ends: 412 [2024-11-09 04:54:48,814 INFO L226 Difference]: Without dead ends: 409 [2024-11-09 04:54:48,814 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-11-09 04:54:48,815 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 301 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:48,815 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 6 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:54:48,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2024-11-09 04:54:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2024-11-09 04:54:48,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 323 states have (on average 2.210526315789474) internal successors, (714), 408 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:48,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 714 transitions. [2024-11-09 04:54:48,828 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 714 transitions. Word has length 35 [2024-11-09 04:54:48,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:48,828 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 714 transitions. [2024-11-09 04:54:48,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 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) [2024-11-09 04:54:48,829 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 714 transitions. [2024-11-09 04:54:48,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 04:54:48,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:48,830 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:48,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 04:54:48,830 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:48,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:48,830 INFO L85 PathProgramCache]: Analyzing trace with hash 227255535, now seen corresponding path program 1 times [2024-11-09 04:54:48,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:48,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147240764] [2024-11-09 04:54:48,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:48,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:48,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:49,351 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:49,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:49,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147240764] [2024-11-09 04:54:49,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147240764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:49,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:49,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:54:49,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236864923] [2024-11-09 04:54:49,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:49,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:54:49,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:49,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:54:49,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:49,358 INFO L87 Difference]: Start difference. First operand 409 states and 714 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2024-11-09 04:54:49,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:49,708 INFO L93 Difference]: Finished difference Result 409 states and 714 transitions. [2024-11-09 04:54:49,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:54:49,709 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 39 [2024-11-09 04:54:49,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:49,712 INFO L225 Difference]: With dead ends: 409 [2024-11-09 04:54:49,712 INFO L226 Difference]: Without dead ends: 408 [2024-11-09 04:54:49,713 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:54:49,714 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:49,714 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 102 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:54:49,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2024-11-09 04:54:49,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2024-11-09 04:54:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 323 states have (on average 2.2074303405572757) internal successors, (713), 407 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:49,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 713 transitions. [2024-11-09 04:54:49,727 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 713 transitions. Word has length 39 [2024-11-09 04:54:49,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:49,727 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 713 transitions. [2024-11-09 04:54:49,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2024-11-09 04:54:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 713 transitions. [2024-11-09 04:54:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 04:54:49,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:49,729 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:49,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 04:54:49,729 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:49,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:49,729 INFO L85 PathProgramCache]: Analyzing trace with hash 227255536, now seen corresponding path program 1 times [2024-11-09 04:54:49,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:49,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508156618] [2024-11-09 04:54:49,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:49,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:50,598 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:50,599 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:50,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508156618] [2024-11-09 04:54:50,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508156618] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:50,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:50,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 04:54:50,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691516481] [2024-11-09 04:54:50,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:50,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 04:54:50,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:50,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 04:54:50,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 04:54:50,601 INFO L87 Difference]: Start difference. First operand 408 states and 713 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2024-11-09 04:54:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:51,121 INFO L93 Difference]: Finished difference Result 408 states and 713 transitions. [2024-11-09 04:54:51,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 04:54:51,122 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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 39 [2024-11-09 04:54:51,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:51,126 INFO L225 Difference]: With dead ends: 408 [2024-11-09 04:54:51,126 INFO L226 Difference]: Without dead ends: 406 [2024-11-09 04:54:51,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:54:51,128 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:51,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 103 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 438 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:54:51,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2024-11-09 04:54:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 406. [2024-11-09 04:54:51,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 2.2012383900928794) internal successors, (711), 405 states have internal predecessors, (711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 711 transitions. [2024-11-09 04:54:51,142 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 711 transitions. Word has length 39 [2024-11-09 04:54:51,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:51,143 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 711 transitions. [2024-11-09 04:54:51,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 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) [2024-11-09 04:54:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 711 transitions. [2024-11-09 04:54:51,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 04:54:51,144 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:51,145 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:51,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 04:54:51,145 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:51,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:51,146 INFO L85 PathProgramCache]: Analyzing trace with hash -650737404, now seen corresponding path program 1 times [2024-11-09 04:54:51,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:51,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572629228] [2024-11-09 04:54:51,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:51,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:51,358 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:51,359 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:51,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572629228] [2024-11-09 04:54:51,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572629228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:51,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:51,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:54:51,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790205103] [2024-11-09 04:54:51,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:51,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:54:51,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:51,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:54:51,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:54:51,361 INFO L87 Difference]: Start difference. First operand 406 states and 711 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:51,664 INFO L93 Difference]: Finished difference Result 406 states and 711 transitions. [2024-11-09 04:54:51,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:51,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 04:54:51,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:51,672 INFO L225 Difference]: With dead ends: 406 [2024-11-09 04:54:51,672 INFO L226 Difference]: Without dead ends: 405 [2024-11-09 04:54:51,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:51,674 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:51,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:54:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2024-11-09 04:54:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2024-11-09 04:54:51,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 323 states have (on average 2.198142414860681) internal successors, (710), 404 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:51,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 710 transitions. [2024-11-09 04:54:51,695 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 710 transitions. Word has length 41 [2024-11-09 04:54:51,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:51,695 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 710 transitions. [2024-11-09 04:54:51,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 710 transitions. [2024-11-09 04:54:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-09 04:54:51,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:51,697 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:51,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 04:54:51,698 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:51,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:51,699 INFO L85 PathProgramCache]: Analyzing trace with hash -650737403, now seen corresponding path program 1 times [2024-11-09 04:54:51,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:51,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646471822] [2024-11-09 04:54:51,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:51,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:52,209 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646471822] [2024-11-09 04:54:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646471822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:52,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:52,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:54:52,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449678178] [2024-11-09 04:54:52,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:52,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:54:52,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:52,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:54:52,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:54:52,213 INFO L87 Difference]: Start difference. First operand 405 states and 710 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:52,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:52,497 INFO L93 Difference]: Finished difference Result 405 states and 710 transitions. [2024-11-09 04:54:52,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:54:52,498 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-09 04:54:52,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:52,502 INFO L225 Difference]: With dead ends: 405 [2024-11-09 04:54:52,502 INFO L226 Difference]: Without dead ends: 404 [2024-11-09 04:54:52,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:54:52,503 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:52,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:54:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-09 04:54:52,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2024-11-09 04:54:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 323 states have (on average 2.195046439628483) internal successors, (709), 403 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 709 transitions. [2024-11-09 04:54:52,519 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 709 transitions. Word has length 41 [2024-11-09 04:54:52,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:52,519 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 709 transitions. [2024-11-09 04:54:52,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:52,520 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 709 transitions. [2024-11-09 04:54:52,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:54:52,521 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:52,521 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:52,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 04:54:52,522 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:52,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:52,522 INFO L85 PathProgramCache]: Analyzing trace with hash -630619291, now seen corresponding path program 1 times [2024-11-09 04:54:52,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:52,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363382785] [2024-11-09 04:54:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:52,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:52,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:54:55,592 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:54:55,592 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:54:55,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363382785] [2024-11-09 04:54:55,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363382785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:54:55,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:54:55,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 04:54:55,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043703708] [2024-11-09 04:54:55,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:54:55,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:54:55,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:54:55,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:54:55,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=408, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:54:55,596 INFO L87 Difference]: Start difference. First operand 404 states and 709 transitions. Second operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:57,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:54:57,227 INFO L93 Difference]: Finished difference Result 404 states and 709 transitions. [2024-11-09 04:54:57,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 04:54:57,228 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 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 45 [2024-11-09 04:54:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:54:57,231 INFO L225 Difference]: With dead ends: 404 [2024-11-09 04:54:57,231 INFO L226 Difference]: Without dead ends: 403 [2024-11-09 04:54:57,232 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 04:54:57,233 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 93 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 1115 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 04:54:57,233 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 215 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1115 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 04:54:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2024-11-09 04:54:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2024-11-09 04:54:57,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 323 states have (on average 2.191950464396285) internal successors, (708), 402 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:57,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 708 transitions. [2024-11-09 04:54:57,245 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 708 transitions. Word has length 45 [2024-11-09 04:54:57,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:54:57,245 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 708 transitions. [2024-11-09 04:54:57,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:54:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 708 transitions. [2024-11-09 04:54:57,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-09 04:54:57,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:54:57,246 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:54:57,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 04:54:57,247 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:54:57,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:54:57,247 INFO L85 PathProgramCache]: Analyzing trace with hash -630619290, now seen corresponding path program 1 times [2024-11-09 04:54:57,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:54:57,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031075309] [2024-11-09 04:54:57,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:54:57,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:54:57,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:01,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:01,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031075309] [2024-11-09 04:55:01,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031075309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:01,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:01,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-11-09 04:55:01,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232694552] [2024-11-09 04:55:01,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:01,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-09 04:55:01,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:01,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-09 04:55:01,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2024-11-09 04:55:01,111 INFO L87 Difference]: Start difference. First operand 403 states and 708 transitions. Second operand has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:02,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:02,927 INFO L93 Difference]: Finished difference Result 403 states and 708 transitions. [2024-11-09 04:55:02,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 04:55:02,930 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 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 45 [2024-11-09 04:55:02,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:02,933 INFO L225 Difference]: With dead ends: 403 [2024-11-09 04:55:02,934 INFO L226 Difference]: Without dead ends: 401 [2024-11-09 04:55:02,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=154, Invalid=968, Unknown=0, NotChecked=0, Total=1122 [2024-11-09 04:55:02,935 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 85 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1219 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:02,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 64 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1219 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 04:55:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-11-09 04:55:02,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2024-11-09 04:55:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 323 states have (on average 2.1857585139318885) internal successors, (706), 400 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:02,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 706 transitions. [2024-11-09 04:55:02,951 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 706 transitions. Word has length 45 [2024-11-09 04:55:02,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:02,951 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 706 transitions. [2024-11-09 04:55:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:02,952 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 706 transitions. [2024-11-09 04:55:02,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:55:02,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:02,952 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:02,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 04:55:02,953 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:02,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:02,953 INFO L85 PathProgramCache]: Analyzing trace with hash -434723191, now seen corresponding path program 1 times [2024-11-09 04:55:02,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:02,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104139717] [2024-11-09 04:55:02,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:02,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:03,273 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:03,274 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:03,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104139717] [2024-11-09 04:55:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104139717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:03,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:55:03,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428383015] [2024-11-09 04:55:03,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:55:03,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:03,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:55:03,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:55:03,277 INFO L87 Difference]: Start difference. First operand 401 states and 706 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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) [2024-11-09 04:55:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:03,548 INFO L93 Difference]: Finished difference Result 401 states and 706 transitions. [2024-11-09 04:55:03,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:55:03,549 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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 47 [2024-11-09 04:55:03,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:03,552 INFO L225 Difference]: With dead ends: 401 [2024-11-09 04:55:03,553 INFO L226 Difference]: Without dead ends: 399 [2024-11-09 04:55:03,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:55:03,554 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 55 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:03,554 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 48 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:55:03,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2024-11-09 04:55:03,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2024-11-09 04:55:03,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 323 states have (on average 2.179566563467492) internal successors, (704), 398 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 704 transitions. [2024-11-09 04:55:03,569 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 704 transitions. Word has length 47 [2024-11-09 04:55:03,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:03,569 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 704 transitions. [2024-11-09 04:55:03,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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) [2024-11-09 04:55:03,570 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 704 transitions. [2024-11-09 04:55:03,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-09 04:55:03,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:03,570 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:03,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 04:55:03,571 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:03,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:03,572 INFO L85 PathProgramCache]: Analyzing trace with hash -434723190, now seen corresponding path program 1 times [2024-11-09 04:55:03,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:03,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348441170] [2024-11-09 04:55:03,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:03,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:04,042 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:04,042 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:04,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348441170] [2024-11-09 04:55:04,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348441170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:04,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:04,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 04:55:04,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147481956] [2024-11-09 04:55:04,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:04,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 04:55:04,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:04,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 04:55:04,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 04:55:04,047 INFO L87 Difference]: Start difference. First operand 399 states and 704 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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) [2024-11-09 04:55:04,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:04,329 INFO L93 Difference]: Finished difference Result 399 states and 704 transitions. [2024-11-09 04:55:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:55:04,329 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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 47 [2024-11-09 04:55:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:04,333 INFO L225 Difference]: With dead ends: 399 [2024-11-09 04:55:04,333 INFO L226 Difference]: Without dead ends: 397 [2024-11-09 04:55:04,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 04:55:04,334 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 48 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:04,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 46 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 04:55:04,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-11-09 04:55:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2024-11-09 04:55:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 323 states have (on average 2.1733746130030958) internal successors, (702), 396 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:04,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 702 transitions. [2024-11-09 04:55:04,353 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 702 transitions. Word has length 47 [2024-11-09 04:55:04,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:04,354 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 702 transitions. [2024-11-09 04:55:04,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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) [2024-11-09 04:55:04,354 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 702 transitions. [2024-11-09 04:55:04,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:55:04,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:04,355 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:04,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 04:55:04,355 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:04,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:04,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1157134675, now seen corresponding path program 1 times [2024-11-09 04:55:04,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:04,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072350534] [2024-11-09 04:55:04,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:04,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:04,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:06,919 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:06,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072350534] [2024-11-09 04:55:06,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072350534] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:06,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:06,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2024-11-09 04:55:06,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021515079] [2024-11-09 04:55:06,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:06,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 04:55:06,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:06,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 04:55:06,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:55:06,923 INFO L87 Difference]: Start difference. First operand 397 states and 702 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:08,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:08,134 INFO L93 Difference]: Finished difference Result 397 states and 702 transitions. [2024-11-09 04:55:08,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-09 04:55:08,135 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 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 49 [2024-11-09 04:55:08,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:08,138 INFO L225 Difference]: With dead ends: 397 [2024-11-09 04:55:08,139 INFO L226 Difference]: Without dead ends: 396 [2024-11-09 04:55:08,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=212, Invalid=1428, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 04:55:08,140 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:08,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 129 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:55:08,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-11-09 04:55:08,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-11-09 04:55:08,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 323 states have (on average 2.170278637770898) internal successors, (701), 395 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:08,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 701 transitions. [2024-11-09 04:55:08,153 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 701 transitions. Word has length 49 [2024-11-09 04:55:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:08,153 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 701 transitions. [2024-11-09 04:55:08,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:08,154 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 701 transitions. [2024-11-09 04:55:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 04:55:08,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:08,155 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:08,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 04:55:08,155 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:08,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:08,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1157134674, now seen corresponding path program 1 times [2024-11-09 04:55:08,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:08,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832290185] [2024-11-09 04:55:08,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:08,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:11,164 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:11,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:11,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832290185] [2024-11-09 04:55:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832290185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-11-09 04:55:11,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017219335] [2024-11-09 04:55:11,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:11,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 04:55:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:11,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 04:55:11,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2024-11-09 04:55:11,167 INFO L87 Difference]: Start difference. First operand 396 states and 701 transitions. Second operand has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:12,440 INFO L93 Difference]: Finished difference Result 396 states and 701 transitions. [2024-11-09 04:55:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 04:55:12,441 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 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 49 [2024-11-09 04:55:12,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:12,443 INFO L225 Difference]: With dead ends: 396 [2024-11-09 04:55:12,443 INFO L226 Difference]: Without dead ends: 394 [2024-11-09 04:55:12,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=163, Invalid=1097, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 04:55:12,445 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:12,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 91 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 04:55:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-11-09 04:55:12,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-11-09 04:55:12,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 323 states have (on average 2.1640866873065017) internal successors, (699), 393 states have internal predecessors, (699), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 699 transitions. [2024-11-09 04:55:12,462 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 699 transitions. Word has length 49 [2024-11-09 04:55:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:12,463 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 699 transitions. [2024-11-09 04:55:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 21 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 699 transitions. [2024-11-09 04:55:12,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 04:55:12,464 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:12,464 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:12,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 04:55:12,465 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:12,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:12,465 INFO L85 PathProgramCache]: Analyzing trace with hash -1172882946, now seen corresponding path program 1 times [2024-11-09 04:55:12,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:12,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143386694] [2024-11-09 04:55:12,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:12,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:12,640 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:12,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143386694] [2024-11-09 04:55:12,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143386694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:12,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:12,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:55:12,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602007528] [2024-11-09 04:55:12,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:12,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:55:12,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:12,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:55:12,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:55:12,643 INFO L87 Difference]: Start difference. First operand 394 states and 699 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:12,811 INFO L93 Difference]: Finished difference Result 394 states and 699 transitions. [2024-11-09 04:55:12,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:55:12,812 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 56 [2024-11-09 04:55:12,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:12,815 INFO L225 Difference]: With dead ends: 394 [2024-11-09 04:55:12,815 INFO L226 Difference]: Without dead ends: 364 [2024-11-09 04:55:12,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:55:12,816 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:12,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:55:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-09 04:55:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 364. [2024-11-09 04:55:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 305 states have (on average 2.101639344262295) internal successors, (641), 363 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 641 transitions. [2024-11-09 04:55:12,829 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 641 transitions. Word has length 56 [2024-11-09 04:55:12,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:12,829 INFO L471 AbstractCegarLoop]: Abstraction has 364 states and 641 transitions. [2024-11-09 04:55:12,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 641 transitions. [2024-11-09 04:55:12,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-09 04:55:12,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:12,831 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:12,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 04:55:12,831 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:12,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:12,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1172882945, now seen corresponding path program 1 times [2024-11-09 04:55:12,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:12,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711362553] [2024-11-09 04:55:12,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:12,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:13,093 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:13,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711362553] [2024-11-09 04:55:13,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711362553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:13,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:13,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 04:55:13,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340758091] [2024-11-09 04:55:13,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:13,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 04:55:13,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:13,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 04:55:13,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:55:13,096 INFO L87 Difference]: Start difference. First operand 364 states and 641 transitions. Second operand has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:13,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:13,263 INFO L93 Difference]: Finished difference Result 364 states and 641 transitions. [2024-11-09 04:55:13,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 04:55:13,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 56 [2024-11-09 04:55:13,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:13,267 INFO L225 Difference]: With dead ends: 364 [2024-11-09 04:55:13,267 INFO L226 Difference]: Without dead ends: 334 [2024-11-09 04:55:13,268 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 04:55:13,268 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 15 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:13,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 39 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:55:13,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-09 04:55:13,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 334. [2024-11-09 04:55:13,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 287 states have (on average 2.0313588850174216) internal successors, (583), 333 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:13,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 583 transitions. [2024-11-09 04:55:13,279 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 583 transitions. Word has length 56 [2024-11-09 04:55:13,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:13,280 INFO L471 AbstractCegarLoop]: Abstraction has 334 states and 583 transitions. [2024-11-09 04:55:13,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 583 transitions. [2024-11-09 04:55:13,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 04:55:13,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:13,281 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:13,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 04:55:13,282 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:13,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:13,282 INFO L85 PathProgramCache]: Analyzing trace with hash -2118537929, now seen corresponding path program 1 times [2024-11-09 04:55:13,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:13,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427442542] [2024-11-09 04:55:13,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:13,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:13,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:14,719 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:14,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427442542] [2024-11-09 04:55:14,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427442542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:14,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:14,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 04:55:14,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309705364] [2024-11-09 04:55:14,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:14,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 04:55:14,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:14,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 04:55:14,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2024-11-09 04:55:14,722 INFO L87 Difference]: Start difference. First operand 334 states and 583 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:15,416 INFO L93 Difference]: Finished difference Result 379 states and 670 transitions. [2024-11-09 04:55:15,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 04:55:15,417 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 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 57 [2024-11-09 04:55:15,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:15,422 INFO L225 Difference]: With dead ends: 379 [2024-11-09 04:55:15,422 INFO L226 Difference]: Without dead ends: 360 [2024-11-09 04:55:15,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2024-11-09 04:55:15,423 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 169 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:15,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 62 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 04:55:15,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-09 04:55:15,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 345. [2024-11-09 04:55:15,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 298 states have (on average 2.077181208053691) internal successors, (619), 344 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:15,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 619 transitions. [2024-11-09 04:55:15,443 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 619 transitions. Word has length 57 [2024-11-09 04:55:15,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:15,443 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 619 transitions. [2024-11-09 04:55:15,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:15,444 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 619 transitions. [2024-11-09 04:55:15,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-09 04:55:15,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:15,445 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:15,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-09 04:55:15,446 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:15,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:15,446 INFO L85 PathProgramCache]: Analyzing trace with hash -2118537928, now seen corresponding path program 1 times [2024-11-09 04:55:15,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:15,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456346601] [2024-11-09 04:55:15,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:15,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:15,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:18,799 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:18,799 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:18,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456346601] [2024-11-09 04:55:18,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456346601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:18,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:18,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 04:55:18,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522054814] [2024-11-09 04:55:18,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:18,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 04:55:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:18,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 04:55:18,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2024-11-09 04:55:18,802 INFO L87 Difference]: Start difference. First operand 345 states and 619 transitions. Second operand has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:19,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:19,749 INFO L93 Difference]: Finished difference Result 361 states and 634 transitions. [2024-11-09 04:55:19,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 04:55:19,749 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 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 57 [2024-11-09 04:55:19,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:19,752 INFO L225 Difference]: With dead ends: 361 [2024-11-09 04:55:19,752 INFO L226 Difference]: Without dead ends: 342 [2024-11-09 04:55:19,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=91, Invalid=329, Unknown=0, NotChecked=0, Total=420 [2024-11-09 04:55:19,756 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 134 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:19,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 29 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 04:55:19,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-11-09 04:55:19,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 342. [2024-11-09 04:55:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 295 states have (on average 2.077966101694915) internal successors, (613), 341 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 613 transitions. [2024-11-09 04:55:19,772 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 613 transitions. Word has length 57 [2024-11-09 04:55:19,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:19,773 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 613 transitions. [2024-11-09 04:55:19,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.25) internal successors, (39), 13 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:19,773 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 613 transitions. [2024-11-09 04:55:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 04:55:19,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:19,774 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:19,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-09 04:55:19,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:19,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:19,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1859054625, now seen corresponding path program 1 times [2024-11-09 04:55:19,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:19,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288788775] [2024-11-09 04:55:19,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:19,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:20,842 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:20,843 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:20,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288788775] [2024-11-09 04:55:20,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288788775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:20,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:20,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 04:55:20,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776118218] [2024-11-09 04:55:20,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:20,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 04:55:20,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:20,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 04:55:20,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 04:55:20,845 INFO L87 Difference]: Start difference. First operand 342 states and 613 transitions. Second operand has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:21,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:21,084 INFO L93 Difference]: Finished difference Result 342 states and 613 transitions. [2024-11-09 04:55:21,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 04:55:21,084 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 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 58 [2024-11-09 04:55:21,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:21,087 INFO L225 Difference]: With dead ends: 342 [2024-11-09 04:55:21,087 INFO L226 Difference]: Without dead ends: 326 [2024-11-09 04:55:21,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-09 04:55:21,088 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 159 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:21,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 11 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 04:55:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-11-09 04:55:21,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2024-11-09 04:55:21,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 285 states have (on average 2.0385964912280703) internal successors, (581), 325 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 581 transitions. [2024-11-09 04:55:21,099 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 581 transitions. Word has length 58 [2024-11-09 04:55:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:21,099 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 581 transitions. [2024-11-09 04:55:21,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 581 transitions. [2024-11-09 04:55:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 04:55:21,100 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:21,100 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:21,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 04:55:21,100 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:21,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:21,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1250165522, now seen corresponding path program 1 times [2024-11-09 04:55:21,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:21,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048512372] [2024-11-09 04:55:21,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:21,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:21,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:26,564 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:26,564 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:26,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048512372] [2024-11-09 04:55:26,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048512372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-09 04:55:26,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370139309] [2024-11-09 04:55:26,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:26,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 04:55:26,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:26,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 04:55:26,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=690, Unknown=0, NotChecked=0, Total=756 [2024-11-09 04:55:26,566 INFO L87 Difference]: Start difference. First operand 326 states and 581 transitions. Second operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:29,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:29,547 INFO L93 Difference]: Finished difference Result 368 states and 662 transitions. [2024-11-09 04:55:29,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 04:55:29,547 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 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 58 [2024-11-09 04:55:29,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:29,551 INFO L225 Difference]: With dead ends: 368 [2024-11-09 04:55:29,551 INFO L226 Difference]: Without dead ends: 350 [2024-11-09 04:55:29,552 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=246, Invalid=2204, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 04:55:29,552 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 162 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 1340 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:29,553 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 142 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1340 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 04:55:29,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-09 04:55:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 336. [2024-11-09 04:55:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 295 states have (on average 2.08135593220339) internal successors, (614), 335 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 614 transitions. [2024-11-09 04:55:29,563 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 614 transitions. Word has length 58 [2024-11-09 04:55:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:29,563 INFO L471 AbstractCegarLoop]: Abstraction has 336 states and 614 transitions. [2024-11-09 04:55:29,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 614 transitions. [2024-11-09 04:55:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 04:55:29,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:29,564 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:29,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 04:55:29,565 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:29,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:29,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1250165521, now seen corresponding path program 1 times [2024-11-09 04:55:29,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:29,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102774260] [2024-11-09 04:55:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:29,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 04:55:35,727 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2024-11-09 04:55:35,727 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-09 04:55:35,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102774260] [2024-11-09 04:55:35,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102774260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 04:55:35,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 04:55:35,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2024-11-09 04:55:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692341122] [2024-11-09 04:55:35,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 04:55:35,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 04:55:35,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-09 04:55:35,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 04:55:35,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2024-11-09 04:55:35,734 INFO L87 Difference]: Start difference. First operand 336 states and 614 transitions. Second operand has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:38,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 04:55:38,684 INFO L93 Difference]: Finished difference Result 406 states and 732 transitions. [2024-11-09 04:55:38,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 04:55:38,684 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 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 58 [2024-11-09 04:55:38,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 04:55:38,687 INFO L225 Difference]: With dead ends: 406 [2024-11-09 04:55:38,691 INFO L226 Difference]: Without dead ends: 388 [2024-11-09 04:55:38,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=254, Invalid=2196, Unknown=0, NotChecked=0, Total=2450 [2024-11-09 04:55:38,693 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 162 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 04:55:38,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 75 Invalid, 1334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 04:55:38,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-09 04:55:38,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 332. [2024-11-09 04:55:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 291 states have (on average 2.0343642611683848) internal successors, (592), 331 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 592 transitions. [2024-11-09 04:55:38,716 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 592 transitions. Word has length 58 [2024-11-09 04:55:38,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 04:55:38,717 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 592 transitions. [2024-11-09 04:55:38,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4814814814814814) internal successors, (40), 27 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 04:55:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 592 transitions. [2024-11-09 04:55:38,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-09 04:55:38,718 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 04:55:38,718 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:38,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-09 04:55:38,722 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-09 04:55:38,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 04:55:38,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1796117683, now seen corresponding path program 1 times [2024-11-09 04:55:38,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-09 04:55:38,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853273332] [2024-11-09 04:55:38,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 04:55:38,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 04:55:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:55:38,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 04:55:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 04:55:39,287 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-09 04:55:39,288 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 04:55:39,289 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 88 remaining) [2024-11-09 04:55:39,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2024-11-09 04:55:39,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2024-11-09 04:55:39,291 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2024-11-09 04:55:39,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2024-11-09 04:55:39,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2024-11-09 04:55:39,292 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2024-11-09 04:55:39,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2024-11-09 04:55:39,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2024-11-09 04:55:39,293 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2024-11-09 04:55:39,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2024-11-09 04:55:39,294 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2024-11-09 04:55:39,295 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2024-11-09 04:55:39,296 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2024-11-09 04:55:39,297 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2024-11-09 04:55:39,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2024-11-09 04:55:39,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2024-11-09 04:55:39,298 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2024-11-09 04:55:39,299 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2024-11-09 04:55:39,300 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2024-11-09 04:55:39,301 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2024-11-09 04:55:39,302 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (24 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2024-11-09 04:55:39,303 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2024-11-09 04:55:39,304 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2024-11-09 04:55:39,305 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2024-11-09 04:55:39,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-09 04:55:39,309 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 04:55:39,397 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 04:55:39,397 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 04:55:39,401 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 04:55:39 BasicIcfg [2024-11-09 04:55:39,402 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 04:55:39,403 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 04:55:39,403 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 04:55:39,403 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 04:55:39,404 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 04:54:39" (3/4) ... [2024-11-09 04:55:39,405 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 04:55:39,494 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/witness.graphml [2024-11-09 04:55:39,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 04:55:39,495 INFO L158 Benchmark]: Toolchain (without parser) took 63077.78ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 101.1MB in the beginning and 557.1MB in the end (delta: -456.1MB). Peak memory consumption was 402.0MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,495 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 04:55:39,495 INFO L158 Benchmark]: CACSL2BoogieTranslator took 920.75ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 99.6MB in the end (delta: 1.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.32ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 95.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,496 INFO L158 Benchmark]: Boogie Preprocessor took 43.94ms. Allocated memory is still 161.5MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,496 INFO L158 Benchmark]: RCFGBuilder took 1609.47ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 71.5MB in the end (delta: 21.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,497 INFO L158 Benchmark]: TraceAbstraction took 60327.84ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 70.4MB in the beginning and 566.6MB in the end (delta: -496.2MB). Peak memory consumption was 359.5MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,497 INFO L158 Benchmark]: Witness Printer took 91.31ms. Allocated memory is still 1.0GB. Free memory was 566.6MB in the beginning and 557.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 04:55:39,499 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.28ms. Allocated memory is still 117.4MB. Free memory is still 86.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 920.75ms. Allocated memory is still 161.5MB. Free memory was 100.9MB in the beginning and 99.6MB in the end (delta: 1.3MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.32ms. Allocated memory is still 161.5MB. Free memory was 99.6MB in the beginning and 95.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.94ms. Allocated memory is still 161.5MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1609.47ms. Allocated memory is still 161.5MB. Free memory was 92.7MB in the beginning and 71.5MB in the end (delta: 21.3MB). Peak memory consumption was 36.2MB. Max. memory is 16.1GB. * TraceAbstraction took 60327.84ms. Allocated memory was 161.5MB in the beginning and 1.0GB in the end (delta: 855.6MB). Free memory was 70.4MB in the beginning and 566.6MB in the end (delta: -496.2MB). Peak memory consumption was 359.5MB. Max. memory is 16.1GB. * Witness Printer took 91.31ms. Allocated memory is still 1.0GB. Free memory was 566.6MB in the beginning and 557.1MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 VAL [i=10, mutex={1:0}, slot={2:0}] [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=1, mutex={1:0}, p={-2:0}, slot={2:0}, x=1] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=2, mutex={1:0}, p={-3:0}, slot={2:0}, x=2] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [\old(list)={-2:0}, \old(node)={-3:0}, list={-2:0}, mutex={1:0}, node={-3:0}, slot={2:0}, temp={0:0}] [L1241] 0 node->next = temp [L1262] RET 0 list_add(new(2), slot[j]) [L1263] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=1, mutex={1:0}, p={-4:0}, slot={2:0}, x=1] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=2, mutex={1:0}, p={-5:0}, slot={2:0}, x=2] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [\old(list)={-4:0}, \old(node)={-5:0}, list={-4:0}, mutex={1:0}, node={-5:0}, slot={2:0}, temp={0:0}] [L1241] 0 node->next = temp [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [\old(x)=3, mutex={1:0}, p={-6:0}, slot={2:0}, x=3] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [\old(list)={-2:0}, \old(node)={-6:0}, list={-2:0}, mutex={1:0}, node={-6:0}, slot={2:0}, temp={-3:0}] [L1241] 0 node->next = temp [L1266] RET 0 list_add(p, slot[j]) [L1267] EXPR 0 slot[k] [L1267] CALL 0 list_add(p, slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [\old(list)={-4:0}, \old(node)={-6:0}, list={-4:0}, mutex={1:0}, node={-6:0}, slot={2:0}, temp={-5:0}] [L1241] 0 node->next = temp [L1267] RET 0 list_add(p, slot[k]) [L1268] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=1, mutex={1:0}, p={-6:0}, slot={2:0}, t1=-1] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(x)=3, \result={-6:0}, mutex={1:0}, p={5:0}, slot={2:0}, x=3] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1268]: 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: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 155 locations, 88 error locations. Started 1 CEGAR loops. OverallTime: 60.1s, OverallIterations: 30, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 19.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1982 SdHoareTripleChecker+Valid, 12.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1982 mSDsluCounter, 2875 SdHoareTripleChecker+Invalid, 11.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2014 mSDsCounter, 461 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12166 IncrementalHoareTripleChecker+Invalid, 12627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 461 mSolverCounterUnsat, 861 mSDtfsCounter, 12166 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 385 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1974 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=501occurred in iteration=2, InterpolantAutomatonStates: 259, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 85 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 35.4s InterpolantComputationTime, 1180 NumberOfCodeBlocks, 1172 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1107 ConstructedInterpolants, 0 QuantifiedInterpolants, 13226 SizeOfPredicates, 0 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 34 InterpolantComputations, 27 PerfectInterpolantSequences, 2348/2415 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 proved your program to be incorrect! [2024-11-09 04:55:39,538 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e159807-9242-4bb0-94e9-165bd0aadfa9/bin/utaipan-verify-YMUCfTKeje/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 Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)