./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/string-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/string-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:48:06,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:48:06,785 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:48:06,813 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:48:06,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:48:06,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:48:06,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:48:06,817 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:48:06,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:48:06,820 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:48:06,821 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:48:06,822 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:48:06,822 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:48:06,823 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:48:06,823 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:48:06,824 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:48:06,825 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:48:06,825 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:48:06,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:48:06,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:48:06,829 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:48:06,829 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:48:06,830 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:48:06,831 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:48:06,832 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:48:06,834 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:48:06,834 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:48:06,834 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:48:06,835 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:48:06,835 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:48:06,836 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:48:06,836 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:48:06,837 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:48:06,837 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:48:06,838 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:48:06,838 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:48:06,839 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:48:06,839 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:48:06,839 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:48:06,839 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:48:06,840 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:48:06,841 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:48:06,841 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:48:06,857 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:48:06,857 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:48:06,857 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:48:06,857 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:48:06,858 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:48:06,858 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:48:06,859 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:48:06,859 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:48:06,859 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:48:06,859 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:48:06,859 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:48:06,860 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:48:06,861 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:48:06,861 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:48:06,861 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:48:06,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:48:06,862 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:48:06,862 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:48:06,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:48:06,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:48:06,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:48:06,863 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:48:06,864 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.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2022-07-12 03:48:07,085 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:48:07,103 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:48:07,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:48:07,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:48:07,108 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:48:07,109 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2022-07-12 03:48:07,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f59b7b3/76706174f2064bfc86ccf02b40da8ccf/FLAG74d9e01c3 [2022-07-12 03:48:07,616 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:48:07,617 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2022-07-12 03:48:07,622 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f59b7b3/76706174f2064bfc86ccf02b40da8ccf/FLAG74d9e01c3 [2022-07-12 03:48:07,638 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f0f59b7b3/76706174f2064bfc86ccf02b40da8ccf [2022-07-12 03:48:07,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:48:07,642 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:48:07,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:48:07,645 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:48:07,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:48:07,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@955788f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07, skipping insertion in model container [2022-07-12 03:48:07,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,653 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:48:07,666 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:48:07,792 WARN L230 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-2.i[896,909] [2022-07-12 03:48:07,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:48:07,819 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:48:07,831 WARN L230 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-2.i[896,909] [2022-07-12 03:48:07,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:48:07,857 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:48:07,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07 WrapperNode [2022-07-12 03:48:07,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:48:07,860 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:48:07,860 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:48:07,860 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:48:07,866 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,880 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,895 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 126 [2022-07-12 03:48:07,896 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:48:07,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:48:07,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:48:07,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:48:07,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,907 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,907 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,911 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,922 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,925 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:48:07,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:48:07,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:48:07,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:48:07,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (1/1) ... [2022-07-12 03:48:07,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:48:07,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:48:07,962 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) [2022-07-12 03:48:07,989 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 [2022-07-12 03:48:08,030 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:48:08,031 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:48:08,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:48:08,107 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:48:08,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:48:08,280 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:48:08,284 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:48:08,288 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 03:48:08,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:08 BoogieIcfgContainer [2022-07-12 03:48:08,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:48:08,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:48:08,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:48:08,302 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:48:08,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:48:07" (1/3) ... [2022-07-12 03:48:08,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f941123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:08, skipping insertion in model container [2022-07-12 03:48:08,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:07" (2/3) ... [2022-07-12 03:48:08,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f941123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:08, skipping insertion in model container [2022-07-12 03:48:08,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:08" (3/3) ... [2022-07-12 03:48:08,304 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2022-07-12 03:48:08,313 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:48:08,314 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:48:08,344 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:48:08,349 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@19eeaa7b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6e0859ca [2022-07-12 03:48:08,357 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:48:08,360 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:08,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:48:08,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:08,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:08,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:08,375 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2022-07-12 03:48:08,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:08,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177008498] [2022-07-12 03:48:08,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:08,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:08,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:48:08,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:08,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177008498] [2022-07-12 03:48:08,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177008498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:08,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:08,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:08,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214088330] [2022-07-12 03:48:08,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:08,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:08,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:08,587 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:08,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:08,653 INFO L93 Difference]: Finished difference Result 62 states and 95 transitions. [2022-07-12 03:48:08,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:08,656 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:48:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:08,662 INFO L225 Difference]: With dead ends: 62 [2022-07-12 03:48:08,662 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:48:08,668 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 [2022-07-12 03:48:08,672 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:08,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 49 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:48:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:48:08,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-07-12 03:48:08,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:08,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-12 03:48:08,704 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 16 [2022-07-12 03:48:08,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:08,704 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-12 03:48:08,704 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:08,705 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-12 03:48:08,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:48:08,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:08,706 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] [2022-07-12 03:48:08,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:48:08,706 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:08,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:08,708 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2022-07-12 03:48:08,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:08,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855589683] [2022-07-12 03:48:08,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:08,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:08,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:08,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:48:08,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855589683] [2022-07-12 03:48:08,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855589683] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:48:08,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1743056260] [2022-07-12 03:48:08,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:08,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:48:08,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:48:08,779 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) [2022-07-12 03:48:08,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-12 03:48:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:08,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:48:08,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:48:08,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:48:08,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:48:08,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1743056260] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:48:08,996 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:48:08,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-07-12 03:48:08,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940174051] [2022-07-12 03:48:08,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:48:08,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:48:08,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:08,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:48:08,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:48:08,999 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:09,116 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-07-12 03:48:09,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:48:09,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 03:48:09,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:09,118 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:48:09,119 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:48:09,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:48:09,121 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:09,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 59 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:48:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:48:09,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-07-12 03:48:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-12 03:48:09,130 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2022-07-12 03:48:09,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:09,131 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-12 03:48:09,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,132 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-12 03:48:09,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:48:09,133 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:09,133 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:09,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:09,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:48:09,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:09,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:09,381 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2022-07-12 03:48:09,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:09,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822579969] [2022-07-12 03:48:09,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:09,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:09,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:09,514 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:48:09,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:48:09,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822579969] [2022-07-12 03:48:09,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822579969] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 03:48:09,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757560391] [2022-07-12 03:48:09,515 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:48:09,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 03:48:09,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:48:09,517 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) [2022-07-12 03:48:09,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-12 03:48:09,575 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 03:48:09,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:48:09,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:48:09,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:48:09,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:48:09,638 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-07-12 03:48:09,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757560391] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:48:09,638 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 03:48:09,638 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 8 [2022-07-12 03:48:09,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671632305] [2022-07-12 03:48:09,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 03:48:09,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 03:48:09,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:48:09,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 03:48:09,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:48:09,640 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:09,720 INFO L93 Difference]: Finished difference Result 95 states and 111 transitions. [2022-07-12 03:48:09,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:48:09,720 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 03:48:09,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:09,721 INFO L225 Difference]: With dead ends: 95 [2022-07-12 03:48:09,721 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 03:48:09,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:48:09,722 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 71 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:09,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 59 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:48:09,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 03:48:09,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 40. [2022-07-12 03:48:09,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1538461538461537) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-07-12 03:48:09,727 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 34 [2022-07-12 03:48:09,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:09,727 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-07-12 03:48:09,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:09,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-07-12 03:48:09,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 03:48:09,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:09,729 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:09,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-12 03:48:09,946 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,SelfDestructingSolverStorable2 [2022-07-12 03:48:09,946 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:09,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:09,947 INFO L85 PathProgramCache]: Analyzing trace with hash -270804906, now seen corresponding path program 3 times [2022-07-12 03:48:09,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:48:09,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211843514] [2022-07-12 03:48:09,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:09,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:48:09,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:48:09,995 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:48:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:48:10,049 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:48:10,049 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:48:10,050 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:48:10,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 03:48:10,054 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1] [2022-07-12 03:48:10,056 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:48:10,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:48:10 BoogieIcfgContainer [2022-07-12 03:48:10,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:48:10,085 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:48:10,085 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:48:10,085 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:48:10,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:08" (3/4) ... [2022-07-12 03:48:10,087 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:48:10,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:48:10,088 INFO L158 Benchmark]: Toolchain (without parser) took 2446.09ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 89.5MB in the beginning and 116.8MB in the end (delta: -27.3MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,088 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 117.4MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:48:10,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 214.85ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 89.4MB in the beginning and 151.2MB in the end (delta: -61.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.95ms. Allocated memory is still 178.3MB. Free memory was 151.2MB in the beginning and 149.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:48:10,089 INFO L158 Benchmark]: Boogie Preprocessor took 28.77ms. Allocated memory is still 178.3MB. Free memory was 149.4MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,089 INFO L158 Benchmark]: RCFGBuilder took 371.35ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 135.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,089 INFO L158 Benchmark]: TraceAbstraction took 1786.32ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 117.6MB in the end (delta: 17.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,090 INFO L158 Benchmark]: Witness Printer took 2.45ms. Allocated memory is still 178.3MB. Free memory was 117.6MB in the beginning and 116.8MB in the end (delta: 723.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:48:10,091 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.17ms. Allocated memory is still 117.4MB. Free memory is still 75.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 214.85ms. Allocated memory was 117.4MB in the beginning and 178.3MB in the end (delta: 60.8MB). Free memory was 89.4MB in the beginning and 151.2MB in the end (delta: -61.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.95ms. Allocated memory is still 178.3MB. Free memory was 151.2MB in the beginning and 149.4MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 28.77ms. Allocated memory is still 178.3MB. Free memory was 149.4MB in the beginning and 148.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 371.35ms. Allocated memory is still 178.3MB. Free memory was 148.0MB in the beginning and 135.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1786.32ms. Allocated memory is still 178.3MB. Free memory was 135.2MB in the beginning and 117.6MB in the end (delta: 17.7MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Witness Printer took 2.45ms. Allocated memory is still 178.3MB. Free memory was 117.6MB in the beginning and 116.8MB in the end (delta: 723.8kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of shiftLeft at line 69. Possible FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={6:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={6:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={6:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={6:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={6:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=0, nc_B=0, string_A={6:0}, string_B={7:0}] [L55] COND FALSE !((inc_B-1)< main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fd601fa28543c13c2fbec075867019b65bb9d0c4bbf720a0162dbf887aa47892 [2022-07-12 03:48:12,560 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:48:12,575 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:48:12,577 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:48:12,578 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:48:12,580 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:48:12,581 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/string-2.i [2022-07-12 03:48:12,644 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8da0203/88491932549e48fe9f10b840d179cd2b/FLAG5ddc14593 [2022-07-12 03:48:13,042 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:48:13,043 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/string-2.i [2022-07-12 03:48:13,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8da0203/88491932549e48fe9f10b840d179cd2b/FLAG5ddc14593 [2022-07-12 03:48:13,445 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db8da0203/88491932549e48fe9f10b840d179cd2b [2022-07-12 03:48:13,447 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:48:13,448 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:48:13,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:48:13,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:48:13,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:48:13,459 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@252a8738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13, skipping insertion in model container [2022-07-12 03:48:13,460 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:48:13,477 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:48:13,577 WARN L230 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-2.i[896,909] [2022-07-12 03:48:13,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:48:13,633 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:48:13,645 WARN L230 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-2.i[896,909] [2022-07-12 03:48:13,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:48:13,680 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:48:13,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13 WrapperNode [2022-07-12 03:48:13,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:48:13,682 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:48:13,682 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:48:13,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:48:13,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,699 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,714 INFO L137 Inliner]: procedures = 17, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2022-07-12 03:48:13,715 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:48:13,716 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:48:13,716 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:48:13,716 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:48:13,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,745 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,755 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:48:13,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:48:13,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:48:13,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:48:13,761 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (1/1) ... [2022-07-12 03:48:13,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:48:13,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:48:13,796 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) [2022-07-12 03:48:13,814 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 [2022-07-12 03:48:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:48:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-12 03:48:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:48:13,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:48:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:48:13,829 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:48:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-12 03:48:13,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:48:13,898 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:48:13,899 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:48:14,035 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:48:14,039 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:48:14,039 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-12 03:48:14,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:14 BoogieIcfgContainer [2022-07-12 03:48:14,041 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:48:14,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:48:14,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:48:14,044 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:48:14,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:48:13" (1/3) ... [2022-07-12 03:48:14,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b84944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:14, skipping insertion in model container [2022-07-12 03:48:14,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:48:13" (2/3) ... [2022-07-12 03:48:14,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b84944d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:48:14, skipping insertion in model container [2022-07-12 03:48:14,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:14" (3/3) ... [2022-07-12 03:48:14,047 INFO L111 eAbstractionObserver]: Analyzing ICFG string-2.i [2022-07-12 03:48:14,057 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:48:14,057 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:48:14,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:48:14,101 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=PETRI_NET, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4348db0a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@15bfa523 [2022-07-12 03:48:14,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:48:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:48:14,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:14,109 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:14,109 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:14,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:14,113 INFO L85 PathProgramCache]: Analyzing trace with hash 374782792, now seen corresponding path program 1 times [2022-07-12 03:48:14,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:14,121 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1705809065] [2022-07-12 03:48:14,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:14,121 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:14,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:14,124 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:14,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:48:14,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:14,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:48:14,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:14,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:48:14,227 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:48:14,227 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:14,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1705809065] [2022-07-12 03:48:14,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1705809065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:14,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:14,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:48:14,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066182628] [2022-07-12 03:48:14,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:14,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:48:14,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:14,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:48:14,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:48:14,272 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 25 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:14,283 INFO L93 Difference]: Finished difference Result 48 states and 74 transitions. [2022-07-12 03:48:14,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:48:14,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:48:14,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:14,289 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:48:14,290 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:48:14,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:48:14,294 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:14,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:48:14,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:48:14,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:48:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-07-12 03:48:14,321 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 16 [2022-07-12 03:48:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:14,321 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-07-12 03:48:14,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-07-12 03:48:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 03:48:14,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:14,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:14,338 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 03:48:14,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:14,529 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:14,529 INFO L85 PathProgramCache]: Analyzing trace with hash 1602331574, now seen corresponding path program 1 times [2022-07-12 03:48:14,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:14,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119327153] [2022-07-12 03:48:14,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:14,530 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:14,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:14,534 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:14,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:48:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:14,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-12 03:48:14,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:14,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:48:14,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:48:14,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:14,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119327153] [2022-07-12 03:48:14,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [119327153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:14,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:14,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:48:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704152989] [2022-07-12 03:48:14,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:14,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 03:48:14,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:14,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 03:48:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:14,659 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:14,721 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-12 03:48:14,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 03:48:14,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 03:48:14,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:14,724 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:48:14,724 INFO L226 Difference]: Without dead ends: 32 [2022-07-12 03:48:14,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 03:48:14,725 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 7 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:14,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 31 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 03:48:14,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-12 03:48:14,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 24. [2022-07-12 03:48:14,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-07-12 03:48:14,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 18 [2022-07-12 03:48:14,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:14,730 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-07-12 03:48:14,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:14,730 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-07-12 03:48:14,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 03:48:14,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:14,748 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] [2022-07-12 03:48:14,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:14,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:14,956 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:14,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:14,956 INFO L85 PathProgramCache]: Analyzing trace with hash 177830358, now seen corresponding path program 1 times [2022-07-12 03:48:14,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:14,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315238250] [2022-07-12 03:48:14,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:14,959 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:14,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:14,960 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:14,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:48:15,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:15,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-12 03:48:15,052 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:15,076 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:48:15,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:48:15,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 03:48:15,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:15,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315238250] [2022-07-12 03:48:15,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315238250] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:48:15,130 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:48:15,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-07-12 03:48:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661803153] [2022-07-12 03:48:15,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:48:15,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:48:15,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:15,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:48:15,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:48:15,132 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:15,330 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-07-12 03:48:15,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:48:15,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 03:48:15,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:15,332 INFO L225 Difference]: With dead ends: 79 [2022-07-12 03:48:15,332 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 03:48:15,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:48:15,333 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:15,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 63 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:48:15,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 03:48:15,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 36. [2022-07-12 03:48:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-12 03:48:15,338 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 22 [2022-07-12 03:48:15,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:15,338 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-12 03:48:15,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,338 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-12 03:48:15,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 03:48:15,339 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:15,339 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:15,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:15,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:15,546 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:15,547 INFO L85 PathProgramCache]: Analyzing trace with hash -583604682, now seen corresponding path program 2 times [2022-07-12 03:48:15,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:15,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508437817] [2022-07-12 03:48:15,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:48:15,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:15,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:15,550 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:15,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:48:15,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 03:48:15,591 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:48:15,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 03:48:15,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:15,642 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-12 03:48:15,643 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:48:15,643 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:15,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508437817] [2022-07-12 03:48:15,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508437817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:15,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:15,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:48:15,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791522181] [2022-07-12 03:48:15,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:15,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:48:15,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:15,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:48:15,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:48:15,645 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:15,690 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2022-07-12 03:48:15,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:48:15,691 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 03:48:15,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:15,694 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:48:15,694 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 03:48:15,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:48:15,701 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:15,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:48:15,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 03:48:15,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 03:48:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2022-07-12 03:48:15,707 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 34 [2022-07-12 03:48:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:15,707 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2022-07-12 03:48:15,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2022-07-12 03:48:15,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-12 03:48:15,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:15,708 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:15,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:15,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:15,910 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:15,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:15,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1829932657, now seen corresponding path program 1 times [2022-07-12 03:48:15,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:15,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [771714957] [2022-07-12 03:48:15,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:15,913 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:15,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:15,916 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:15,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:48:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:15,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:48:15,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:48:16,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 03:48:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-07-12 03:48:16,100 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:16,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [771714957] [2022-07-12 03:48:16,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [771714957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 03:48:16,100 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-12 03:48:16,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-12 03:48:16,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918507128] [2022-07-12 03:48:16,101 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-12 03:48:16,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 03:48:16,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:16,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 03:48:16,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:48:16,102 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:16,353 INFO L93 Difference]: Finished difference Result 101 states and 117 transitions. [2022-07-12 03:48:16,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 03:48:16,354 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-12 03:48:16,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:16,355 INFO L225 Difference]: With dead ends: 101 [2022-07-12 03:48:16,355 INFO L226 Difference]: Without dead ends: 74 [2022-07-12 03:48:16,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-07-12 03:48:16,356 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 102 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:16,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 133 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 03:48:16,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-12 03:48:16,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 42. [2022-07-12 03:48:16,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-07-12 03:48:16,360 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 36 [2022-07-12 03:48:16,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:16,360 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-07-12 03:48:16,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,361 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-07-12 03:48:16,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-12 03:48:16,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:16,361 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:16,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-07-12 03:48:16,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:16,568 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:16,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:16,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1782806673, now seen corresponding path program 2 times [2022-07-12 03:48:16,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:16,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309246260] [2022-07-12 03:48:16,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 03:48:16,569 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:16,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:16,570 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:16,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:48:16,630 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 03:48:16,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 03:48:16,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:48:16,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:16,688 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 03:48:16,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:48:16,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:16,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309246260] [2022-07-12 03:48:16,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309246260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:16,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:16,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498921873] [2022-07-12 03:48:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:16,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:16,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:16,690 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:16,727 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-07-12 03:48:16,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:16,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-07-12 03:48:16,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:16,728 INFO L225 Difference]: With dead ends: 48 [2022-07-12 03:48:16,728 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 03:48:16,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:48:16,729 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:16,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:48:16,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 03:48:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2022-07-12 03:48:16,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-12 03:48:16,732 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 40 [2022-07-12 03:48:16,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:16,732 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-12 03:48:16,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-12 03:48:16,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 03:48:16,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:16,733 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:16,752 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:16,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:16,940 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash -364393356, now seen corresponding path program 1 times [2022-07-12 03:48:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:16,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298157731] [2022-07-12 03:48:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:16,942 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:16,943 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:16,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:48:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:48:17,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-12 03:48:17,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:48:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2022-07-12 03:48:17,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:48:17,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:48:17,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298157731] [2022-07-12 03:48:17,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298157731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:48:17,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:48:17,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:48:17,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187303798] [2022-07-12 03:48:17,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:48:17,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:48:17,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:48:17,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:48:17,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:17,055 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:17,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:48:17,072 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2022-07-12 03:48:17,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:48:17,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 03:48:17,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:48:17,073 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:48:17,073 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 03:48:17,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:48:17,073 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:48:17,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 49 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:48:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 03:48:17,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-12 03:48:17,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 50 transitions. [2022-07-12 03:48:17,077 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 50 transitions. Word has length 42 [2022-07-12 03:48:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:48:17,077 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 50 transitions. [2022-07-12 03:48:17,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:48:17,077 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 50 transitions. [2022-07-12 03:48:17,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-12 03:48:17,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:48:17,078 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:48:17,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-12 03:48:17,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:17,287 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:48:17,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:48:17,290 INFO L85 PathProgramCache]: Analyzing trace with hash -512239655, now seen corresponding path program 1 times [2022-07-12 03:48:17,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:48:17,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63619854] [2022-07-12 03:48:17,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:48:17,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:48:17,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:48:17,293 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:48:17,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:48:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:48:17,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:48:17,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:48:17,570 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-07-12 03:48:17,570 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:48:17,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:48:17,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:48:17,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:48:17,775 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1] [2022-07-12 03:48:17,778 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:48:17,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:48:17 BoogieIcfgContainer [2022-07-12 03:48:17,814 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:48:17,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:48:17,815 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:48:17,815 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:48:17,815 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:48:14" (3/4) ... [2022-07-12 03:48:17,816 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-12 03:48:17,857 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:48:17,857 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:48:17,857 INFO L158 Benchmark]: Toolchain (without parser) took 4409.77ms. Allocated memory was 54.5MB in the beginning and 96.5MB in the end (delta: 41.9MB). Free memory was 31.3MB in the beginning and 76.7MB in the end (delta: -45.3MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,858 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.8MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:48:17,858 INFO L158 Benchmark]: CACSL2BoogieTranslator took 232.02ms. Allocated memory was 54.5MB in the beginning and 79.7MB in the end (delta: 25.2MB). Free memory was 31.1MB in the beginning and 62.0MB in the end (delta: -30.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,858 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.77ms. Allocated memory is still 79.7MB. Free memory was 61.8MB in the beginning and 60.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:48:17,858 INFO L158 Benchmark]: Boogie Preprocessor took 43.03ms. Allocated memory is still 79.7MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,858 INFO L158 Benchmark]: RCFGBuilder took 281.01ms. Allocated memory is still 79.7MB. Free memory was 58.6MB in the beginning and 46.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,859 INFO L158 Benchmark]: TraceAbstraction took 3772.05ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 40.6MB in the end (delta: 5.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,859 INFO L158 Benchmark]: Witness Printer took 42.36ms. Allocated memory is still 96.5MB. Free memory was 40.6MB in the beginning and 76.7MB in the end (delta: -36.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. [2022-07-12 03:48:17,860 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.20ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.8MB in the end (delta: 37.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 232.02ms. Allocated memory was 54.5MB in the beginning and 79.7MB in the end (delta: 25.2MB). Free memory was 31.1MB in the beginning and 62.0MB in the end (delta: -30.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.77ms. Allocated memory is still 79.7MB. Free memory was 61.8MB in the beginning and 60.2MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.03ms. Allocated memory is still 79.7MB. Free memory was 60.2MB in the beginning and 58.8MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.01ms. Allocated memory is still 79.7MB. Free memory was 58.6MB in the beginning and 46.7MB in the end (delta: 11.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3772.05ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 46.3MB in the beginning and 40.6MB in the end (delta: 5.7MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. * Witness Printer took 42.36ms. Allocated memory is still 96.5MB. Free memory was 40.6MB in the beginning and 76.7MB in the end (delta: -36.0MB). Peak memory consumption was 4.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L31] char string_A[5], string_B[5]; [L32] int i, j, nc_A, nc_B, found=0; [L35] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=1, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=2, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=3, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=4, string_A={3:0}, string_B={7:0}] [L35] COND TRUE i<5 [L36] string_A[i]=__VERIFIER_nondet_char() [L35] i++ VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L35] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L37] EXPR string_A[5 -1] VAL [found=0, i=5, string_A={3:0}, string_A[5 -1]=0, string_B={7:0}] [L37] COND FALSE !(!(string_A[5 -1]=='\0')) [L39] i=0 VAL [found=0, i=0, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=1, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=2, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=3, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=4, string_A={3:0}, string_B={7:0}] [L39] COND TRUE i<5 [L40] string_B[i]=__VERIFIER_nondet_char() [L39] i++ VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L39] COND FALSE !(i<5) VAL [found=0, i=5, string_A={3:0}, string_B={7:0}] [L41] EXPR string_B[5 -1] VAL [found=0, i=5, string_A={3:0}, string_B={7:0}, string_B[5 -1]=0] [L41] COND FALSE !(!(string_B[5 -1]=='\0')) [L43] nc_A = 0 VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=0, string_A={3:0}, string_A[nc_A]=-128, string_B={7:0}] [L44] COND TRUE string_A[nc_A]!='\0' [L45] nc_A++ VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_B={7:0}] [L44] EXPR string_A[nc_A] VAL [found=0, i=5, nc_A=1, string_A={3:0}, string_A[nc_A]=0, string_B={7:0}] [L44] COND FALSE !(string_A[nc_A]!='\0') [L47] nc_B = 0 VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=0, string_A={3:0}, string_B={7:0}, string_B[nc_B]=-128] [L48] COND TRUE string_B[nc_B]!='\0' [L49] nc_B++ VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}] [L48] EXPR string_B[nc_B] VAL [found=0, i=5, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}, string_B[nc_B]=0] [L48] COND FALSE !(string_B[nc_B]!='\0') [L51] COND FALSE !(!(nc_B >= nc_A)) [L54] EXPR j=0 [L54] i=j=0 VAL [found=0, i=0, j=0, nc_A=1, nc_B=1, string_A={3:0}, string_B={7:0}] [L55] COND TRUE (inc_B-1)<