./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/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_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh --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.4-dev-0e0057c [2023-12-02 13:29:55,405 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:29:55,464 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2023-12-02 13:29:55,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:29:55,469 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:29:55,490 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:29:55,491 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:29:55,491 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:29:55,492 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:29:55,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:29:55,493 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:29:55,494 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:29:55,494 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:29:55,495 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:29:55,495 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:29:55,495 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:29:55,496 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:29:55,496 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:29:55,497 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:29:55,497 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:29:55,498 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:29:55,499 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:29:55,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:29:55,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:29:55,500 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:29:55,500 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:29:55,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:29:55,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:29:55,502 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:29:55,502 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:29:55,502 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:29:55,503 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:29:55,503 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:29:55,503 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:29:55,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:29:55,504 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:29:55,504 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:29:55,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:29:55,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:29:55,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:29:55,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:29:55,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:29:55,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:29:55,505 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:29:55,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:29:55,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:29:55,506 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:29:55,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:29:55,506 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_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/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_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh 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 [2023-12-02 13:29:55,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:29:55,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:29:55,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:29:55,759 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:29:55,760 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:29:55,761 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2023-12-02 13:29:58,551 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:29:58,798 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:29:58,799 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2023-12-02 13:29:58,819 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/data/01ee4fa58/3c469dac53f84378a3b235da5e28fcd2/FLAGa57de59e5 [2023-12-02 13:29:58,831 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/data/01ee4fa58/3c469dac53f84378a3b235da5e28fcd2 [2023-12-02 13:29:58,834 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:29:58,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:29:58,836 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:29:58,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:29:58,841 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:29:58,842 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:29:58" (1/1) ... [2023-12-02 13:29:58,843 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40e1a4d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:58, skipping insertion in model container [2023-12-02 13:29:58,843 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:29:58" (1/1) ... [2023-12-02 13:29:58,890 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:29:59,335 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:29:59,353 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:29:59,409 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:29:59,479 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:29:59,479 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59 WrapperNode [2023-12-02 13:29:59,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:29:59,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:29:59,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:29:59,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:29:59,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,511 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,544 INFO L138 Inliner]: procedures = 371, calls = 43, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 194 [2023-12-02 13:29:59,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:29:59,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:29:59,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:29:59,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:29:59,554 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,560 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,561 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,582 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,585 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,589 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:29:59,590 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:29:59,590 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:29:59,590 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:29:59,591 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (1/1) ... [2023-12-02 13:29:59,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:29:59,625 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:29:59,640 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:29:59,651 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:29:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:29:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-12-02 13:29:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:29:59,683 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-12-02 13:29:59,684 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-12-02 13:29:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-12-02 13:29:59,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:29:59,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:29:59,686 WARN L213 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-12-02 13:29:59,853 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:29:59,855 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:30:00,346 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:30:00,630 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:30:00,631 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 13:30:00,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:30:00 BoogieIcfgContainer [2023-12-02 13:30:00,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:30:00,634 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:30:00,634 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:30:00,638 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:30:00,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:29:58" (1/3) ... [2023-12-02 13:30:00,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e61657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:30:00, skipping insertion in model container [2023-12-02 13:30:00,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:29:59" (2/3) ... [2023-12-02 13:30:00,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63e61657 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:30:00, skipping insertion in model container [2023-12-02 13:30:00,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:30:00" (3/3) ... [2023-12-02 13:30:00,641 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2023-12-02 13:30:00,661 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:30:00,662 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2023-12-02 13:30:00,662 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-12-02 13:30:00,735 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-12-02 13:30:00,766 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 134 places, 131 transitions, 266 flow [2023-12-02 13:30:00,812 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 495 states, 334 states have (on average 2.5748502994011977) internal successors, (860), 494 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) [2023-12-02 13:30:00,829 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:30:00,836 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5c299e6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:30:00,836 INFO L358 AbstractCegarLoop]: Starting to check reachability of 90 error locations. [2023-12-02 13:30:00,840 INFO L276 IsEmpty]: Start isEmpty. Operand has 495 states, 334 states have (on average 2.5748502994011977) internal successors, (860), 494 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) [2023-12-02 13:30:00,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 13:30:00,845 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:00,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 13:30:00,846 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:00,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:00,851 INFO L85 PathProgramCache]: Analyzing trace with hash 615170, now seen corresponding path program 1 times [2023-12-02 13:30:00,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:00,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327126853] [2023-12-02 13:30:00,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:00,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:01,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:01,068 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:01,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327126853] [2023-12-02 13:30:01,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327126853] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:01,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:01,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:01,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529176047] [2023-12-02 13:30:01,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:01,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:01,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:01,102 INFO L87 Difference]: Start difference. First operand has 495 states, 334 states have (on average 2.5748502994011977) internal successors, (860), 494 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.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:01,247 INFO L93 Difference]: Finished difference Result 496 states and 861 transitions. [2023-12-02 13:30:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:01,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2023-12-02 13:30:01,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:01,270 INFO L225 Difference]: With dead ends: 496 [2023-12-02 13:30:01,270 INFO L226 Difference]: Without dead ends: 496 [2023-12-02 13:30:01,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:01,275 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:01,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 182 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:01,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-02 13:30:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 496. [2023-12-02 13:30:01,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 496 states, 335 states have (on average 2.5701492537313433) internal successors, (861), 495 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 496 states to 496 states and 861 transitions. [2023-12-02 13:30:01,346 INFO L78 Accepts]: Start accepts. Automaton has 496 states and 861 transitions. Word has length 3 [2023-12-02 13:30:01,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:01,347 INFO L495 AbstractCegarLoop]: Abstraction has 496 states and 861 transitions. [2023-12-02 13:30:01,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.0) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,347 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 861 transitions. [2023-12-02 13:30:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 13:30:01,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:01,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 13:30:01,348 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:30:01,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:01,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:01,349 INFO L85 PathProgramCache]: Analyzing trace with hash 19066370, now seen corresponding path program 1 times [2023-12-02 13:30:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611608805] [2023-12-02 13:30:01,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:01,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:01,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:01,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611608805] [2023-12-02 13:30:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611608805] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504249577] [2023-12-02 13:30:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:01,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:01,452 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:01,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:30:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:01,552 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-02 13:30:01,556 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:01,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:01,593 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:01,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:01,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504249577] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:01,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1213142182] [2023-12-02 13:30:01,618 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:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:30:01,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:30:01,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-12-02 13:30:01,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899187561] [2023-12-02 13:30:01,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:30:01,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:30:01,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:01,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:30:01,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:30:01,624 INFO L87 Difference]: Start difference. First operand 496 states and 861 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:01,755 INFO L93 Difference]: Finished difference Result 499 states and 864 transitions. [2023-12-02 13:30:01,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:30:01,755 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 13:30:01,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:01,759 INFO L225 Difference]: With dead ends: 499 [2023-12-02 13:30:01,760 INFO L226 Difference]: Without dead ends: 499 [2023-12-02 13:30:01,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:30:01,761 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:01,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 273 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2023-12-02 13:30:01,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 499. [2023-12-02 13:30:01,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 338 states have (on average 2.5562130177514795) internal successors, (864), 498 states have internal predecessors, (864), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 864 transitions. [2023-12-02 13:30:01,783 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 864 transitions. Word has length 4 [2023-12-02 13:30:01,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:01,784 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 864 transitions. [2023-12-02 13:30:01,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:01,784 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 864 transitions. [2023-12-02 13:30:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:30:01,784 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:01,785 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1] [2023-12-02 13:30:01,795 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:30:01,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:01,990 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:01,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:01,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1066672898, now seen corresponding path program 2 times [2023-12-02 13:30:01,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836733410] [2023-12-02 13:30:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:02,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:02,066 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-02 13:30:02,066 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836733410] [2023-12-02 13:30:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836733410] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:02,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:02,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696240779] [2023-12-02 13:30:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:02,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:02,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:02,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:02,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:02,068 INFO L87 Difference]: Start difference. First operand 499 states and 864 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-12-02 13:30:02,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:02,237 INFO L93 Difference]: Finished difference Result 489 states and 854 transitions. [2023-12-02 13:30:02,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:02,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 7 [2023-12-02 13:30:02,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:02,242 INFO L225 Difference]: With dead ends: 489 [2023-12-02 13:30:02,242 INFO L226 Difference]: Without dead ends: 489 [2023-12-02 13:30:02,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:02,243 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 15 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:02,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 95 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2023-12-02 13:30:02,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2023-12-02 13:30:02,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 338 states have (on average 2.526627218934911) internal successors, (854), 488 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:02,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 854 transitions. [2023-12-02 13:30:02,260 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 854 transitions. Word has length 7 [2023-12-02 13:30:02,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:02,260 INFO L495 AbstractCegarLoop]: Abstraction has 489 states and 854 transitions. [2023-12-02 13:30:02,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-12-02 13:30:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 854 transitions. [2023-12-02 13:30:02,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:30:02,261 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:02,261 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1] [2023-12-02 13:30:02,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:30:02,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:02,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:02,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1066672899, now seen corresponding path program 1 times [2023-12-02 13:30:02,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:02,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547156992] [2023-12-02 13:30:02,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:02,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:02,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:02,356 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547156992] [2023-12-02 13:30:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547156992] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:02,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1843366776] [2023-12-02 13:30:02,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:02,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:02,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:02,358 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:02,362 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:30:02,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:02,454 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-02 13:30:02,455 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:02,474 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:02,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:02,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:02,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1843366776] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:02,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [823138750] [2023-12-02 13:30:02,546 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:243) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.cfg.PathProgram.constructPathProgram(PathProgram.java:112) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:91) 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:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:225) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) 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) [2023-12-02 13:30:02,549 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:30:02,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2023-12-02 13:30:02,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699493048] [2023-12-02 13:30:02,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:30:02,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 13:30:02,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:02,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 13:30:02,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:30:02,551 INFO L87 Difference]: Start difference. First operand 489 states and 854 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:02,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:02,706 INFO L93 Difference]: Finished difference Result 495 states and 860 transitions. [2023-12-02 13:30:02,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-02 13:30:02,706 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 13:30:02,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:02,710 INFO L225 Difference]: With dead ends: 495 [2023-12-02 13:30:02,710 INFO L226 Difference]: Without dead ends: 495 [2023-12-02 13:30:02,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:30:02,711 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:02,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 324 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:02,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-12-02 13:30:02,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2023-12-02 13:30:02,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 344 states have (on average 2.5) internal successors, (860), 494 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) [2023-12-02 13:30:02,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 860 transitions. [2023-12-02 13:30:02,724 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 860 transitions. Word has length 7 [2023-12-02 13:30:02,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:02,724 INFO L495 AbstractCegarLoop]: Abstraction has 495 states and 860 transitions. [2023-12-02 13:30:02,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:02,724 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 860 transitions. [2023-12-02 13:30:02,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 13:30:02,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:02,725 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1] [2023-12-02 13:30:02,730 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-02 13:30:02,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:02,926 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:02,926 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:02,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1200636675, now seen corresponding path program 2 times [2023-12-02 13:30:02,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:02,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316363105] [2023-12-02 13:30:02,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:02,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:02,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:03,022 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:03,023 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:03,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316363105] [2023-12-02 13:30:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316363105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:03,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:03,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:03,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744345647] [2023-12-02 13:30:03,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:03,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:03,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:03,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:03,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:03,025 INFO L87 Difference]: Start difference. First operand 495 states and 860 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-12-02 13:30:03,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:03,169 INFO L93 Difference]: Finished difference Result 485 states and 850 transitions. [2023-12-02 13:30:03,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:03,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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 13 [2023-12-02 13:30:03,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:03,174 INFO L225 Difference]: With dead ends: 485 [2023-12-02 13:30:03,174 INFO L226 Difference]: Without dead ends: 485 [2023-12-02 13:30:03,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:03,176 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 5 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:03,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 96 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2023-12-02 13:30:03,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2023-12-02 13:30:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 344 states have (on average 2.4709302325581395) internal successors, (850), 484 states have internal predecessors, (850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:03,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 850 transitions. [2023-12-02 13:30:03,190 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 850 transitions. Word has length 13 [2023-12-02 13:30:03,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:03,190 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 850 transitions. [2023-12-02 13:30:03,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 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) [2023-12-02 13:30:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 850 transitions. [2023-12-02 13:30:03,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:30:03,191 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:03,191 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2023-12-02 13:30:03,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:30:03,191 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:03,192 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:03,192 INFO L85 PathProgramCache]: Analyzing trace with hash -1534338997, now seen corresponding path program 1 times [2023-12-02 13:30:03,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:03,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552290642] [2023-12-02 13:30:03,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:03,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:03,343 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:03,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:03,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552290642] [2023-12-02 13:30:03,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552290642] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:03,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:03,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:30:03,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953035439] [2023-12-02 13:30:03,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:03,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:03,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:03,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:03,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:03,345 INFO L87 Difference]: Start difference. First operand 485 states and 850 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2023-12-02 13:30:03,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:03,526 INFO L93 Difference]: Finished difference Result 475 states and 822 transitions. [2023-12-02 13:30:03,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:30:03,527 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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 15 [2023-12-02 13:30:03,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:03,530 INFO L225 Difference]: With dead ends: 475 [2023-12-02 13:30:03,530 INFO L226 Difference]: Without dead ends: 475 [2023-12-02 13:30:03,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:03,531 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 193 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:03,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 36 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:03,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2023-12-02 13:30:03,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 442. [2023-12-02 13:30:03,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 325 states have (on average 2.3723076923076922) internal successors, (771), 441 states have internal predecessors, (771), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:03,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 771 transitions. [2023-12-02 13:30:03,542 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 771 transitions. Word has length 15 [2023-12-02 13:30:03,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:03,542 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 771 transitions. [2023-12-02 13:30:03,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 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) [2023-12-02 13:30:03,542 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 771 transitions. [2023-12-02 13:30:03,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-02 13:30:03,543 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:03,543 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2023-12-02 13:30:03,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:30:03,543 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:03,543 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:03,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1534338996, now seen corresponding path program 1 times [2023-12-02 13:30:03,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:03,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319150200] [2023-12-02 13:30:03,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:03,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:03,765 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319150200] [2023-12-02 13:30:03,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319150200] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:03,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:03,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:03,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978934027] [2023-12-02 13:30:03,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:03,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:30:03,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:03,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:30:03,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:30:03,767 INFO L87 Difference]: Start difference. First operand 442 states and 771 transitions. Second operand has 4 states, 3 states have (on average 2.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) [2023-12-02 13:30:04,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:04,008 INFO L93 Difference]: Finished difference Result 458 states and 802 transitions. [2023-12-02 13:30:04,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:04,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.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 15 [2023-12-02 13:30:04,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:04,012 INFO L225 Difference]: With dead ends: 458 [2023-12-02 13:30:04,012 INFO L226 Difference]: Without dead ends: 458 [2023-12-02 13:30:04,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:04,013 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 196 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:04,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 8 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-02 13:30:04,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 416. [2023-12-02 13:30:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 314 states have (on average 2.3025477707006368) internal successors, (723), 415 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:04,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 723 transitions. [2023-12-02 13:30:04,027 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 723 transitions. Word has length 15 [2023-12-02 13:30:04,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:04,027 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 723 transitions. [2023-12-02 13:30:04,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.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) [2023-12-02 13:30:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 723 transitions. [2023-12-02 13:30:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:30:04,028 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:04,028 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:04,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:30:04,029 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:04,029 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:04,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1345356097, now seen corresponding path program 1 times [2023-12-02 13:30:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592498547] [2023-12-02 13:30:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:04,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:04,382 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:04,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592498547] [2023-12-02 13:30:04,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592498547] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:04,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:04,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:30:04,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797726769] [2023-12-02 13:30:04,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:04,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:30:04,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:04,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:30:04,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:30:04,384 INFO L87 Difference]: Start difference. First operand 416 states and 723 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:04,741 INFO L93 Difference]: Finished difference Result 411 states and 718 transitions. [2023-12-02 13:30:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:30:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:30:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:04,745 INFO L225 Difference]: With dead ends: 411 [2023-12-02 13:30:04,745 INFO L226 Difference]: Without dead ends: 411 [2023-12-02 13:30:04,746 INFO L412 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 [2023-12-02 13:30:04,746 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:04,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 138 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:30:04,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-02 13:30:04,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2023-12-02 13:30:04,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 314 states have (on average 2.286624203821656) internal successors, (718), 410 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) [2023-12-02 13:30:04,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 718 transitions. [2023-12-02 13:30:04,763 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 718 transitions. Word has length 19 [2023-12-02 13:30:04,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:04,763 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 718 transitions. [2023-12-02 13:30:04,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 718 transitions. [2023-12-02 13:30:04,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:30:04,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:04,764 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:04,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-02 13:30:04,764 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:04,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:04,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1345356098, now seen corresponding path program 1 times [2023-12-02 13:30:04,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:04,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782418370] [2023-12-02 13:30:04,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:04,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:05,232 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:05,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:05,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782418370] [2023-12-02 13:30:05,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782418370] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:05,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:05,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:30:05,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856117515] [2023-12-02 13:30:05,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:05,233 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:30:05,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:05,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:30:05,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:30:05,234 INFO L87 Difference]: Start difference. First operand 411 states and 718 transitions. Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:05,573 INFO L93 Difference]: Finished difference Result 409 states and 716 transitions. [2023-12-02 13:30:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:30:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:30:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:05,576 INFO L225 Difference]: With dead ends: 409 [2023-12-02 13:30:05,576 INFO L226 Difference]: Without dead ends: 409 [2023-12-02 13:30:05,576 INFO L412 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 [2023-12-02 13:30:05,577 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 14 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:30:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2023-12-02 13:30:05,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 409. [2023-12-02 13:30:05,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 314 states have (on average 2.2802547770700636) internal successors, (716), 408 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 716 transitions. [2023-12-02 13:30:05,588 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 716 transitions. Word has length 19 [2023-12-02 13:30:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:05,588 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 716 transitions. [2023-12-02 13:30:05,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 716 transitions. [2023-12-02 13:30:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:30:05,589 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:05,589 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:05,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-02 13:30:05,590 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:05,590 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:05,590 INFO L85 PathProgramCache]: Analyzing trace with hash 102074540, now seen corresponding path program 1 times [2023-12-02 13:30:05,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:05,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052577451] [2023-12-02 13:30:05,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:05,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:05,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052577451] [2023-12-02 13:30:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052577451] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:05,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:05,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694810181] [2023-12-02 13:30:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:05,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:05,731 INFO L87 Difference]: Start difference. First operand 409 states and 716 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:05,922 INFO L93 Difference]: Finished difference Result 408 states and 715 transitions. [2023-12-02 13:30:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:05,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 13:30:05,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:05,926 INFO L225 Difference]: With dead ends: 408 [2023-12-02 13:30:05,926 INFO L226 Difference]: Without dead ends: 408 [2023-12-02 13:30:05,926 INFO L412 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 [2023-12-02 13:30:05,927 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:05,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 108 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-02 13:30:05,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2023-12-02 13:30:05,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 314 states have (on average 2.2770700636942673) internal successors, (715), 407 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 715 transitions. [2023-12-02 13:30:05,937 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 715 transitions. Word has length 21 [2023-12-02 13:30:05,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:05,937 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 715 transitions. [2023-12-02 13:30:05,937 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 715 transitions. [2023-12-02 13:30:05,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:30:05,938 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:05,938 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:05,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 13:30:05,938 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:05,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:05,938 INFO L85 PathProgramCache]: Analyzing trace with hash 102074541, now seen corresponding path program 1 times [2023-12-02 13:30:05,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:05,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779673104] [2023-12-02 13:30:05,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:05,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:06,119 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:06,119 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:06,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779673104] [2023-12-02 13:30:06,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779673104] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:06,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:06,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:06,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704426285] [2023-12-02 13:30:06,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:06,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:06,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:06,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:06,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:06,121 INFO L87 Difference]: Start difference. First operand 408 states and 715 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:06,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:06,338 INFO L93 Difference]: Finished difference Result 407 states and 714 transitions. [2023-12-02 13:30:06,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:06,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-12-02 13:30:06,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:06,341 INFO L225 Difference]: With dead ends: 407 [2023-12-02 13:30:06,342 INFO L226 Difference]: Without dead ends: 407 [2023-12-02 13:30:06,342 INFO L412 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 [2023-12-02 13:30:06,342 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:06,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 93 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2023-12-02 13:30:06,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 407. [2023-12-02 13:30:06,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 314 states have (on average 2.2738853503184715) internal successors, (714), 406 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) [2023-12-02 13:30:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 714 transitions. [2023-12-02 13:30:06,352 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 714 transitions. Word has length 21 [2023-12-02 13:30:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:06,353 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 714 transitions. [2023-12-02 13:30:06,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 714 transitions. [2023-12-02 13:30:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-02 13:30:06,353 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:06,354 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:06,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-02 13:30:06,354 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:06,354 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:06,354 INFO L85 PathProgramCache]: Analyzing trace with hash 66461605, now seen corresponding path program 1 times [2023-12-02 13:30:06,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752824105] [2023-12-02 13:30:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:06,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:06,792 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:06,793 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:06,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752824105] [2023-12-02 13:30:06,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752824105] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:06,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:06,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-02 13:30:06,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32995453] [2023-12-02 13:30:06,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:06,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:30:06,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:06,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:30:06,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:30:06,794 INFO L87 Difference]: Start difference. First operand 407 states and 714 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:07,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:07,105 INFO L93 Difference]: Finished difference Result 470 states and 833 transitions. [2023-12-02 13:30:07,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-02 13:30:07,106 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-12-02 13:30:07,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:07,110 INFO L225 Difference]: With dead ends: 470 [2023-12-02 13:30:07,111 INFO L226 Difference]: Without dead ends: 470 [2023-12-02 13:30:07,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:30:07,111 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 346 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:07,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 10 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:07,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2023-12-02 13:30:07,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 404. [2023-12-02 13:30:07,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 314 states have (on average 2.2643312101910826) internal successors, (711), 403 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) [2023-12-02 13:30:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 711 transitions. [2023-12-02 13:30:07,126 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 711 transitions. Word has length 24 [2023-12-02 13:30:07,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:07,126 INFO L495 AbstractCegarLoop]: Abstraction has 404 states and 711 transitions. [2023-12-02 13:30:07,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 711 transitions. [2023-12-02 13:30:07,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:30:07,127 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:07,127 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:07,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-02 13:30:07,127 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:07,128 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:07,128 INFO L85 PathProgramCache]: Analyzing trace with hash -669831976, now seen corresponding path program 1 times [2023-12-02 13:30:07,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442840033] [2023-12-02 13:30:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:07,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:07,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:07,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:07,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442840033] [2023-12-02 13:30:07,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442840033] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:07,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:07,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-02 13:30:07,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333908968] [2023-12-02 13:30:07,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:07,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:30:07,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:07,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:30:07,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:30:07,616 INFO L87 Difference]: Start difference. First operand 404 states and 711 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:07,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:07,996 INFO L93 Difference]: Finished difference Result 403 states and 710 transitions. [2023-12-02 13:30:07,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:30:07,996 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:30:07,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:07,999 INFO L225 Difference]: With dead ends: 403 [2023-12-02 13:30:07,999 INFO L226 Difference]: Without dead ends: 403 [2023-12-02 13:30:07,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:30:08,000 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 97 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 482 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 482 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:08,000 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 105 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 482 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:30:08,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2023-12-02 13:30:08,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2023-12-02 13:30:08,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 314 states have (on average 2.261146496815287) internal successors, (710), 402 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) [2023-12-02 13:30:08,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 710 transitions. [2023-12-02 13:30:08,010 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 710 transitions. Word has length 28 [2023-12-02 13:30:08,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:08,011 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 710 transitions. [2023-12-02 13:30:08,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:08,011 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 710 transitions. [2023-12-02 13:30:08,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:30:08,012 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:08,012 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:08,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-02 13:30:08,012 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:08,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:08,012 INFO L85 PathProgramCache]: Analyzing trace with hash -669831975, now seen corresponding path program 1 times [2023-12-02 13:30:08,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:08,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226787070] [2023-12-02 13:30:08,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:08,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:08,585 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:08,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226787070] [2023-12-02 13:30:08,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226787070] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:30:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102452987] [2023-12-02 13:30:08,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:08,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:30:08,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:08,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:30:08,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:30:08,587 INFO L87 Difference]: Start difference. First operand 403 states and 710 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:08,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:08,842 INFO L93 Difference]: Finished difference Result 401 states and 708 transitions. [2023-12-02 13:30:08,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:30:08,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:30:08,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:08,844 INFO L225 Difference]: With dead ends: 401 [2023-12-02 13:30:08,844 INFO L226 Difference]: Without dead ends: 401 [2023-12-02 13:30:08,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:30:08,845 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:08,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 98 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-02 13:30:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 401. [2023-12-02 13:30:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 314 states have (on average 2.254777070063694) internal successors, (708), 400 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) [2023-12-02 13:30:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 708 transitions. [2023-12-02 13:30:08,856 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 708 transitions. Word has length 28 [2023-12-02 13:30:08,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:08,856 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 708 transitions. [2023-12-02 13:30:08,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 708 transitions. [2023-12-02 13:30:08,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 13:30:08,858 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:08,858 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:08,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-02 13:30:08,858 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:08,859 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:08,859 INFO L85 PathProgramCache]: Analyzing trace with hash 536587469, now seen corresponding path program 1 times [2023-12-02 13:30:08,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:08,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890706023] [2023-12-02 13:30:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:08,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:08,972 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:08,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890706023] [2023-12-02 13:30:08,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890706023] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:08,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:08,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221553376] [2023-12-02 13:30:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:08,974 INFO L87 Difference]: Start difference. First operand 401 states and 708 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:09,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:09,143 INFO L93 Difference]: Finished difference Result 400 states and 707 transitions. [2023-12-02 13:30:09,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:09,143 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 13:30:09,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:09,146 INFO L225 Difference]: With dead ends: 400 [2023-12-02 13:30:09,146 INFO L226 Difference]: Without dead ends: 400 [2023-12-02 13:30:09,146 INFO L412 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 [2023-12-02 13:30:09,147 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:09,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 83 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-12-02 13:30:09,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2023-12-02 13:30:09,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 314 states have (on average 2.251592356687898) internal successors, (707), 399 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:09,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 707 transitions. [2023-12-02 13:30:09,172 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 707 transitions. Word has length 30 [2023-12-02 13:30:09,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:09,172 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 707 transitions. [2023-12-02 13:30:09,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 707 transitions. [2023-12-02 13:30:09,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-02 13:30:09,173 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:09,173 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:09,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-02 13:30:09,173 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:09,174 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:09,174 INFO L85 PathProgramCache]: Analyzing trace with hash 536587470, now seen corresponding path program 1 times [2023-12-02 13:30:09,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:09,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811793399] [2023-12-02 13:30:09,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:09,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:09,374 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:09,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811793399] [2023-12-02 13:30:09,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811793399] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:09,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:09,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:09,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754426610] [2023-12-02 13:30:09,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:09,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:09,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:09,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:09,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:09,376 INFO L87 Difference]: Start difference. First operand 400 states and 707 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:09,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:09,558 INFO L93 Difference]: Finished difference Result 399 states and 706 transitions. [2023-12-02 13:30:09,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:09,559 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-12-02 13:30:09,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:09,561 INFO L225 Difference]: With dead ends: 399 [2023-12-02 13:30:09,562 INFO L226 Difference]: Without dead ends: 399 [2023-12-02 13:30:09,562 INFO L412 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 [2023-12-02 13:30:09,562 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:09,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 80 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2023-12-02 13:30:09,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2023-12-02 13:30:09,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 314 states have (on average 2.248407643312102) internal successors, (706), 398 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) [2023-12-02 13:30:09,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 706 transitions. [2023-12-02 13:30:09,571 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 706 transitions. Word has length 30 [2023-12-02 13:30:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:09,572 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 706 transitions. [2023-12-02 13:30:09,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:09,572 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 706 transitions. [2023-12-02 13:30:09,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:30:09,573 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:09,573 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:09,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-02 13:30:09,573 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:09,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:09,573 INFO L85 PathProgramCache]: Analyzing trace with hash 784401101, now seen corresponding path program 1 times [2023-12-02 13:30:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:09,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303530860] [2023-12-02 13:30:09,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:09,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:11,165 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:11,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303530860] [2023-12-02 13:30:11,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303530860] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:11,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:11,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-12-02 13:30:11,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649645127] [2023-12-02 13:30:11,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:11,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:30:11,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:11,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:30:11,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=402, Unknown=0, NotChecked=0, Total=462 [2023-12-02 13:30:11,168 INFO L87 Difference]: Start difference. First operand 399 states and 706 transitions. Second operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:12,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:12,105 INFO L93 Difference]: Finished difference Result 398 states and 705 transitions. [2023-12-02 13:30:12,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-02 13:30:12,106 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 13:30:12,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:12,108 INFO L225 Difference]: With dead ends: 398 [2023-12-02 13:30:12,109 INFO L226 Difference]: Without dead ends: 398 [2023-12-02 13:30:12,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2023-12-02 13:30:12,110 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 89 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 924 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:12,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 168 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 924 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 13:30:12,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-02 13:30:12,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2023-12-02 13:30:12,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 314 states have (on average 2.245222929936306) internal successors, (705), 397 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:12,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 705 transitions. [2023-12-02 13:30:12,119 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 705 transitions. Word has length 34 [2023-12-02 13:30:12,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:12,120 INFO L495 AbstractCegarLoop]: Abstraction has 398 states and 705 transitions. [2023-12-02 13:30:12,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:12,120 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 705 transitions. [2023-12-02 13:30:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-02 13:30:12,120 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:12,120 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:12,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-02 13:30:12,121 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:12,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:12,121 INFO L85 PathProgramCache]: Analyzing trace with hash 784401102, now seen corresponding path program 1 times [2023-12-02 13:30:12,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:12,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199262124] [2023-12-02 13:30:12,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:12,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:14,586 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:14,586 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199262124] [2023-12-02 13:30:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199262124] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-02 13:30:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189590258] [2023-12-02 13:30:14,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:14,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-02 13:30:14,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:14,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-02 13:30:14,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:30:14,588 INFO L87 Difference]: Start difference. First operand 398 states and 705 transitions. Second operand has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:15,508 INFO L93 Difference]: Finished difference Result 396 states and 703 transitions. [2023-12-02 13:30:15,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-02 13:30:15,508 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2023-12-02 13:30:15,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:15,511 INFO L225 Difference]: With dead ends: 396 [2023-12-02 13:30:15,511 INFO L226 Difference]: Without dead ends: 396 [2023-12-02 13:30:15,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=143, Invalid=849, Unknown=0, NotChecked=0, Total=992 [2023-12-02 13:30:15,512 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 86 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:15,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 38 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 13:30:15,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-02 13:30:15,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2023-12-02 13:30:15,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 314 states have (on average 2.238853503184713) internal successors, (703), 395 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:15,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 703 transitions. [2023-12-02 13:30:15,522 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 703 transitions. Word has length 34 [2023-12-02 13:30:15,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:15,522 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 703 transitions. [2023-12-02 13:30:15,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:15,523 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 703 transitions. [2023-12-02 13:30:15,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 13:30:15,523 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:15,523 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:15,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-02 13:30:15,524 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:15,524 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:15,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2104762953, now seen corresponding path program 1 times [2023-12-02 13:30:15,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:15,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142042718] [2023-12-02 13:30:15,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:15,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:15,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:15,847 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:15,848 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:15,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142042718] [2023-12-02 13:30:15,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142042718] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:15,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:15,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:15,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997069385] [2023-12-02 13:30:15,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:15,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:15,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:15,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:15,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:15,850 INFO L87 Difference]: Start difference. First operand 396 states and 703 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2023-12-02 13:30:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:16,052 INFO L93 Difference]: Finished difference Result 394 states and 701 transitions. [2023-12-02 13:30:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 36 [2023-12-02 13:30:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:16,055 INFO L225 Difference]: With dead ends: 394 [2023-12-02 13:30:16,055 INFO L226 Difference]: Without dead ends: 394 [2023-12-02 13:30:16,056 INFO L412 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 [2023-12-02 13:30:16,056 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:16,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 45 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:16,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-12-02 13:30:16,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2023-12-02 13:30:16,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 314 states have (on average 2.232484076433121) internal successors, (701), 393 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) [2023-12-02 13:30:16,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 701 transitions. [2023-12-02 13:30:16,071 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 701 transitions. Word has length 36 [2023-12-02 13:30:16,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:16,071 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 701 transitions. [2023-12-02 13:30:16,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2023-12-02 13:30:16,071 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 701 transitions. [2023-12-02 13:30:16,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-12-02 13:30:16,072 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:16,072 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:16,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-02 13:30:16,072 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:16,073 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:16,073 INFO L85 PathProgramCache]: Analyzing trace with hash -2104762954, now seen corresponding path program 1 times [2023-12-02 13:30:16,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:16,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604697299] [2023-12-02 13:30:16,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:16,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:16,241 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:16,242 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:16,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604697299] [2023-12-02 13:30:16,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604697299] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:16,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:16,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:16,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182451873] [2023-12-02 13:30:16,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:16,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:30:16,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:16,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:30:16,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:30:16,244 INFO L87 Difference]: Start difference. First operand 394 states and 701 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2023-12-02 13:30:16,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:16,409 INFO L93 Difference]: Finished difference Result 392 states and 699 transitions. [2023-12-02 13:30:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:16,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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 36 [2023-12-02 13:30:16,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:16,412 INFO L225 Difference]: With dead ends: 392 [2023-12-02 13:30:16,412 INFO L226 Difference]: Without dead ends: 392 [2023-12-02 13:30:16,412 INFO L412 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 [2023-12-02 13:30:16,413 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 52 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:16,413 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 45 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:16,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-02 13:30:16,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2023-12-02 13:30:16,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 314 states have (on average 2.2261146496815285) internal successors, (699), 391 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) [2023-12-02 13:30:16,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 699 transitions. [2023-12-02 13:30:16,424 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 699 transitions. Word has length 36 [2023-12-02 13:30:16,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:16,424 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 699 transitions. [2023-12-02 13:30:16,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 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) [2023-12-02 13:30:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 699 transitions. [2023-12-02 13:30:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:30:16,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:16,425 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:16,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-02 13:30:16,425 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:16,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 252418293, now seen corresponding path program 1 times [2023-12-02 13:30:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:16,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851205490] [2023-12-02 13:30:16,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:16,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:17,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851205490] [2023-12-02 13:30:17,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851205490] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:17,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:17,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-02 13:30:17,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438365626] [2023-12-02 13:30:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:17,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-02 13:30:17,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:17,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-02 13:30:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-02 13:30:17,400 INFO L87 Difference]: Start difference. First operand 392 states and 699 transitions. Second operand has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:17,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:17,852 INFO L93 Difference]: Finished difference Result 424 states and 749 transitions. [2023-12-02 13:30:17,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-02 13:30:17,853 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 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 38 [2023-12-02 13:30:17,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:17,855 INFO L225 Difference]: With dead ends: 424 [2023-12-02 13:30:17,855 INFO L226 Difference]: Without dead ends: 424 [2023-12-02 13:30:17,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=627, Unknown=0, NotChecked=0, Total=756 [2023-12-02 13:30:17,856 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 79 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:17,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 91 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:30:17,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-12-02 13:30:17,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 391. [2023-12-02 13:30:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 314 states have (on average 2.2229299363057327) internal successors, (698), 390 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 698 transitions. [2023-12-02 13:30:17,867 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 698 transitions. Word has length 38 [2023-12-02 13:30:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:17,867 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 698 transitions. [2023-12-02 13:30:17,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.8125) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 698 transitions. [2023-12-02 13:30:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-02 13:30:17,868 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:17,868 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:17,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-02 13:30:17,868 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:17,869 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:17,869 INFO L85 PathProgramCache]: Analyzing trace with hash 252418294, now seen corresponding path program 1 times [2023-12-02 13:30:17,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:17,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152883848] [2023-12-02 13:30:17,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:17,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:19,412 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:19,413 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:19,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152883848] [2023-12-02 13:30:19,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152883848] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:19,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:19,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-02 13:30:19,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683707565] [2023-12-02 13:30:19,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:19,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-02 13:30:19,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:19,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-02 13:30:19,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:30:19,414 INFO L87 Difference]: Start difference. First operand 391 states and 698 transitions. Second operand has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:20,165 INFO L93 Difference]: Finished difference Result 422 states and 747 transitions. [2023-12-02 13:30:20,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-02 13:30:20,166 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 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 38 [2023-12-02 13:30:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:20,168 INFO L225 Difference]: With dead ends: 422 [2023-12-02 13:30:20,169 INFO L226 Difference]: Without dead ends: 422 [2023-12-02 13:30:20,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2023-12-02 13:30:20,169 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 76 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 856 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:20,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 37 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 856 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 13:30:20,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-02 13:30:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 389. [2023-12-02 13:30:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 389 states, 314 states have (on average 2.21656050955414) internal successors, (696), 388 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 696 transitions. [2023-12-02 13:30:20,180 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 696 transitions. Word has length 38 [2023-12-02 13:30:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:20,180 INFO L495 AbstractCegarLoop]: Abstraction has 389 states and 696 transitions. [2023-12-02 13:30:20,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 696 transitions. [2023-12-02 13:30:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 13:30:20,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:20,181 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:20,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-02 13:30:20,181 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:20,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:20,182 INFO L85 PathProgramCache]: Analyzing trace with hash -693714554, now seen corresponding path program 1 times [2023-12-02 13:30:20,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:20,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840139211] [2023-12-02 13:30:20,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:20,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:20,709 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:20,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840139211] [2023-12-02 13:30:20,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840139211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:20,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:20,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-02 13:30:20,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308894262] [2023-12-02 13:30:20,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:20,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:30:20,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:20,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:30:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-02 13:30:20,711 INFO L87 Difference]: Start difference. First operand 389 states and 696 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:20,876 INFO L93 Difference]: Finished difference Result 388 states and 695 transitions. [2023-12-02 13:30:20,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:20,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 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 [2023-12-02 13:30:20,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:20,879 INFO L225 Difference]: With dead ends: 388 [2023-12-02 13:30:20,879 INFO L226 Difference]: Without dead ends: 388 [2023-12-02 13:30:20,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2023-12-02 13:30:20,880 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 144 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:20,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 47 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:20,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-02 13:30:20,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 388. [2023-12-02 13:30:20,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 388 states, 314 states have (on average 2.213375796178344) internal successors, (695), 387 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 695 transitions. [2023-12-02 13:30:20,889 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 695 transitions. Word has length 41 [2023-12-02 13:30:20,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:20,889 INFO L495 AbstractCegarLoop]: Abstraction has 388 states and 695 transitions. [2023-12-02 13:30:20,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:20,889 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 695 transitions. [2023-12-02 13:30:20,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-02 13:30:20,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:20,889 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:20,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-02 13:30:20,890 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:20,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -693714553, now seen corresponding path program 1 times [2023-12-02 13:30:20,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:20,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71250813] [2023-12-02 13:30:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:20,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:21,402 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71250813] [2023-12-02 13:30:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71250813] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-02 13:30:21,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038581052] [2023-12-02 13:30:21,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-02 13:30:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-02 13:30:21,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2023-12-02 13:30:21,403 INFO L87 Difference]: Start difference. First operand 388 states and 695 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:21,578 INFO L93 Difference]: Finished difference Result 387 states and 694 transitions. [2023-12-02 13:30:21,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 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 [2023-12-02 13:30:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:21,581 INFO L225 Difference]: With dead ends: 387 [2023-12-02 13:30:21,581 INFO L226 Difference]: Without dead ends: 387 [2023-12-02 13:30:21,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2023-12-02 13:30:21,582 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 152 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:21,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 24 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:21,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2023-12-02 13:30:21,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 387. [2023-12-02 13:30:21,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 314 states have (on average 2.210191082802548) internal successors, (694), 386 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 694 transitions. [2023-12-02 13:30:21,592 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 694 transitions. Word has length 41 [2023-12-02 13:30:21,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:21,592 INFO L495 AbstractCegarLoop]: Abstraction has 387 states and 694 transitions. [2023-12-02 13:30:21,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 694 transitions. [2023-12-02 13:30:21,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 13:30:21,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:21,593 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:21,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-02 13:30:21,593 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:21,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:21,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675416, now seen corresponding path program 1 times [2023-12-02 13:30:21,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:21,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106820939] [2023-12-02 13:30:21,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:21,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:21,763 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:21,764 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:21,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106820939] [2023-12-02 13:30:21,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106820939] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:21,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:21,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:21,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470237059] [2023-12-02 13:30:21,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:21,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:21,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:21,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:21,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:21,766 INFO L87 Difference]: Start difference. First operand 387 states and 694 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:21,876 INFO L93 Difference]: Finished difference Result 375 states and 666 transitions. [2023-12-02 13:30:21,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:21,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 46 [2023-12-02 13:30:21,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:21,879 INFO L225 Difference]: With dead ends: 375 [2023-12-02 13:30:21,879 INFO L226 Difference]: Without dead ends: 375 [2023-12-02 13:30:21,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:21,880 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:21,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 38 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:21,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-12-02 13:30:21,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 369. [2023-12-02 13:30:21,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 304 states have (on average 2.1776315789473686) internal successors, (662), 368 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 662 transitions. [2023-12-02 13:30:21,893 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 662 transitions. Word has length 46 [2023-12-02 13:30:21,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:21,894 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 662 transitions. [2023-12-02 13:30:21,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:21,894 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 662 transitions. [2023-12-02 13:30:21,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-02 13:30:21,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:21,895 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:21,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-02 13:30:21,896 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:21,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:21,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1007675415, now seen corresponding path program 1 times [2023-12-02 13:30:21,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:21,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824589954] [2023-12-02 13:30:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:21,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:22,107 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:22,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824589954] [2023-12-02 13:30:22,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824589954] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:22,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:22,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:30:22,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909374284] [2023-12-02 13:30:22,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:22,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:22,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:22,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:22,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:22,109 INFO L87 Difference]: Start difference. First operand 369 states and 662 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:22,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:22,204 INFO L93 Difference]: Finished difference Result 339 states and 598 transitions. [2023-12-02 13:30:22,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:22,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 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 46 [2023-12-02 13:30:22,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:22,207 INFO L225 Difference]: With dead ends: 339 [2023-12-02 13:30:22,207 INFO L226 Difference]: Without dead ends: 339 [2023-12-02 13:30:22,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:22,207 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 17 mSDsluCounter, 8 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.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:22,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 38 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:22,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-12-02 13:30:22,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2023-12-02 13:30:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 286 states have (on average 2.090909090909091) internal successors, (598), 338 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:22,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 598 transitions. [2023-12-02 13:30:22,216 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 598 transitions. Word has length 46 [2023-12-02 13:30:22,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:22,216 INFO L495 AbstractCegarLoop]: Abstraction has 339 states and 598 transitions. [2023-12-02 13:30:22,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:22,217 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 598 transitions. [2023-12-02 13:30:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 13:30:22,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:22,217 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:22,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-02 13:30:22,217 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:22,218 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:22,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1292074790, now seen corresponding path program 1 times [2023-12-02 13:30:22,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:22,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504427374] [2023-12-02 13:30:22,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:22,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:24,739 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:24,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504427374] [2023-12-02 13:30:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504427374] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:24,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2023-12-02 13:30:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682984187] [2023-12-02 13:30:24,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:24,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-02 13:30:24,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:24,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-02 13:30:24,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2023-12-02 13:30:24,741 INFO L87 Difference]: Start difference. First operand 339 states and 598 transitions. Second operand has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 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) [2023-12-02 13:30:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:26,162 INFO L93 Difference]: Finished difference Result 404 states and 709 transitions. [2023-12-02 13:30:26,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 13:30:26,163 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 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 47 [2023-12-02 13:30:26,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:26,164 INFO L225 Difference]: With dead ends: 404 [2023-12-02 13:30:26,164 INFO L226 Difference]: Without dead ends: 404 [2023-12-02 13:30:26,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=205, Invalid=1601, Unknown=0, NotChecked=0, Total=1806 [2023-12-02 13:30:26,166 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1272 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:26,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 31 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1272 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-02 13:30:26,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-02 13:30:26,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 353. [2023-12-02 13:30:26,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 300 states have (on average 2.14) internal successors, (642), 352 states have internal predecessors, (642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 642 transitions. [2023-12-02 13:30:26,174 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 642 transitions. Word has length 47 [2023-12-02 13:30:26,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:26,174 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 642 transitions. [2023-12-02 13:30:26,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.52) internal successors, (38), 25 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) [2023-12-02 13:30:26,174 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 642 transitions. [2023-12-02 13:30:26,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-02 13:30:26,175 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:26,175 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:26,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-02 13:30:26,175 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:26,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:26,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1292074789, now seen corresponding path program 1 times [2023-12-02 13:30:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182260211] [2023-12-02 13:30:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:26,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:26,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:28,138 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:28,138 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:28,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182260211] [2023-12-02 13:30:28,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182260211] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:28,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:28,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2023-12-02 13:30:28,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333507615] [2023-12-02 13:30:28,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:28,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-12-02 13:30:28,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:28,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-12-02 13:30:28,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:30:28,140 INFO L87 Difference]: Start difference. First operand 353 states and 642 transitions. Second operand has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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) [2023-12-02 13:30:29,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:29,197 INFO L93 Difference]: Finished difference Result 392 states and 702 transitions. [2023-12-02 13:30:29,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-02 13:30:29,198 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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 47 [2023-12-02 13:30:29,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:29,201 INFO L225 Difference]: With dead ends: 392 [2023-12-02 13:30:29,201 INFO L226 Difference]: Without dead ends: 392 [2023-12-02 13:30:29,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=1513, Unknown=0, NotChecked=0, Total=1722 [2023-12-02 13:30:29,202 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 133 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 1021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:29,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 97 Invalid, 1021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-02 13:30:29,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2023-12-02 13:30:29,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 350. [2023-12-02 13:30:29,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 297 states have (on average 2.1414141414141414) internal successors, (636), 349 states have internal predecessors, (636), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:29,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 636 transitions. [2023-12-02 13:30:29,210 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 636 transitions. Word has length 47 [2023-12-02 13:30:29,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:29,210 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 636 transitions. [2023-12-02 13:30:29,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 24 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) [2023-12-02 13:30:29,211 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 636 transitions. [2023-12-02 13:30:29,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 13:30:29,211 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:29,211 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:29,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-02 13:30:29,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:29,212 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:29,212 INFO L85 PathProgramCache]: Analyzing trace with hash -2008411799, now seen corresponding path program 1 times [2023-12-02 13:30:29,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:29,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521298013] [2023-12-02 13:30:29,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:29,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:29,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:29,951 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:29,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521298013] [2023-12-02 13:30:29,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521298013] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:29,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:29,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-02 13:30:29,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132406875] [2023-12-02 13:30:29,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:29,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-02 13:30:29,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:29,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-02 13:30:29,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2023-12-02 13:30:29,953 INFO L87 Difference]: Start difference. First operand 350 states and 636 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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) [2023-12-02 13:30:30,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:30,201 INFO L93 Difference]: Finished difference Result 331 states and 596 transitions. [2023-12-02 13:30:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:30:30,202 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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 48 [2023-12-02 13:30:30,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:30,203 INFO L225 Difference]: With dead ends: 331 [2023-12-02 13:30:30,203 INFO L226 Difference]: Without dead ends: 331 [2023-12-02 13:30:30,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2023-12-02 13:30:30,204 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 386 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:30,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 5 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:30:30,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2023-12-02 13:30:30,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 328. [2023-12-02 13:30:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 283 states have (on average 2.088339222614841) internal successors, (591), 327 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 591 transitions. [2023-12-02 13:30:30,211 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 591 transitions. Word has length 48 [2023-12-02 13:30:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:30,212 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 591 transitions. [2023-12-02 13:30:30,212 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 11 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) [2023-12-02 13:30:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 591 transitions. [2023-12-02 13:30:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 13:30:30,212 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:30,212 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:30,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-02 13:30:30,213 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:30,213 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1399612103, now seen corresponding path program 1 times [2023-12-02 13:30:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766734930] [2023-12-02 13:30:30,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:30,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:30,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:35,125 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:35,125 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:35,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766734930] [2023-12-02 13:30:35,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766734930] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:35,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:35,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2023-12-02 13:30:35,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20164604] [2023-12-02 13:30:35,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:35,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-12-02 13:30:35,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:35,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-12-02 13:30:35,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2023-12-02 13:30:35,128 INFO L87 Difference]: Start difference. First operand 328 states and 591 transitions. Second operand has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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) [2023-12-02 13:30:38,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:38,300 INFO L93 Difference]: Finished difference Result 388 states and 693 transitions. [2023-12-02 13:30:38,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-02 13:30:38,301 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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 48 [2023-12-02 13:30:38,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:38,303 INFO L225 Difference]: With dead ends: 388 [2023-12-02 13:30:38,303 INFO L226 Difference]: Without dead ends: 388 [2023-12-02 13:30:38,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=219, Invalid=2231, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 13:30:38,304 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 187 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1430 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:38,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 29 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1430 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:30:38,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2023-12-02 13:30:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 338. [2023-12-02 13:30:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 293 states have (on average 2.1296928327645053) internal successors, (624), 337 states have internal predecessors, (624), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:38,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 624 transitions. [2023-12-02 13:30:38,310 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 624 transitions. Word has length 48 [2023-12-02 13:30:38,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:38,311 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 624 transitions. [2023-12-02 13:30:38,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 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) [2023-12-02 13:30:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 624 transitions. [2023-12-02 13:30:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-02 13:30:38,311 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:38,311 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:38,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-02 13:30:38,312 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:38,312 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:38,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1399612102, now seen corresponding path program 1 times [2023-12-02 13:30:38,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:38,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027753184] [2023-12-02 13:30:38,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:38,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:42,645 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-12-02 13:30:42,645 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027753184] [2023-12-02 13:30:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027753184] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-12-02 13:30:42,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207826373] [2023-12-02 13:30:42,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:42,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-02 13:30:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:42,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-02 13:30:42,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=694, Unknown=0, NotChecked=0, Total=756 [2023-12-02 13:30:42,647 INFO L87 Difference]: Start difference. First operand 338 states and 624 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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) [2023-12-02 13:30:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:45,582 INFO L93 Difference]: Finished difference Result 428 states and 767 transitions. [2023-12-02 13:30:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-02 13:30:45,582 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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 48 [2023-12-02 13:30:45,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:45,584 INFO L225 Difference]: With dead ends: 428 [2023-12-02 13:30:45,584 INFO L226 Difference]: Without dead ends: 428 [2023-12-02 13:30:45,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=226, Invalid=2224, Unknown=0, NotChecked=0, Total=2450 [2023-12-02 13:30:45,586 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 188 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 1569 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 1614 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1569 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:45,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 73 Invalid, 1614 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1569 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-02 13:30:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-12-02 13:30:45,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 334. [2023-12-02 13:30:45,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 334 states, 289 states have (on average 2.083044982698962) internal successors, (602), 333 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:45,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 602 transitions. [2023-12-02 13:30:45,593 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 602 transitions. Word has length 48 [2023-12-02 13:30:45,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:45,593 INFO L495 AbstractCegarLoop]: Abstraction has 334 states and 602 transitions. [2023-12-02 13:30:45,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 27 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) [2023-12-02 13:30:45,593 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 602 transitions. [2023-12-02 13:30:45,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-02 13:30:45,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:45,594 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-12-02 13:30:45,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-02 13:30:45,594 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 87 more)] === [2023-12-02 13:30:45,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:45,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2131222892, now seen corresponding path program 1 times [2023-12-02 13:30:45,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:45,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264128979] [2023-12-02 13:30:45,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:45,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:30:45,733 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-02 13:30:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-02 13:30:45,977 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2023-12-02 13:30:45,977 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-02 13:30:45,978 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 90 remaining) [2023-12-02 13:30:45,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 90 remaining) [2023-12-02 13:30:45,979 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 90 remaining) [2023-12-02 13:30:45,980 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 90 remaining) [2023-12-02 13:30:45,981 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 90 remaining) [2023-12-02 13:30:45,982 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 90 remaining) [2023-12-02 13:30:45,983 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 90 remaining) [2023-12-02 13:30:45,984 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 90 remaining) [2023-12-02 13:30:45,985 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 90 remaining) [2023-12-02 13:30:45,986 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK (24 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 90 remaining) [2023-12-02 13:30:45,987 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 90 remaining) [2023-12-02 13:30:45,988 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 90 remaining) [2023-12-02 13:30:45,989 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 90 remaining) [2023-12-02 13:30:45,990 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 90 remaining) [2023-12-02 13:30:45,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-02 13:30:45,992 INFO L445 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, 1, 1] [2023-12-02 13:30:45,997 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-12-02 13:30:45,997 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-12-02 13:30:46,039 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-02 13:30:46,043 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated [2023-12-02 13:30:46,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 01:30:46 BasicIcfg [2023-12-02 13:30:46,053 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-02 13:30:46,053 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-12-02 13:30:46,054 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-12-02 13:30:46,054 INFO L274 PluginConnector]: Witness Printer initialized [2023-12-02 13:30:46,054 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:30:00" (3/4) ... [2023-12-02 13:30:46,055 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-12-02 13:30:46,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not [2023-12-02 13:30:46,077 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated [2023-12-02 13:30:46,115 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/witness.graphml [2023-12-02 13:30:46,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-12-02 13:30:46,116 INFO L158 Benchmark]: Toolchain (without parser) took 47280.30ms. Allocated memory was 142.6MB in the beginning and 664.8MB in the end (delta: 522.2MB). Free memory was 96.2MB in the beginning and 533.9MB in the end (delta: -437.7MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,116 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 142.6MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-12-02 13:30:46,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 643.08ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 56.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.29ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 52.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,117 INFO L158 Benchmark]: Boogie Preprocessor took 44.03ms. Allocated memory is still 142.6MB. Free memory was 52.9MB in the beginning and 50.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,118 INFO L158 Benchmark]: RCFGBuilder took 1041.35ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 50.1MB in the beginning and 114.0MB in the end (delta: -63.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,118 INFO L158 Benchmark]: TraceAbstraction took 45418.83ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 112.9MB in the beginning and 543.3MB in the end (delta: -430.4MB). Peak memory consumption was 383.3MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,118 INFO L158 Benchmark]: Witness Printer took 61.56ms. Allocated memory is still 664.8MB. Free memory was 543.3MB in the beginning and 533.9MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-12-02 13:30:46,120 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.20ms. Allocated memory is still 142.6MB. Free memory is still 114.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 643.08ms. Allocated memory is still 142.6MB. Free memory was 96.1MB in the beginning and 56.3MB in the end (delta: 39.8MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.29ms. Allocated memory is still 142.6MB. Free memory was 56.3MB in the beginning and 52.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.03ms. Allocated memory is still 142.6MB. Free memory was 52.9MB in the beginning and 50.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1041.35ms. Allocated memory was 142.6MB in the beginning and 172.0MB in the end (delta: 29.4MB). Free memory was 50.1MB in the beginning and 114.0MB in the end (delta: -63.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 45418.83ms. Allocated memory was 172.0MB in the beginning and 664.8MB in the end (delta: 492.8MB). Free memory was 112.9MB in the beginning and 543.3MB in the end (delta: -430.4MB). Peak memory consumption was 383.3MB. Max. memory is 16.1GB. * Witness Printer took 61.56ms. Allocated memory is still 664.8MB. Free memory was 543.3MB in the beginning and 533.9MB 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.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expected StepInfo for loop construct to contain Condition, but it did not - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre49 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 TRUE 0 i < 10 [L1254] 0 i++ 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 TRUE 0 i < 10 [L1254] 0 i++ 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 TRUE 0 i < 10 [L1254] 0 i++ 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 TRUE 0 i < 10 [L1254] 0 i++ 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 TRUE 0 i < 10 [L1254] 0 i++ 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 FALSE 0 !(i < 10) [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={6: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={-4: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 [list={6:0}, list={6:0}, mutex={1:0}, node={-4:0}, node={-4: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={9: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={-1: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 [list={9:0}, list={9:0}, mutex={1:0}, node={-1:0}, node={-1: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={-2: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 [list={9:0}, list={9:0}, mutex={1:0}, node={-2:0}, node={-2:0}, slot={2:0}, temp={-1: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 [list={9:0}, list={9:0}, mutex={1:0}, node={-2:0}, node={-2:0}, slot={2:0}, temp={-2: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=1, k=1, mutex={1:0}, p={-2:0}, slot={2:0}, t1={11:0}] [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={-2:0}, mutex={1:0}, p={-3: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: -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, 156 locations, 90 error locations. Started 1 CEGAR loops. OverallTime: 45.2s, OverallIterations: 32, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2750 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2750 mSDsluCounter, 2676 SdHoareTripleChecker+Invalid, 9.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1776 mSDsCounter, 556 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 13477 IncrementalHoareTripleChecker+Invalid, 14033 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 556 mSolverCounterUnsat, 900 mSDtfsCounter, 13477 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1845 ImplicationChecksByTransitivity, 10.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=499occurred in iteration=2, InterpolantAutomatonStates: 280, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 453 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 972 NumberOfCodeBlocks, 972 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 899 ConstructedInterpolants, 0 QuantifiedInterpolants, 15364 SizeOfPredicates, 0 NumberOfNonLiveVariables, 163 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 35 InterpolantComputations, 29 PerfectInterpolantSequences, 1495/1528 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! [2023-12-02 13:30:46,147 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_eb2f163c-dc69-4060-b567-dfa39ecbb8e7/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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)