./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-dietlibc/strlcpy.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-dietlibc/strlcpy.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2 --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 64bit --witnessprinter.graph.data.programhash c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-11-02 12:30:41,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-02 12:30:41,123 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2024-11-02 12:30:41,131 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-02 12:30:41,134 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-02 12:30:41,168 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-02 12:30:41,169 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-02 12:30:41,170 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-02 12:30:41,171 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-02 12:30:41,172 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-02 12:30:41,173 INFO L153 SettingsManager]: * User list type=DISABLED [2024-11-02 12:30:41,173 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2024-11-02 12:30:41,173 INFO L153 SettingsManager]: * Explicit value domain=true [2024-11-02 12:30:41,174 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2024-11-02 12:30:41,176 INFO L153 SettingsManager]: * Octagon Domain=false [2024-11-02 12:30:41,177 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2024-11-02 12:30:41,177 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2024-11-02 12:30:41,177 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2024-11-02 12:30:41,178 INFO L153 SettingsManager]: * Interval Domain=false [2024-11-02 12:30:41,178 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2024-11-02 12:30:41,179 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2024-11-02 12:30:41,179 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2024-11-02 12:30:41,180 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-02 12:30:41,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-02 12:30:41,185 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-02 12:30:41,185 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-02 12:30:41,186 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-02 12:30:41,186 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-02 12:30:41,186 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-02 12:30:41,187 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-02 12:30:41,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-02 12:30:41,189 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-02 12:30:41,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-02 12:30:41,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-02 12:30:41,190 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-02 12:30:41,190 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-02 12:30:41,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-02 12:30:41,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-02 12:30:41,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:30:41,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-02 12:30:41,194 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-02 12:30:41,197 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2024-11-02 12:30:41,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-02 12:30:41,197 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-02 12:30:41,198 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2024-11-02 12:30:41,198 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-02 12:30:41,198 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_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/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_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2292e98244edafad4d7dc9607780b552ab07213ed34494d4f4d17ad8279c4d0 [2024-11-02 12:30:41,521 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-02 12:30:41,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-02 12:30:41,559 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-02 12:30:41,560 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-02 12:30:41,562 INFO L274 PluginConnector]: CDTParser initialized [2024-11-02 12:30:41,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/../../sv-benchmarks/c/termination-dietlibc/strlcpy.i Unable to find full path for "g++" [2024-11-02 12:30:43,683 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-02 12:30:43,950 INFO L384 CDTParser]: Found 1 translation units. [2024-11-02 12:30:43,952 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/sv-benchmarks/c/termination-dietlibc/strlcpy.i [2024-11-02 12:30:43,967 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/data/677c8446f/1b285bf00de248df8e0081ad7786f7cd/FLAG27b3cec09 [2024-11-02 12:30:43,981 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/data/677c8446f/1b285bf00de248df8e0081ad7786f7cd [2024-11-02 12:30:43,984 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-02 12:30:43,985 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-02 12:30:43,987 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:43,987 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-02 12:30:43,997 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-02 12:30:43,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:43" (1/1) ... [2024-11-02 12:30:43,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690d0d14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:43, skipping insertion in model container [2024-11-02 12:30:43,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 12:30:43" (1/1) ... [2024-11-02 12:30:44,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-02 12:30:44,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:44,441 INFO L200 MainTranslator]: Completed pre-run [2024-11-02 12:30:44,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-02 12:30:44,519 INFO L204 MainTranslator]: Completed translation [2024-11-02 12:30:44,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44 WrapperNode [2024-11-02 12:30:44,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-02 12:30:44,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:44,520 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-02 12:30:44,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-02 12:30:44,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,540 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,568 INFO L138 Inliner]: procedures = 113, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 92 [2024-11-02 12:30:44,568 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-02 12:30:44,569 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-02 12:30:44,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-02 12:30:44,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-02 12:30:44,579 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,609 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,615 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-02 12:30:44,616 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-02 12:30:44,616 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-02 12:30:44,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-02 12:30:44,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (1/1) ... [2024-11-02 12:30:44,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2024-11-02 12:30:44,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:44,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2024-11-02 12:30:44,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2024-11-02 12:30:44,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-02 12:30:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-02 12:30:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-02 12:30:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-02 12:30:44,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-02 12:30:44,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-02 12:30:44,787 INFO L238 CfgBuilder]: Building ICFG [2024-11-02 12:30:44,791 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-02 12:30:45,079 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-02 12:30:45,080 INFO L287 CfgBuilder]: Performing block encoding [2024-11-02 12:30:45,168 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-02 12:30:45,168 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-02 12:30:45,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:45 BoogieIcfgContainer [2024-11-02 12:30:45,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-02 12:30:45,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-02 12:30:45,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-02 12:30:45,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-02 12:30:45,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 12:30:43" (1/3) ... [2024-11-02 12:30:45,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1712aac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:45, skipping insertion in model container [2024-11-02 12:30:45,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 12:30:44" (2/3) ... [2024-11-02 12:30:45,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1712aac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 12:30:45, skipping insertion in model container [2024-11-02 12:30:45,178 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:45" (3/3) ... [2024-11-02 12:30:45,179 INFO L112 eAbstractionObserver]: Analyzing ICFG strlcpy.i [2024-11-02 12:30:45,198 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-02 12:30:45,199 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-11-02 12:30:45,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-02 12:30:45,247 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2c3dd0fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-02 12:30:45,248 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2024-11-02 12:30:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 29 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:45,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:30:45,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:45,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:30:45,258 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:45,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:45,263 INFO L85 PathProgramCache]: Analyzing trace with hash 118446, now seen corresponding path program 1 times [2024-11-02 12:30:45,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:45,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059992232] [2024-11-02 12:30:45,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:45,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:45,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:45,507 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:45,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059992232] [2024-11-02 12:30:45,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059992232] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:45,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:45,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-02 12:30:45,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508368715] [2024-11-02 12:30:45,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:45,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:45,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:45,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:45,565 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 29 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) Second operand has 3 states, 2 states have (on average 1.5) 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) [2024-11-02 12:30:45,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:45,635 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-02 12:30:45,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:45,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) 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 [2024-11-02 12:30:45,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:45,646 INFO L225 Difference]: With dead ends: 31 [2024-11-02 12:30:45,646 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 12:30:45,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:45,652 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:45,653 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:45,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 12:30:45,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-02 12:30:45,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:45,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-02 12:30:45,693 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 3 [2024-11-02 12:30:45,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:45,693 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-02 12:30:45,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) 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) [2024-11-02 12:30:45,694 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-02 12:30:45,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:30:45,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:45,694 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:30:45,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-02 12:30:45,696 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:45,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:45,697 INFO L85 PathProgramCache]: Analyzing trace with hash 118429, now seen corresponding path program 1 times [2024-11-02 12:30:45,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:45,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336401964] [2024-11-02 12:30:45,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:45,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:45,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:45,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:45,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:45,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336401964] [2024-11-02 12:30:45,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336401964] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:45,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:45,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:45,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480455590] [2024-11-02 12:30:45,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:45,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-02 12:30:45,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:45,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-02 12:30:45,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:45,849 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-02 12:30:45,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:45,897 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2024-11-02 12:30:45,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-02 12:30:45,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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 [2024-11-02 12:30:45,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:45,899 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:30:45,899 INFO L226 Difference]: Without dead ends: 28 [2024-11-02 12:30:45,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-02 12:30:45,901 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 1 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:45,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 44 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:45,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-02 12:30:45,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-02 12:30:45,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:45,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2024-11-02 12:30:45,909 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 3 [2024-11-02 12:30:45,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:45,909 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2024-11-02 12:30:45,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 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) [2024-11-02 12:30:45,910 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2024-11-02 12:30:45,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-02 12:30:45,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:45,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-02 12:30:45,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-02 12:30:45,911 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:45,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:45,914 INFO L85 PathProgramCache]: Analyzing trace with hash 118430, now seen corresponding path program 1 times [2024-11-02 12:30:45,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:45,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558207016] [2024-11-02 12:30:45,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:45,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:46,205 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:46,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558207016] [2024-11-02 12:30:46,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558207016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:46,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:46,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:46,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731522146] [2024-11-02 12:30:46,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:46,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:46,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:46,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:46,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:46,209 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-02 12:30:46,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:46,242 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2024-11-02 12:30:46,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:46,244 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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 [2024-11-02 12:30:46,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:46,245 INFO L225 Difference]: With dead ends: 27 [2024-11-02 12:30:46,245 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 12:30:46,245 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:46,246 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:46,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:46,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 12:30:46,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-02 12:30:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 26 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:46,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2024-11-02 12:30:46,253 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 3 [2024-11-02 12:30:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:46,254 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2024-11-02 12:30:46,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 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) [2024-11-02 12:30:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2024-11-02 12:30:46,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-02 12:30:46,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:46,254 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-02 12:30:46,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-02 12:30:46,255 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:46,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:46,256 INFO L85 PathProgramCache]: Analyzing trace with hash 113893437, now seen corresponding path program 1 times [2024-11-02 12:30:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:46,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788302787] [2024-11-02 12:30:46,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:46,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:46,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:46,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:46,399 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:46,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788302787] [2024-11-02 12:30:46,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788302787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:46,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:46,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-02 12:30:46,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19960728] [2024-11-02 12:30:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:46,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:46,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:46,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:46,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:46,402 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:46,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:46,472 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-02 12:30:46,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:46,475 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-02 12:30:46,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:46,476 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:30:46,476 INFO L226 Difference]: Without dead ends: 27 [2024-11-02 12:30:46,476 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:46,477 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:46,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:46,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-11-02 12:30:46,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-11-02 12:30:46,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 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) [2024-11-02 12:30:46,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-02 12:30:46,486 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 5 [2024-11-02 12:30:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:46,487 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-02 12:30:46,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-02 12:30:46,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:30:46,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:46,488 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:46,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-02 12:30:46,489 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:46,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:46,490 INFO L85 PathProgramCache]: Analyzing trace with hash 2079823598, now seen corresponding path program 1 times [2024-11-02 12:30:46,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:46,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826985873] [2024-11-02 12:30:46,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:46,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:46,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:46,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:46,887 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:46,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826985873] [2024-11-02 12:30:46,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826985873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:46,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:46,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:46,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742665910] [2024-11-02 12:30:46,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:46,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:46,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:46,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:46,891 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:46,995 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-02 12:30:46,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:30:46,996 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 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 [2024-11-02 12:30:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:46,997 INFO L225 Difference]: With dead ends: 36 [2024-11-02 12:30:46,997 INFO L226 Difference]: Without dead ends: 36 [2024-11-02 12:30:46,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:46,998 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:46,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 82 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:46,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-02 12:30:47,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2024-11-02 12:30:47,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.75) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2024-11-02 12:30:47,002 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2024-11-02 12:30:47,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:47,003 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2024-11-02 12:30:47,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,003 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2024-11-02 12:30:47,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-02 12:30:47,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:47,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:47,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-02 12:30:47,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:47,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:47,005 INFO L85 PathProgramCache]: Analyzing trace with hash 2079823597, now seen corresponding path program 1 times [2024-11-02 12:30:47,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:47,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114613698] [2024-11-02 12:30:47,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:47,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:47,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:47,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:47,103 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:47,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114613698] [2024-11-02 12:30:47,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114613698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:47,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:47,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834786974] [2024-11-02 12:30:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:47,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:47,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:47,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:47,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:47,105 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:47,180 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2024-11-02 12:30:47,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:47,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 [2024-11-02 12:30:47,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:47,185 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:30:47,185 INFO L226 Difference]: Without dead ends: 28 [2024-11-02 12:30:47,185 INFO L431 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 [2024-11-02 12:30:47,186 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 22 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:47,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:47,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-02 12:30:47,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-02 12:30:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.65) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2024-11-02 12:30:47,192 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 7 [2024-11-02 12:30:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:47,192 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2024-11-02 12:30:47,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,193 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2024-11-02 12:30:47,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:30:47,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:47,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:47,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-02 12:30:47,194 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:47,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:47,195 INFO L85 PathProgramCache]: Analyzing trace with hash 50879398, now seen corresponding path program 1 times [2024-11-02 12:30:47,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:47,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014775739] [2024-11-02 12:30:47,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:47,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:47,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:47,462 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:47,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014775739] [2024-11-02 12:30:47,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014775739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:47,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:47,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:47,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711917301] [2024-11-02 12:30:47,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:47,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:30:47,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:47,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:30:47,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:47,464 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:47,519 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-11-02 12:30:47,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:30:47,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 12:30:47,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:47,521 INFO L225 Difference]: With dead ends: 27 [2024-11-02 12:30:47,521 INFO L226 Difference]: Without dead ends: 25 [2024-11-02 12:30:47,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:47,525 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:47,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 51 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:47,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-02 12:30:47,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-11-02 12:30:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.6111111111111112) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-02 12:30:47,533 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2024-11-02 12:30:47,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:47,533 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-02 12:30:47,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,534 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-02 12:30:47,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:30:47,536 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:47,536 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:47,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-02 12:30:47,537 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:47,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:47,538 INFO L85 PathProgramCache]: Analyzing trace with hash 50853300, now seen corresponding path program 1 times [2024-11-02 12:30:47,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209464752] [2024-11-02 12:30:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:47,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:47,661 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:47,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209464752] [2024-11-02 12:30:47,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209464752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:47,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:47,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:47,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830064135] [2024-11-02 12:30:47,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:47,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:47,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:47,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:47,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:47,664 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:47,717 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-11-02 12:30:47,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:47,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 12:30:47,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:47,718 INFO L225 Difference]: With dead ends: 29 [2024-11-02 12:30:47,718 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 12:30:47,719 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:47,719 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:47,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 30 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:47,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 12:30:47,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-11-02 12:30:47,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-02 12:30:47,728 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 8 [2024-11-02 12:30:47,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:47,728 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-02 12:30:47,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-02 12:30:47,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:30:47,730 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:47,731 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:47,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-02 12:30:47,731 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:47,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:47,732 INFO L85 PathProgramCache]: Analyzing trace with hash 50853301, now seen corresponding path program 1 times [2024-11-02 12:30:47,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:47,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248296438] [2024-11-02 12:30:47,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:47,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:47,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:47,930 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:47,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248296438] [2024-11-02 12:30:47,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248296438] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:47,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:47,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:47,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667972527] [2024-11-02 12:30:47,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:47,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:30:47,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:47,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:30:47,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:47,936 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:47,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:47,991 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-02 12:30:47,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:30:47,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 12:30:47,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:47,993 INFO L225 Difference]: With dead ends: 32 [2024-11-02 12:30:47,993 INFO L226 Difference]: Without dead ends: 32 [2024-11-02 12:30:47,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:47,994 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:47,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:47,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-02 12:30:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-02 12:30:48,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 21 states have (on average 1.5238095238095237) internal successors, (32), 26 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) [2024-11-02 12:30:48,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-02 12:30:48,004 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2024-11-02 12:30:48,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:48,005 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-02 12:30:48,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,006 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-02 12:30:48,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:30:48,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:48,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:48,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-02 12:30:48,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:48,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:48,009 INFO L85 PathProgramCache]: Analyzing trace with hash 50022070, now seen corresponding path program 1 times [2024-11-02 12:30:48,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:48,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022222404] [2024-11-02 12:30:48,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:48,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:48,147 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:48,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022222404] [2024-11-02 12:30:48,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022222404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:48,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:48,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:48,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922637314] [2024-11-02 12:30:48,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:48,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:48,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:48,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:48,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:48,150 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:48,253 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2024-11-02 12:30:48,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:48,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 12:30:48,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:48,254 INFO L225 Difference]: With dead ends: 31 [2024-11-02 12:30:48,255 INFO L226 Difference]: Without dead ends: 31 [2024-11-02 12:30:48,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-02 12:30:48,256 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:48,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-02 12:30:48,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2024-11-02 12:30:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-02 12:30:48,259 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 8 [2024-11-02 12:30:48,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:48,259 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-02 12:30:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-02 12:30:48,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-02 12:30:48,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:48,261 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:48,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-02 12:30:48,261 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:48,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:48,262 INFO L85 PathProgramCache]: Analyzing trace with hash 50022071, now seen corresponding path program 1 times [2024-11-02 12:30:48,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:48,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987822170] [2024-11-02 12:30:48,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:48,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:48,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:48,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:48,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:48,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987822170] [2024-11-02 12:30:48,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987822170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:48,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:48,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:48,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358609986] [2024-11-02 12:30:48,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:48,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-02 12:30:48,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:48,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-02 12:30:48,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:48,510 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:48,591 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-11-02 12:30:48,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-02 12:30:48,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-02 12:30:48,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:48,593 INFO L225 Difference]: With dead ends: 32 [2024-11-02 12:30:48,593 INFO L226 Difference]: Without dead ends: 32 [2024-11-02 12:30:48,593 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-02 12:30:48,594 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:48,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 54 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-11-02 12:30:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2024-11-02 12:30:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 26 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) [2024-11-02 12:30:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-11-02 12:30:48,597 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 8 [2024-11-02 12:30:48,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:48,598 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-11-02 12:30:48,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,599 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-11-02 12:30:48,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-02 12:30:48,600 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:48,600 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:48,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-02 12:30:48,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:48,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:48,601 INFO L85 PathProgramCache]: Analyzing trace with hash 1576457424, now seen corresponding path program 1 times [2024-11-02 12:30:48,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:48,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837491512] [2024-11-02 12:30:48,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:48,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:48,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:48,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:48,674 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:48,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837491512] [2024-11-02 12:30:48,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837491512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:48,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:48,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-02 12:30:48,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413646822] [2024-11-02 12:30:48,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:48,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:48,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:48,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:48,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:48,676 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-02 12:30:48,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:48,725 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2024-11-02 12:30:48,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:48,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-02 12:30:48,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:48,726 INFO L225 Difference]: With dead ends: 26 [2024-11-02 12:30:48,726 INFO L226 Difference]: Without dead ends: 26 [2024-11-02 12:30:48,727 INFO L431 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 [2024-11-02 12:30:48,727 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:48,728 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 24 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:48,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-02 12:30:48,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-02 12:30:48,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2024-11-02 12:30:48,730 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 9 [2024-11-02 12:30:48,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:48,731 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2024-11-02 12:30:48,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 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) [2024-11-02 12:30:48,731 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2024-11-02 12:30:48,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-02 12:30:48,732 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:48,732 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:48,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-02 12:30:48,732 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:48,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1576457425, now seen corresponding path program 1 times [2024-11-02 12:30:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:48,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932520043] [2024-11-02 12:30:48,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:48,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:48,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:48,797 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:48,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932520043] [2024-11-02 12:30:48,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932520043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:48,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:48,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:48,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227545293] [2024-11-02 12:30:48,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:48,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-02 12:30:48,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:48,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-02 12:30:48,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:48,800 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-11-02 12:30:48,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:48,816 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2024-11-02 12:30:48,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-02 12:30:48,817 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-02 12:30:48,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:48,818 INFO L225 Difference]: With dead ends: 26 [2024-11-02 12:30:48,818 INFO L226 Difference]: Without dead ends: 26 [2024-11-02 12:30:48,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-02 12:30:48,819 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:48,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 43 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:48,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-11-02 12:30:48,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2024-11-02 12:30:48,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2024-11-02 12:30:48,822 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 9 [2024-11-02 12:30:48,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:48,822 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2024-11-02 12:30:48,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 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) [2024-11-02 12:30:48,823 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2024-11-02 12:30:48,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-02 12:30:48,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:48,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:48,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-02 12:30:48,824 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:48,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:48,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1625382294, now seen corresponding path program 1 times [2024-11-02 12:30:48,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:48,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945985278] [2024-11-02 12:30:48,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:48,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:48,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:48,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:48,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945985278] [2024-11-02 12:30:48,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945985278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:48,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:48,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-02 12:30:48,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094465480] [2024-11-02 12:30:48,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:48,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:30:48,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:48,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:30:48,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:48,960 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:49,023 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2024-11-02 12:30:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:30:49,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-02 12:30:49,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:49,024 INFO L225 Difference]: With dead ends: 28 [2024-11-02 12:30:49,024 INFO L226 Difference]: Without dead ends: 28 [2024-11-02 12:30:49,024 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:49,025 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:49,025 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 43 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-02 12:30:49,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-02 12:30:49,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-02 12:30:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:49,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-02 12:30:49,028 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 10 [2024-11-02 12:30:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:49,028 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-02 12:30:49,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-02 12:30:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 12:30:49,029 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:49,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:49,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-02 12:30:49,030 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:49,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:49,031 INFO L85 PathProgramCache]: Analyzing trace with hash -235863062, now seen corresponding path program 1 times [2024-11-02 12:30:49,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:49,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929642717] [2024-11-02 12:30:49,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:49,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:49,279 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929642717] [2024-11-02 12:30:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929642717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-02 12:30:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-02 12:30:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-02 12:30:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985137289] [2024-11-02 12:30:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-02 12:30:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-02 12:30:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:49,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-02 12:30:49,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:49,281 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:49,306 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2024-11-02 12:30:49,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-02 12:30:49,307 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-02 12:30:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:49,308 INFO L225 Difference]: With dead ends: 31 [2024-11-02 12:30:49,308 INFO L226 Difference]: Without dead ends: 29 [2024-11-02 12:30:49,308 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-02 12:30:49,309 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:49,309 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-02 12:30:49,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-02 12:30:49,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2024-11-02 12:30:49,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 28 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) [2024-11-02 12:30:49,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-11-02 12:30:49,312 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 12 [2024-11-02 12:30:49,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:49,312 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-11-02 12:30:49,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2024-11-02 12:30:49,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-02 12:30:49,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:49,313 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:49,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-02 12:30:49,313 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:49,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:49,314 INFO L85 PathProgramCache]: Analyzing trace with hash -234293748, now seen corresponding path program 1 times [2024-11-02 12:30:49,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:49,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406489280] [2024-11-02 12:30:49,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:49,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:49,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:49,918 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2024-11-02 12:30:49,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406489280] [2024-11-02 12:30:49,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406489280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-02 12:30:49,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50004540] [2024-11-02 12:30:49,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:49,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-02 12:30:49,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 [2024-11-02 12:30:49,923 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-02 12:30:49,925 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-02 12:30:50,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-02 12:30:50,036 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-02 12:30:50,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-02 12:30:50,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-02 12:30:50,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:50,952 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-02 12:30:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-02 12:30:51,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50004540] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-02 12:30:51,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1713866204] [2024-11-02 12:30:51,238 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2024-11-02 12:30:51,238 INFO L166 IcfgInterpreter]: Building call graph [2024-11-02 12:30:51,243 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2024-11-02 12:30:51,249 INFO L176 IcfgInterpreter]: Starting interpretation [2024-11-02 12:30:51,250 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2024-11-02 12:30:52,782 INFO L180 IcfgInterpreter]: Interpretation finished [2024-11-02 12:30:54,724 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1042#(and (exists ((|v_ULTIMATE.start_strlcpy_#t~post5#1.base_24| Int) (|v_ULTIMATE.start_strlcpy_#t~post5#1.offset_23| Int)) (and (<= 1 |#StackHeapBarrier|) (<= |ULTIMATE.start_strlcpy_~siz#1| 2147483647) (<= 0 |v_ULTIMATE.start_strlcpy_#t~post5#1.offset_23|) (<= 1 |ULTIMATE.start_strlcpy_~d~0#1.offset|) (<= 2 |ULTIMATE.start_strlcpy_~s~0#1.base|) (<= 1 |ULTIMATE.start_strlcpy_~siz#1|) (<= |ULTIMATE.start_strlcpy_~n~0#1| 2147483646) (<= 1 |ULTIMATE.start_strlcpy_~s~0#1.offset|) (<= 2 |ULTIMATE.start_strlcpy_~d~0#1.base|) (<= 2 |ULTIMATE.start_main_#t~malloc11#1.base|) (<= 2 |ULTIMATE.start_strlcpy_#t~post4#1.base|) (<= 0 |ULTIMATE.start_strlcpy_#t~post4#1.offset|) (<= 2 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 2 |v_ULTIMATE.start_strlcpy_#t~post5#1.base_24|) (<= (select |#length| |v_ULTIMATE.start_strlcpy_#t~post5#1.base_24|) |v_ULTIMATE.start_strlcpy_#t~post5#1.offset_23|))) (= |ULTIMATE.start_strlcpy_~src#1.offset| 0))' at error location [2024-11-02 12:30:54,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2024-11-02 12:30:54,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-02 12:30:54,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 6] total 20 [2024-11-02 12:30:54,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906598167] [2024-11-02 12:30:54,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-02 12:30:54,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-02 12:30:54,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2024-11-02 12:30:54,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-02 12:30:54,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=824, Unknown=3, NotChecked=0, Total=930 [2024-11-02 12:30:54,727 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 21 states, 20 states have (on average 1.6) internal successors, (32), 21 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) [2024-11-02 12:30:55,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-02 12:30:55,403 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2024-11-02 12:30:55,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-02 12:30:55,404 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 21 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 12 [2024-11-02 12:30:55,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-02 12:30:55,405 INFO L225 Difference]: With dead ends: 48 [2024-11-02 12:30:55,405 INFO L226 Difference]: Without dead ends: 48 [2024-11-02 12:30:55,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=163, Invalid=1240, Unknown=3, NotChecked=0, Total=1406 [2024-11-02 12:30:55,410 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 41 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-02 12:30:55,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 68 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-02 12:30:55,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-02 12:30:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 37. [2024-11-02 12:30:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 36 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-02 12:30:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2024-11-02 12:30:55,416 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 12 [2024-11-02 12:30:55,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-02 12:30:55,417 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2024-11-02 12:30:55,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.6) internal successors, (32), 21 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) [2024-11-02 12:30:55,417 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2024-11-02 12:30:55,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-02 12:30:55,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-02 12:30:55,418 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:55,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-02 12:30:55,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-02 12:30:55,619 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2024-11-02 12:30:55,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-02 12:30:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 302642076, now seen corresponding path program 1 times [2024-11-02 12:30:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2024-11-02 12:30:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005317557] [2024-11-02 12:30:55,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-02 12:30:55,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-02 12:30:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:30:55,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-02 12:30:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-02 12:30:55,659 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2024-11-02 12:30:55,659 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-02 12:30:55,661 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 11 remaining) [2024-11-02 12:30:55,662 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 11 remaining) [2024-11-02 12:30:55,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 11 remaining) [2024-11-02 12:30:55,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 11 remaining) [2024-11-02 12:30:55,663 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 11 remaining) [2024-11-02 12:30:55,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 11 remaining) [2024-11-02 12:30:55,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 11 remaining) [2024-11-02 12:30:55,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 11 remaining) [2024-11-02 12:30:55,664 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 11 remaining) [2024-11-02 12:30:55,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 11 remaining) [2024-11-02 12:30:55,665 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (0 of 11 remaining) [2024-11-02 12:30:55,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-02 12:30:55,668 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-02 12:30:55,710 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-02 12:30:55,714 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.11 12:30:55 BoogieIcfgContainer [2024-11-02 12:30:55,714 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-02 12:30:55,715 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-02 12:30:55,715 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-02 12:30:55,715 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-02 12:30:55,716 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 12:30:45" (3/4) ... [2024-11-02 12:30:55,717 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-02 12:30:55,767 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/witness.graphml [2024-11-02 12:30:55,767 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-02 12:30:55,768 INFO L158 Benchmark]: Toolchain (without parser) took 11782.67ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 104.2MB in the beginning and 240.4MB in the end (delta: -136.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:30:55,769 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 144.7MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-02 12:30:55,769 INFO L158 Benchmark]: CACSL2BoogieTranslator took 532.70ms. Allocated memory is still 144.7MB. Free memory was 104.0MB in the beginning and 85.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,769 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.22ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,770 INFO L158 Benchmark]: Boogie Preprocessor took 46.56ms. Allocated memory is still 144.7MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,771 INFO L158 Benchmark]: RCFGBuilder took 552.67ms. Allocated memory is still 144.7MB. Free memory was 81.8MB in the beginning and 63.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,771 INFO L158 Benchmark]: TraceAbstraction took 10543.06ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 62.9MB in the beginning and 242.4MB in the end (delta: -179.5MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,772 INFO L158 Benchmark]: Witness Printer took 52.30ms. Allocated memory is still 272.6MB. Free memory was 242.4MB in the beginning and 240.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-02 12:30:55,774 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.24ms. Allocated memory is still 144.7MB. Free memory is still 119.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 532.70ms. Allocated memory is still 144.7MB. Free memory was 104.0MB in the beginning and 85.3MB in the end (delta: 18.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.22ms. Allocated memory is still 144.7MB. Free memory was 85.3MB in the beginning and 83.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.56ms. Allocated memory is still 144.7MB. Free memory was 83.3MB in the beginning and 81.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 552.67ms. Allocated memory is still 144.7MB. Free memory was 81.8MB in the beginning and 63.5MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 10543.06ms. Allocated memory was 144.7MB in the beginning and 272.6MB in the end (delta: 127.9MB). Free memory was 62.9MB in the beginning and 242.4MB in the end (delta: -179.5MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. * Witness Printer took 52.30ms. Allocated memory is still 272.6MB. Free memory was 242.4MB in the beginning and 240.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L529] int in_len = __VERIFIER_nondet_int(); [L530] COND FALSE !(in_len < 1) [L531] char* in = __builtin_alloca (in_len); VAL [in={3:0}, in_len=1] [L532] in[in_len-1]=0 [L533] int out_len = __VERIFIER_nondet_int(); [L534] COND FALSE !(out_len < 1) [L535] char* out = __builtin_alloca (out_len); [L536] CALL strlcpy(in, out, out_len) [L511] register char *d = dst; [L512] register const char *s = src; [L513] register size_t n = siz; [L514] n != 0 && --n != 0 [L514] EXPR --n [L514] n != 0 && --n != 0 VAL [d={3:0}, n=0, s={2:0}, siz=1] [L514] COND FALSE !(n != 0 && --n != 0) [L520] COND TRUE n == 0 VAL [d={3:0}, s={2:0}, siz=1] [L521] COND TRUE siz != 0 VAL [d={3:0}, s={2:0}] [L522] *d = '\0' VAL [s={2:0}] [L523] EXPR s++ VAL [s={2:1}] [L523] COND TRUE *s++ - 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: 528]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 11 error locations. Started 1 CEGAR loops. OverallTime: 10.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 169 mSDsluCounter, 762 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 467 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 742 IncrementalHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 295 mSDtfsCounter, 742 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 108 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 3.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=16, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 38 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 1125 SizeOfPredicates, 4 NumberOfNonLiveVariables, 114 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 18 InterpolantComputations, 15 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-02 12:30:55,815 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_aaed24d4-2098-451f-ac05-6aa256a5f46c/bin/utaipan-verify-DbMuA5NWw2/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)