/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain EqDomain -i ../sv-benchmarks/c/loops/string-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 11:02:24,832 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 11:02:24,834 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 11:02:24,864 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 11:02:24,865 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 11:02:24,865 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 11:02:24,867 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 11:02:24,868 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 11:02:24,869 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 11:02:24,873 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 11:02:24,875 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 11:02:24,877 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 11:02:24,878 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 11:02:24,884 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 11:02:24,888 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 11:02:24,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 11:02:24,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 11:02:24,890 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 11:02:24,891 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 11:02:24,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 11:02:24,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 11:02:24,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 11:02:24,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 11:02:24,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 11:02:24,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 11:02:24,906 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 11:02:24,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 11:02:24,907 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 11:02:24,908 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 11:02:24,908 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 11:02:24,909 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 11:02:24,909 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 11:02:24,910 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 11:02:24,910 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 11:02:24,911 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 11:02:24,911 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 11:02:24,912 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 11:02:24,912 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 11:02:24,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 11:02:24,915 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 11:02:24,917 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 11:02:24,918 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 11:02:24,953 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 11:02:24,953 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 11:02:24,953 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 11:02:24,953 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 11:02:24,954 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 11:02:24,954 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 11:02:24,954 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 11:02:24,954 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 11:02:24,954 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 11:02:24,955 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 11:02:24,955 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 11:02:24,956 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 11:02:24,956 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 11:02:24,956 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 11:02:24,958 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 11:02:24,958 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 11:02:24,958 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 11:02:24,959 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 11:02:24,959 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 11:02:24,959 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 11:02:24,959 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 11:02:24,959 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 11:02:24,960 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 11:02:24,960 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 11:02:24,960 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 11:02:24,960 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 11:02:24,961 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:02:24,961 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 11:02:24,961 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 11:02:24,961 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 11:02:24,962 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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.sifa: Abstract Domain -> EqDomain [2023-04-01 11:02:25,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 11:02:25,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 11:02:25,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 11:02:25,211 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 11:02:25,212 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 11:02:25,213 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-1.i [2023-04-01 11:02:26,391 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 11:02:26,560 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 11:02:26,560 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i [2023-04-01 11:02:26,565 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75075418/15da32b4940947ceb354b4f73690c25f/FLAG033b3ff77 [2023-04-01 11:02:26,575 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b75075418/15da32b4940947ceb354b4f73690c25f [2023-04-01 11:02:26,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 11:02:26,580 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 11:02:26,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 11:02:26,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 11:02:26,583 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 11:02:26,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@283e3cbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26, skipping insertion in model container [2023-04-01 11:02:26,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,591 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 11:02:26,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 11:02:26,714 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i[896,909] [2023-04-01 11:02:26,730 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:02:26,737 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 11:02:26,747 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-1.i[896,909] [2023-04-01 11:02:26,754 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 11:02:26,765 INFO L208 MainTranslator]: Completed translation [2023-04-01 11:02:26,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26 WrapperNode [2023-04-01 11:02:26,766 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 11:02:26,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 11:02:26,767 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 11:02:26,767 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 11:02:26,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,778 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,788 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,790 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 11:02:26,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 11:02:26,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 11:02:26,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 11:02:26,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (1/1) ... [2023-04-01 11:02:26,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 11:02:26,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:26,823 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 11:02:26,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 11:02:26,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 11:02:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 11:02:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 11:02:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-04-01 11:02:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-04-01 11:02:26,856 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 11:02:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 11:02:26,856 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 11:02:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-04-01 11:02:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-04-01 11:02:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 11:02:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 11:02:26,857 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-04-01 11:02:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-04-01 11:02:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2023-04-01 11:02:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 11:02:26,858 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 11:02:26,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 11:02:26,928 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 11:02:26,929 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 11:02:27,145 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 11:02:27,190 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 11:02:27,190 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-04-01 11:02:27,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:02:27 BoogieIcfgContainer [2023-04-01 11:02:27,193 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 11:02:27,195 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 11:02:27,195 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 11:02:27,204 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 11:02:27,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 11:02:26" (1/3) ... [2023-04-01 11:02:27,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7971cdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:02:27, skipping insertion in model container [2023-04-01 11:02:27,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 11:02:26" (2/3) ... [2023-04-01 11:02:27,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7971cdaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 11:02:27, skipping insertion in model container [2023-04-01 11:02:27,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 11:02:27" (3/3) ... [2023-04-01 11:02:27,206 INFO L112 eAbstractionObserver]: Analyzing ICFG string-1.i [2023-04-01 11:02:27,220 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 11:02:27,221 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 11:02:27,259 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 11:02:27,264 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@12486101, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 11:02:27,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 11:02:27,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-04-01 11:02:27,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-04-01 11:02:27,273 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:27,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:27,274 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:27,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:27,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1142698422, now seen corresponding path program 1 times [2023-04-01 11:02:27,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:27,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200944802] [2023-04-01 11:02:27,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:27,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:27,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:02:27,419 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:27,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200944802] [2023-04-01 11:02:27,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200944802] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:27,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:02:27,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-04-01 11:02:27,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603679612] [2023-04-01 11:02:27,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:27,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-04-01 11:02:27,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:27,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-04-01 11:02:27,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:02:27,456 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.6) internal successors, (32), 21 states have internal predecessors, (32), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:27,483 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2023-04-01 11:02:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-04-01 11:02:27,485 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-04-01 11:02:27,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:27,490 INFO L225 Difference]: With dead ends: 45 [2023-04-01 11:02:27,490 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 11:02:27,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-04-01 11:02:27,495 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:27,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:02:27,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 11:02:27,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 11:02:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2023-04-01 11:02:27,529 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2023-04-01 11:02:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:27,529 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2023-04-01 11:02:27,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2023-04-01 11:02:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-04-01 11:02:27,532 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:27,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:27,533 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 11:02:27,533 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:27,534 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:27,534 INFO L85 PathProgramCache]: Analyzing trace with hash 221340352, now seen corresponding path program 1 times [2023-04-01 11:02:27,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:27,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146420200] [2023-04-01 11:02:27,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:27,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:27,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 11:02:27,676 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:27,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146420200] [2023-04-01 11:02:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146420200] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:27,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 11:02:27,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-04-01 11:02:27,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596319401] [2023-04-01 11:02:27,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:27,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-04-01 11:02:27,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:27,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-04-01 11:02:27,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 11:02:27,680 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:27,702 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2023-04-01 11:02:27,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-04-01 11:02:27,702 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2023-04-01 11:02:27,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:27,704 INFO L225 Difference]: With dead ends: 40 [2023-04-01 11:02:27,704 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 11:02:27,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-04-01 11:02:27,706 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 1 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:27,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 33 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 11:02:27,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 11:02:27,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2023-04-01 11:02:27,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-04-01 11:02:27,712 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2023-04-01 11:02:27,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:27,712 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-04-01 11:02:27,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:27,713 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-04-01 11:02:27,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-04-01 11:02:27,713 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:27,714 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:27,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-04-01 11:02:27,714 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:27,715 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:27,715 INFO L85 PathProgramCache]: Analyzing trace with hash 358267925, now seen corresponding path program 1 times [2023-04-01 11:02:27,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:27,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626429610] [2023-04-01 11:02:27,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:27,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:27,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:27,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:02:27,849 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:27,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626429610] [2023-04-01 11:02:27,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626429610] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:02:27,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [205013125] [2023-04-01 11:02:27,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:27,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:27,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:27,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:02:27,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 11:02:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:27,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 11:02:27,967 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:02:28,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:02:28,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:02:28,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 11:02:28,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [205013125] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:02:28,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1946006972] [2023-04-01 11:02:28,081 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:02:28,081 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:02:28,084 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:02:28,087 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:02:28,088 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:02:28,227 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 11:02:28,910 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 69 for LOIs [2023-04-01 11:02:28,940 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:02:28,944 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:02:30,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1946006972] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:30,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:02:30,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4, 4, 4] total 24 [2023-04-01 11:02:30,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534271588] [2023-04-01 11:02:30,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:30,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 11:02:30,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:30,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 11:02:30,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=465, Unknown=0, NotChecked=0, Total=552 [2023-04-01 11:02:30,665 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 19 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:32,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:32,060 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2023-04-01 11:02:32,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 11:02:32,061 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2023-04-01 11:02:32,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:32,061 INFO L225 Difference]: With dead ends: 42 [2023-04-01 11:02:32,061 INFO L226 Difference]: Without dead ends: 31 [2023-04-01 11:02:32,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=211, Invalid=1349, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 11:02:32,063 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 58 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:32,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 6 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-04-01 11:02:32,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-04-01 11:02:32,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2023-04-01 11:02:32,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:32,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2023-04-01 11:02:32,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 22 [2023-04-01 11:02:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:32,073 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2023-04-01 11:02:32,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.2) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2023-04-01 11:02:32,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-01 11:02:32,074 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:32,074 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:32,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 11:02:32,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:32,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:32,281 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash -866408998, now seen corresponding path program 1 times [2023-04-01 11:02:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:32,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935627629] [2023-04-01 11:02:32,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:32,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:32,335 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:32,336 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935627629] [2023-04-01 11:02:32,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935627629] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:02:32,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861411515] [2023-04-01 11:02:32,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:32,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:32,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:32,338 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:02:32,344 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 11:02:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:32,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 11:02:32,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:02:32,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:32,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:02:32,425 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:32,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861411515] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:02:32,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1320288902] [2023-04-01 11:02:32,427 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:02:32,427 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:02:32,428 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:02:32,428 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:02:32,428 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:02:32,482 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 11:02:32,961 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 88 for LOIs [2023-04-01 11:02:32,981 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:02:32,985 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:02:34,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1320288902] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:34,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:02:34,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 22 [2023-04-01 11:02:34,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761241701] [2023-04-01 11:02:34,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:34,201 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 11:02:34,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:34,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 11:02:34,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=386, Unknown=1, NotChecked=0, Total=462 [2023-04-01 11:02:34,203 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:35,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:35,208 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2023-04-01 11:02:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 11:02:35,213 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-04-01 11:02:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:35,214 INFO L225 Difference]: With dead ends: 41 [2023-04-01 11:02:35,214 INFO L226 Difference]: Without dead ends: 25 [2023-04-01 11:02:35,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 52 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=167, Invalid=1021, Unknown=2, NotChecked=0, Total=1190 [2023-04-01 11:02:35,216 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 49 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:35,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 6 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 251 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 11:02:35,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-04-01 11:02:35,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-04-01 11:02:35,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2023-04-01 11:02:35,223 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 24 [2023-04-01 11:02:35,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:35,223 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2023-04-01 11:02:35,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:35,224 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2023-04-01 11:02:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-04-01 11:02:35,224 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:35,224 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:35,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 11:02:35,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-04-01 11:02:35,428 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:35,429 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:35,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1440773488, now seen corresponding path program 1 times [2023-04-01 11:02:35,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:35,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506415277] [2023-04-01 11:02:35,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:35,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:35,495 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:35,495 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506415277] [2023-04-01 11:02:35,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506415277] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:02:35,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232244083] [2023-04-01 11:02:35,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:35,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:35,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:35,497 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:02:35,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 11:02:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:35,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 11:02:35,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:02:35,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:35,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:02:35,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 11:02:35,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232244083] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:02:35,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1747607561] [2023-04-01 11:02:35,574 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:02:35,574 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:02:35,574 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:02:35,574 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:02:35,574 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:02:35,602 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 11:02:35,974 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 71 for LOIs [2023-04-01 11:02:35,988 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:02:35,992 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:02:37,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1747607561] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:37,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:02:37,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [4, 4, 4] total 24 [2023-04-01 11:02:37,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154307700] [2023-04-01 11:02:37,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:37,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 11:02:37,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:37,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 11:02:37,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2023-04-01 11:02:37,088 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:38,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:38,082 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-04-01 11:02:38,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 11:02:38,083 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-04-01 11:02:38,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:38,083 INFO L225 Difference]: With dead ends: 38 [2023-04-01 11:02:38,083 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 11:02:38,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=223, Invalid=1337, Unknown=0, NotChecked=0, Total=1560 [2023-04-01 11:02:38,085 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:38,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 5 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 11:02:38,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 11:02:38,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 11:02:38,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:38,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2023-04-01 11:02:38,098 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 24 [2023-04-01 11:02:38,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:38,099 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2023-04-01 11:02:38,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 14 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:38,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2023-04-01 11:02:38,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-04-01 11:02:38,100 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:38,100 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:38,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-04-01 11:02:38,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:38,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:38,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:38,301 INFO L85 PathProgramCache]: Analyzing trace with hash 39351413, now seen corresponding path program 1 times [2023-04-01 11:02:38,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:38,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225393953] [2023-04-01 11:02:38,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:38,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:38,371 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 11:02:38,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225393953] [2023-04-01 11:02:38,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225393953] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:02:38,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662651266] [2023-04-01 11:02:38,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:38,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:38,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:38,409 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:02:38,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 11:02:38,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:38,457 INFO L262 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 11:02:38,458 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:02:38,466 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 11:02:38,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:02:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-04-01 11:02:38,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662651266] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:02:38,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1153482120] [2023-04-01 11:02:38,482 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:02:38,482 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:02:38,483 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:02:38,483 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:02:38,483 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:02:38,502 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 11:02:38,948 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 88 for LOIs [2023-04-01 11:02:38,975 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:02:38,978 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:02:39,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1153482120] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:39,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:02:39,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 21 [2023-04-01 11:02:39,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440714087] [2023-04-01 11:02:39,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:39,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-04-01 11:02:39,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:39,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-04-01 11:02:39,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-04-01 11:02:39,860 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:40,738 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2023-04-01 11:02:40,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 11:02:40,738 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2023-04-01 11:02:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:40,740 INFO L225 Difference]: With dead ends: 33 [2023-04-01 11:02:40,740 INFO L226 Difference]: Without dead ends: 28 [2023-04-01 11:02:40,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2023-04-01 11:02:40,745 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 34 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:40,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 6 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-04-01 11:02:40,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-04-01 11:02:40,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-04-01 11:02:40,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2023-04-01 11:02:40,760 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 26 [2023-04-01 11:02:40,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:40,761 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2023-04-01 11:02:40,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 11 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:40,761 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2023-04-01 11:02:40,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-04-01 11:02:40,761 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 11:02:40,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:40,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 11:02:40,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:40,968 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 11:02:40,968 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 11:02:40,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1174042624, now seen corresponding path program 1 times [2023-04-01 11:02:40,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 11:02:40,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588578952] [2023-04-01 11:02:40,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:40,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 11:02:40,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:41,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:02:41,027 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 11:02:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588578952] [2023-04-01 11:02:41,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588578952] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 11:02:41,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880326591] [2023-04-01 11:02:41,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 11:02:41,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:41,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 11:02:41,028 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 11:02:41,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 11:02:41,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 11:02:41,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2023-04-01 11:02:41,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 11:02:41,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:02:41,085 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 11:02:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 11:02:41,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880326591] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 11:02:41,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1139384374] [2023-04-01 11:02:41,103 INFO L159 IcfgInterpreter]: Started Sifa with 21 locations of interest [2023-04-01 11:02:41,103 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 11:02:41,103 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-04-01 11:02:41,103 INFO L176 IcfgInterpreter]: Starting interpretation [2023-04-01 11:02:41,103 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-04-01 11:02:41,129 INFO L197 IcfgInterpreter]: Interpreting procedure main with input of size 43 for LOIs [2023-04-01 11:02:41,684 INFO L197 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 29 for LOIs [2023-04-01 11:02:41,692 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 7 for LOIs [2023-04-01 11:02:41,694 INFO L180 IcfgInterpreter]: Interpretation finished [2023-04-01 11:02:42,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSifa [1139384374] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 11:02:42,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2023-04-01 11:02:42,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [4, 4, 4] total 20 [2023-04-01 11:02:42,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497953778] [2023-04-01 11:02:42,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 11:02:42,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 11:02:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 11:02:42,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 11:02:42,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2023-04-01 11:02:42,359 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 15 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:43,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 11:02:43,088 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2023-04-01 11:02:43,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 11:02:43,088 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-04-01 11:02:43,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 11:02:43,089 INFO L225 Difference]: With dead ends: 28 [2023-04-01 11:02:43,089 INFO L226 Difference]: Without dead ends: 0 [2023-04-01 11:02:43,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2023-04-01 11:02:43,090 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 11:02:43,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 8 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 11:02:43,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-04-01 11:02:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-04-01 11:02:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-04-01 11:02:43,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-04-01 11:02:43,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2023-04-01 11:02:43,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 11:02:43,091 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-04-01 11:02:43,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 1.75) internal successors, (21), 11 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-04-01 11:02:43,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-04-01 11:02:43,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-04-01 11:02:43,094 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-04-01 11:02:43,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-04-01 11:02:43,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 11:02:43,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-04-01 11:02:44,296 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line 12) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(lines 15 17) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L899 garLoopResultBuilder]: For program point mainEXIT(lines 28 72) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)) (and (let ((.cse1 (+ main_~j~0 1))) (or (and (= 1 main_~found~0) (< main_~nc_B~0 .cse1)) (and (<= .cse1 main_~nc_B~0) (= 0 main_~found~0)))) (or (<= main_~nc_B~0 main_~j~0) (<= main_~nc_A~0 main_~i~0))))) [2023-04-01 11:02:44,297 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-04-01 11:02:44,297 INFO L895 garLoopResultBuilder]: At program point L37-3(lines 37 38) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and (not (= |main_~#string_A~0.base| 0)) (= |main_~#string_A~0.offset| 0) (not (= |main_~#string_B~0.base| 0)) (= (select |old(#valid)| |main_~#string_A~0.base|) 0) (not (= |#StackHeapBarrier| |main_~#string_B~0.base|)) (not (= |main_~#string_A~0.base| |#StackHeapBarrier|)) (= 0 main_~found~0) (= |main_~#string_B~0.offset| 0)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-01 11:02:44,297 INFO L895 garLoopResultBuilder]: At program point L33-3(lines 33 34) the Hoare annotation is: (let ((.cse1 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (let ((.cse0 (select |#memory_int| 1))) (and (not (= |main_~#string_A~0.base| 0)) (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (= |main_~#string_A~0.offset| 0) (not (= |main_~#string_B~0.base| 0)) (= (select |old(#valid)| |main_~#string_A~0.base|) 0) (= (select |#valid| 1) 1) (not (= |#StackHeapBarrier| |main_~#string_B~0.base|)) (not (= |main_~#string_A~0.base| |#StackHeapBarrier|)) (= (select |#valid| 0) 0) (= 0 main_~found~0) (= (select |#valid| 2) 1) (= (select .cse0 0) 48) (= |main_~#string_B~0.offset| 0) (= (select .cse0 1) 0))) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse1 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse1 1) 0)))) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 47) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point mainFINAL(lines 28 72) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L895 garLoopResultBuilder]: At program point L46-3(lines 46 47) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (and (not (= |main_~#string_A~0.base| 0)) (= (select (select |#memory_int| |main_~#string_A~0.base|) main_~nc_A~0) 0) (= |main_~#string_A~0.offset| 0) (not (= |main_~#string_B~0.base| 0)) (= (select |old(#valid)| |main_~#string_A~0.base|) 0) (not (= |#StackHeapBarrier| |main_~#string_B~0.base|)) (not (= |main_~#string_A~0.base| |#StackHeapBarrier|)) (= 0 main_~found~0) (= |main_~#string_B~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#string_B~0.base|) 4))) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L46-4(lines 29 72) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 28 72) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 43) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L895 garLoopResultBuilder]: At program point L42-3(lines 42 43) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (and (not (= |main_~#string_A~0.base| 0)) (= |main_~#string_A~0.offset| 0) (not (= |main_~#string_B~0.base| 0)) (= (select |old(#valid)| |main_~#string_A~0.base|) 0) (not (= |#StackHeapBarrier| |main_~#string_B~0.base|)) (not (= |main_~#string_A~0.base| |#StackHeapBarrier|)) (= 0 main_~found~0) (= |main_~#string_B~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#string_B~0.base|) 4))) (not (= |#NULL.base| 0)) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L42-4(lines 42 43) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L895 garLoopResultBuilder]: At program point L55-2(lines 53 65) the Hoare annotation is: (let ((.cse0 (select |old(#memory_int)| 1))) (or (not (= (select |old(#valid)| 2) 1)) (not (= (select |old(#valid)| 1) 1)) (not (= |#NULL.offset| 0)) (not (= |#NULL.base| 0)) (and (not (= |main_~#string_A~0.base| 0)) (= (select (select |#memory_int| |main_~#string_A~0.base|) main_~nc_A~0) 0) (= |main_~#string_A~0.offset| 0) (not (= |main_~#string_B~0.base| 0)) (= (select |old(#valid)| |main_~#string_A~0.base|) 0) (not (= |#StackHeapBarrier| |main_~#string_B~0.base|)) (not (= |main_~#string_A~0.base| |#StackHeapBarrier|)) (= 0 main_~found~0) (= |main_~#string_B~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#string_B~0.base|) 4))) (not (= (select |old(#length)| 1) 2)) (not (= (select |old(#length)| 2) 11)) (not (= (select .cse0 0) 48)) (not (= (select |old(#valid)| 0) 0)) (<= |#StackHeapBarrier| 0) (not (= (select .cse0 1) 0)))) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-04-01 11:02:44,298 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2023-04-01 11:02:44,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2023-04-01 11:02:44,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-04-01 11:02:44,299 INFO L895 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= 11 (select |#length| 2)) (= 2 (select |#length| 1)) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2023-04-01 11:02:44,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-04-01 11:02:44,299 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line -1) the Hoare annotation is: true [2023-04-01 11:02:44,299 INFO L899 garLoopResultBuilder]: For program point L19-2(lines 18 23) no Hoare annotation was computed. [2023-04-01 11:02:44,299 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 18 23) no Hoare annotation was computed. [2023-04-01 11:02:44,300 INFO L895 garLoopResultBuilder]: At program point $Ultimate##0(lines 18 23) the Hoare annotation is: (let ((.cse1 (= |__VERIFIER_assert_#in~cond| 0)) (.cse6 (= |__VERIFIER_assert_#in~cond| 1))) (or (not (= |#NULL.offset| 0)) (forall ((v_main_~nc_A~0_BEFORE_CALL_4 Int) (|v_old(#memory_int)_BEFORE_CALL_4| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_4| (Array Int Int)) (|v_old(#length)_BEFORE_CALL_4| (Array Int Int)) (v_main_~found~0_BEFORE_CALL_4 Int) (|v_main_~#string_A~0.base_BEFORE_CALL_4| Int) (v_main_~nc_B~0_BEFORE_CALL_4 Int)) (let ((.cse2 (= v_main_~found~0_BEFORE_CALL_4 1)) (.cse3 (= v_main_~found~0_BEFORE_CALL_4 0))) (let ((.cse4 (not .cse3)) (.cse5 (not .cse2)) (.cse0 (select |v_old(#memory_int)_BEFORE_CALL_4| 1))) (or (< v_main_~nc_B~0_BEFORE_CALL_4 v_main_~nc_A~0_BEFORE_CALL_4) (= |v_old(#valid)_BEFORE_CALL_4| .cse0) (not (= (select |v_old(#valid)_BEFORE_CALL_4| 1) 1)) (= .cse0 |v_old(#length)_BEFORE_CALL_4|) (not (= (select |v_old(#valid)_BEFORE_CALL_4| |v_main_~#string_A~0.base_BEFORE_CALL_4|) 0)) (and (< 0 v_main_~nc_B~0_BEFORE_CALL_4) (< 0 v_main_~nc_A~0_BEFORE_CALL_4)) (not (= (select |v_old(#length)_BEFORE_CALL_4| 2) 11)) (not (= (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_4|) v_main_~nc_A~0_BEFORE_CALL_4) 0)) (and (or (not .cse1) .cse2 .cse3) (or (and .cse4 .cse5) (not .cse6))) (not (= (select |v_old(#length)_BEFORE_CALL_4| 1) 2)) (not (= (select .cse0 1) 0)) (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 2) (and (or .cse4 (< v_main_~nc_B~0_BEFORE_CALL_4 1)) (or (<= 1 v_main_~nc_B~0_BEFORE_CALL_4) .cse5)) (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 1) (not (= 48 (select .cse0 0))) (= |v_old(#valid)_BEFORE_CALL_4| |v_old(#length)_BEFORE_CALL_4|) (= |v_main_~#string_A~0.base_BEFORE_CALL_4| |#StackHeapBarrier|) (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 0) (not (= (select |v_old(#valid)_BEFORE_CALL_4| 2) 1)) (not (= (select |v_old(#valid)_BEFORE_CALL_4| 0) 0)))))) (forall ((|v_main_~#string_B~0.base_BEFORE_CALL_4| Int)) (or (= |v_main_~#string_B~0.base_BEFORE_CALL_4| 0) (= |#StackHeapBarrier| |v_main_~#string_B~0.base_BEFORE_CALL_4|) (not (= (select (select |#memory_int| |v_main_~#string_B~0.base_BEFORE_CALL_4|) 4) 0)))) (not (= |#NULL.base| 0)) (= |#StackHeapBarrier| 0) (exists ((v_main_~nc_A~0_BEFORE_CALL_4 Int) (|v_old(#memory_int)_BEFORE_CALL_4| (Array Int (Array Int Int))) (|v_old(#valid)_BEFORE_CALL_4| (Array Int Int)) (|v_old(#length)_BEFORE_CALL_4| (Array Int Int)) (v_main_~found~0_BEFORE_CALL_4 Int) (|v_main_~#string_A~0.base_BEFORE_CALL_4| Int) (v_main_~nc_B~0_BEFORE_CALL_4 Int)) (let ((.cse7 (= v_main_~found~0_BEFORE_CALL_4 1)) (.cse8 (= v_main_~found~0_BEFORE_CALL_4 0)) (.cse9 (select |v_old(#memory_int)_BEFORE_CALL_4| 1))) (and (= (select (select |#memory_int| |v_main_~#string_A~0.base_BEFORE_CALL_4|) v_main_~nc_A~0_BEFORE_CALL_4) 0) (= (select |v_old(#length)_BEFORE_CALL_4| 1) 2) (<= v_main_~nc_A~0_BEFORE_CALL_4 v_main_~nc_B~0_BEFORE_CALL_4) (or (and .cse7 (< v_main_~nc_B~0_BEFORE_CALL_4 1)) (and (<= 1 v_main_~nc_B~0_BEFORE_CALL_4) .cse8)) (not (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 2)) (= (select |v_old(#valid)_BEFORE_CALL_4| 1) 1) (= (select |v_old(#length)_BEFORE_CALL_4| 2) 11) (or (<= v_main_~nc_B~0_BEFORE_CALL_4 0) (<= v_main_~nc_A~0_BEFORE_CALL_4 0)) (or (and (not .cse8) (not .cse7) .cse1) (and (or .cse7 .cse8) .cse6)) (= (select |v_old(#valid)_BEFORE_CALL_4| 0) 0) (not (= |v_old(#valid)_BEFORE_CALL_4| |v_old(#length)_BEFORE_CALL_4|)) (not (= .cse9 |v_old(#length)_BEFORE_CALL_4|)) (= (select .cse9 1) 0) (not (= |v_main_~#string_A~0.base_BEFORE_CALL_4| |#StackHeapBarrier|)) (= (select |v_old(#valid)_BEFORE_CALL_4| |v_main_~#string_A~0.base_BEFORE_CALL_4|) 0) (not (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 1)) (not (= |v_old(#valid)_BEFORE_CALL_4| .cse9)) (not (= |v_main_~#string_A~0.base_BEFORE_CALL_4| 0)) (= (select |v_old(#valid)_BEFORE_CALL_4| 2) 1) (= 48 (select .cse9 0))))))) [2023-04-01 11:02:44,300 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-04-01 11:02:44,300 INFO L899 garLoopResultBuilder]: For program point L19(lines 19 21) no Hoare annotation was computed. [2023-04-01 11:02:44,300 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 20) no Hoare annotation was computed. [2023-04-01 11:02:44,303 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-04-01 11:02:44,305 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-04-01 11:02:44,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.04 11:02:44 BoogieIcfgContainer [2023-04-01 11:02:44,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-04-01 11:02:44,327 INFO L158 Benchmark]: Toolchain (without parser) took 17746.89ms. Allocated memory was 265.3MB in the beginning and 551.6MB in the end (delta: 286.3MB). Free memory was 202.7MB in the beginning and 198.2MB in the end (delta: 4.5MB). Peak memory consumption was 292.9MB. Max. memory is 8.0GB. [2023-04-01 11:02:44,327 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-04-01 11:02:44,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.66ms. Allocated memory is still 265.3MB. Free memory was 202.7MB in the beginning and 191.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-04-01 11:02:44,327 INFO L158 Benchmark]: Boogie Preprocessor took 25.94ms. Allocated memory is still 265.3MB. Free memory was 191.7MB in the beginning and 190.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-04-01 11:02:44,327 INFO L158 Benchmark]: RCFGBuilder took 399.65ms. Allocated memory is still 265.3MB. Free memory was 189.6MB in the beginning and 172.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-04-01 11:02:44,328 INFO L158 Benchmark]: TraceAbstraction took 17131.45ms. Allocated memory was 265.3MB in the beginning and 551.6MB in the end (delta: 286.3MB). Free memory was 171.8MB in the beginning and 198.2MB in the end (delta: -26.4MB). Peak memory consumption was 261.4MB. Max. memory is 8.0GB. [2023-04-01 11:02:44,329 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 134.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.66ms. Allocated memory is still 265.3MB. Free memory was 202.7MB in the beginning and 191.7MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.94ms. Allocated memory is still 265.3MB. Free memory was 191.7MB in the beginning and 190.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 399.65ms. Allocated memory is still 265.3MB. Free memory was 189.6MB in the beginning and 172.8MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 17131.45ms. Allocated memory was 265.3MB in the beginning and 551.6MB in the end (delta: 286.3MB). Free memory was 171.8MB in the beginning and 198.2MB in the end (delta: -26.4MB). Peak memory consumption was 261.4MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 20]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 213 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 213 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 31 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1085 IncrementalHoareTripleChecker+Invalid, 1128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 61 mSDtfsCounter, 1085 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 460 GetRequests, 281 SyntacticMatches, 7 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1774 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=0, InterpolantAutomatonStates: 95, 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, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 20 PreInvPairs, 39 NumberOfFragments, 1031 HoareAnnotationTreeSize, 20 FomulaSimplifications, 579 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 11 FomulaSimplificationsInter, 2803 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 390 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 658 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 54/69 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: OVERALL_TIME: 2.9s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 20, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 100, DAG_INTERPRETER_EARLY_EXITS: 5, TOOLS_POST_APPLICATIONS: 152, TOOLS_POST_TIME: 1.4s, TOOLS_POST_CALL_APPLICATIONS: 25, TOOLS_POST_CALL_TIME: 0.1s, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 187, TOOLS_QUANTIFIERELIM_TIME: 1.5s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 421, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 13, DOMAIN_JOIN_TIME: 0.2s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 34, DOMAIN_WIDEN_TIME: 0.8s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 51, DOMAIN_ISSUBSETEQ_TIME: 0.1s, DOMAIN_ISBOTTOM_APPLICATIONS: 100, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 17, LOOP_SUMMARIZER_CACHE_MISSES: 17, LOOP_SUMMARIZER_OVERALL_TIME: 1.7s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 1.7s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 51, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 5, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1013, DAG_COMPRESSION_RETAINED_NODES: 360, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || (((((((((!(string_A == 0) && unknown-#memory_int-unknown[string_A][nc_A] == 0) && string_A == 0) && !(string_B == 0)) && \old(\valid)[string_A] == 0) && !(unknown-#StackHeapBarrier-unknown == string_B)) && !(string_A == unknown-#StackHeapBarrier-unknown)) && 0 == found) && string_B == 0) && 0 == unknown-#memory_int-unknown[string_B][4])) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 11)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((((((((!(string_A == 0) && 11 == unknown-#length-unknown[2]) && 2 == unknown-#length-unknown[1]) && string_A == 0) && !(string_B == 0)) && \old(\valid)[string_A] == 0) && \valid[1] == 1) && !(unknown-#StackHeapBarrier-unknown == string_B)) && !(string_A == unknown-#StackHeapBarrier-unknown)) && \valid[0] == 0) && 0 == found) && \valid[2] == 1) && unknown-#memory_int-unknown[1][0] == 48) && string_B == 0) && unknown-#memory_int-unknown[1][1] == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 11)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || !(#NULL == 0)) || (((((((((!(string_A == 0) && unknown-#memory_int-unknown[string_A][nc_A] == 0) && string_A == 0) && !(string_B == 0)) && \old(\valid)[string_A] == 0) && !(unknown-#StackHeapBarrier-unknown == string_B)) && !(string_A == unknown-#StackHeapBarrier-unknown)) && 0 == found) && string_B == 0) && 0 == unknown-#memory_int-unknown[string_B][4])) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 11)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 37]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || (((((((!(string_A == 0) && string_A == 0) && !(string_B == 0)) && \old(\valid)[string_A] == 0) && !(unknown-#StackHeapBarrier-unknown == string_B)) && !(string_A == unknown-#StackHeapBarrier-unknown)) && 0 == found) && string_B == 0)) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 11)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: (((((((((!(\old(\valid)[2] == 1) || !(\old(\valid)[1] == 1)) || !(#NULL == 0)) || ((((((((!(string_A == 0) && string_A == 0) && !(string_B == 0)) && \old(\valid)[string_A] == 0) && !(unknown-#StackHeapBarrier-unknown == string_B)) && !(string_A == unknown-#StackHeapBarrier-unknown)) && 0 == found) && string_B == 0) && 0 == unknown-#memory_int-unknown[string_B][4])) || !(#NULL == 0)) || !(\old(unknown-#length-unknown)[1] == 2)) || !(\old(unknown-#length-unknown)[2] == 11)) || !(\old(unknown-#memory_int-unknown)[1][0] == 48)) || !(\old(\valid)[0] == 0)) || unknown-#StackHeapBarrier-unknown <= 0) || !(\old(unknown-#memory_int-unknown)[1][1] == 0) RESULT: Ultimate proved your program to be correct! [2023-04-01 11:02:44,359 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...