./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/veris.c_OpenSER_cases1_stripFullBoth_arr.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 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:00:33,704 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:00:33,706 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:00:33,728 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:00:33,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:00:33,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:00:33,736 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:00:33,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:00:33,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:00:33,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:00:33,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:00:33,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:00:33,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:00:33,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:00:33,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:00:33,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:00:33,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:00:33,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:00:33,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:00:33,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:00:33,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:00:33,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:00:33,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:00:33,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:00:33,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:00:33,764 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:00:33,764 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:00:33,765 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:00:33,765 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:00:33,766 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:00:33,766 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:00:33,767 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:00:33,768 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:00:33,769 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:00:33,770 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:00:33,770 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:00:33,771 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:00:33,771 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:00:33,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:00:33,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:00:33,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:00:33,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:00:33,800 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:00:33,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:00:33,801 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:00:33,801 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:00:33,801 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:00:33,802 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:00:33,802 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:00:33,802 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:00:33,802 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:00:33,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:00:33,803 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:00:33,803 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:00:33,803 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:00:33,804 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:00:33,805 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:00:33,805 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:00:33,805 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:00:33,805 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:00:33,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:00:33,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:00:33,806 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:00:33,807 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:00:33,808 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 -> 970cab0a23b690f163a0a51afef8881644c6447187bc11bbe1f60a2a40cf01a7 [2022-02-20 17:00:34,004 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:00:34,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:00:34,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:00:34,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:00:34,031 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:00:34,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-02-20 17:00:34,082 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0881b7ffc/02338f8d11af4650ae2a17a3d77c683a/FLAGceb313e3b [2022-02-20 17:00:34,448 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:00:34,449 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-02-20 17:00:34,453 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0881b7ffc/02338f8d11af4650ae2a17a3d77c683a/FLAGceb313e3b [2022-02-20 17:00:34,891 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0881b7ffc/02338f8d11af4650ae2a17a3d77c683a [2022-02-20 17:00:34,893 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:00:34,894 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:00:34,895 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:00:34,895 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:00:34,897 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:00:34,898 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:00:34" (1/1) ... [2022-02-20 17:00:34,899 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ae6a51f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:34, skipping insertion in model container [2022-02-20 17:00:34,899 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:00:34" (1/1) ... [2022-02-20 17:00:34,903 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:00:34,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:00:35,013 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/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-02-20 17:00:35,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:00:35,057 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:00:35,075 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/veris.c_OpenSER_cases1_stripFullBoth_arr.i[878,891] [2022-02-20 17:00:35,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:00:35,107 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:00:35,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35 WrapperNode [2022-02-20 17:00:35,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:00:35,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:00:35,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:00:35,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:00:35,113 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,167 INFO L137 Inliner]: procedures = 42, calls = 30, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 152 [2022-02-20 17:00:35,167 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:00:35,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:00:35,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:00:35,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:00:35,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,187 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:00:35,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:00:35,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:00:35,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:00:35,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (1/1) ... [2022-02-20 17:00:35,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:00:35,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:35,215 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-02-20 17:00:35,231 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-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2022-02-20 17:00:35,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:00:35,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:00:35,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 17:00:35,348 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:00:35,350 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:00:35,564 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:00:35,569 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:00:35,569 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 17:00:35,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:35 BoogieIcfgContainer [2022-02-20 17:00:35,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:00:35,572 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:00:35,572 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:00:35,574 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:00:35,574 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:00:34" (1/3) ... [2022-02-20 17:00:35,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21422bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:35, skipping insertion in model container [2022-02-20 17:00:35,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:35" (2/3) ... [2022-02-20 17:00:35,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21422bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:35, skipping insertion in model container [2022-02-20 17:00:35,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:35" (3/3) ... [2022-02-20 17:00:35,576 INFO L111 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2022-02-20 17:00:35,579 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:00:35,579 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:00:35,613 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:00:35,618 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:00:35,618 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:00:35,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 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-02-20 17:00:35,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 17:00:35,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:35,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:35,634 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:35,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:35,638 INFO L85 PathProgramCache]: Analyzing trace with hash 297203850, now seen corresponding path program 1 times [2022-02-20 17:00:35,644 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:35,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807967653] [2022-02-20 17:00:35,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:35,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:35,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:35,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {41#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {41#true} is VALID [2022-02-20 17:00:35,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {41#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {43#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:35,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !(main_~i~1#1 < 8); {42#false} is VALID [2022-02-20 17:00:35,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {42#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {42#false} is VALID [2022-02-20 17:00:35,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {42#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {42#false} is VALID [2022-02-20 17:00:35,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {42#false} is VALID [2022-02-20 17:00:35,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#false} assume parse_expression_list_#t~switch5#1; {42#false} is VALID [2022-02-20 17:00:35,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-02-20 17:00:35,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {42#false} is VALID [2022-02-20 17:00:35,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {42#false} is VALID [2022-02-20 17:00:35,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {42#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {42#false} is VALID [2022-02-20 17:00:35,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#false} assume !true; {42#false} is VALID [2022-02-20 17:00:35,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {42#false} is VALID [2022-02-20 17:00:35,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#false} assume parse_expression_list_#t~short18#1;call parse_expression_list_#t~mem17#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short18#1 := 34 == parse_expression_list_#t~mem17#1; {42#false} is VALID [2022-02-20 17:00:35,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#false} assume parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1;parse_expression_list_#t~post19#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post19#1 - 1;havoc parse_expression_list_#t~post19#1; {42#false} is VALID [2022-02-20 17:00:35,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {42#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {42#false} is VALID [2022-02-20 17:00:35,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {42#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {42#false} is VALID [2022-02-20 17:00:35,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {42#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {42#false} is VALID [2022-02-20 17:00:35,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {42#false} assume 0 == __VERIFIER_assert_~cond#1; {42#false} is VALID [2022-02-20 17:00:35,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2022-02-20 17:00:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:35,797 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:35,798 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807967653] [2022-02-20 17:00:35,798 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807967653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:00:35,798 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:00:35,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:00:35,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226449351] [2022-02-20 17:00:35,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:00:35,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 17:00:35,804 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:35,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-02-20 17:00:35,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:35,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:00:35,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:35,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:00:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:00:35,842 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 37 states have internal predecessors, (56), 0 states have call successors, (0), 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 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-02-20 17:00:35,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:35,938 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2022-02-20 17:00:35,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:00:35,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 17:00:35,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:35,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-02-20 17:00:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:00:35,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-02-20 17:00:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-20 17:00:35,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-20 17:00:36,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:36,065 INFO L225 Difference]: With dead ends: 74 [2022-02-20 17:00:36,065 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:00:36,067 INFO L932 BasicCegarLoop]: 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-02-20 17:00:36,071 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:36,072 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:00:36,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-20 17:00:36,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:36,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:36,129 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:36,129 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:36,132 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 17:00:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-20 17:00:36,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:36,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:36,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states. [2022-02-20 17:00:36,135 INFO L87 Difference]: Start difference. First operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 35 states. [2022-02-20 17:00:36,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:36,138 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 17:00:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-20 17:00:36,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:36,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:36,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:36,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:36,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:36,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2022-02-20 17:00:36,163 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 20 [2022-02-20 17:00:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:36,163 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2022-02-20 17:00:36,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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-02-20 17:00:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 17:00:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:00:36,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:36,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:36,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:00:36,170 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:36,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:36,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1628968459, now seen corresponding path program 1 times [2022-02-20 17:00:36,173 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:36,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745498655] [2022-02-20 17:00:36,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:36,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:36,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:36,260 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {247#true} is VALID [2022-02-20 17:00:36,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {249#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:36,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {249#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {249#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:36,263 INFO L290 TraceCheckUtils]: 3: Hoare triple {249#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {250#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:00:36,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {250#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 8); {248#false} is VALID [2022-02-20 17:00:36,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {248#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {248#false} is VALID [2022-02-20 17:00:36,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {248#false} is VALID [2022-02-20 17:00:36,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {248#false} is VALID [2022-02-20 17:00:36,264 INFO L290 TraceCheckUtils]: 8: Hoare triple {248#false} assume parse_expression_list_#t~switch5#1; {248#false} is VALID [2022-02-20 17:00:36,264 INFO L290 TraceCheckUtils]: 9: Hoare triple {248#false} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {248#false} is VALID [2022-02-20 17:00:36,265 INFO L290 TraceCheckUtils]: 10: Hoare triple {248#false} assume parse_expression_list_#t~short8#1; {248#false} is VALID [2022-02-20 17:00:36,265 INFO L290 TraceCheckUtils]: 11: Hoare triple {248#false} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {248#false} is VALID [2022-02-20 17:00:36,265 INFO L290 TraceCheckUtils]: 12: Hoare triple {248#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {248#false} is VALID [2022-02-20 17:00:36,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {248#false} is VALID [2022-02-20 17:00:36,266 INFO L290 TraceCheckUtils]: 14: Hoare triple {248#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {248#false} is VALID [2022-02-20 17:00:36,266 INFO L290 TraceCheckUtils]: 15: Hoare triple {248#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,266 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#false} assume !parse_expression_list_#t~short15#1; {248#false} is VALID [2022-02-20 17:00:36,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {248#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {248#false} is VALID [2022-02-20 17:00:36,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {248#false} assume parse_expression_list_#t~short18#1;call parse_expression_list_#t~mem17#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short18#1 := 34 == parse_expression_list_#t~mem17#1; {248#false} is VALID [2022-02-20 17:00:36,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {248#false} assume parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1;parse_expression_list_#t~post19#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post19#1 - 1;havoc parse_expression_list_#t~post19#1; {248#false} is VALID [2022-02-20 17:00:36,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {248#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {248#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {248#false} is VALID [2022-02-20 17:00:36,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {248#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {248#false} is VALID [2022-02-20 17:00:36,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {248#false} assume 0 == __VERIFIER_assert_~cond#1; {248#false} is VALID [2022-02-20 17:00:36,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-02-20 17:00:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:36,269 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:36,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745498655] [2022-02-20 17:00:36,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745498655] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:36,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621642338] [2022-02-20 17:00:36,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:36,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:36,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:36,288 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-02-20 17:00:36,319 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-02-20 17:00:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:36,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 17:00:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:36,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:36,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {247#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 1: Hoare triple {247#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 2: Hoare triple {247#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#true} assume !(main_~i~1#1 < 8); {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#true} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {247#true} is VALID [2022-02-20 17:00:36,420 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#true} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {247#true} is VALID [2022-02-20 17:00:36,421 INFO L290 TraceCheckUtils]: 7: Hoare triple {247#true} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {247#true} is VALID [2022-02-20 17:00:36,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {247#true} assume parse_expression_list_#t~switch5#1; {247#true} is VALID [2022-02-20 17:00:36,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {247#true} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {247#true} is VALID [2022-02-20 17:00:36,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {247#true} assume parse_expression_list_#t~short8#1; {284#|ULTIMATE.start_parse_expression_list_#t~short8#1|} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#|ULTIMATE.start_parse_expression_list_#t~short8#1|} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 12: Hoare triple {248#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 13: Hoare triple {248#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {248#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {248#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {248#false} assume !parse_expression_list_#t~short15#1; {248#false} is VALID [2022-02-20 17:00:36,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {248#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {248#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {248#false} assume parse_expression_list_#t~short18#1;call parse_expression_list_#t~mem17#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short18#1 := 34 == parse_expression_list_#t~mem17#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {248#false} assume parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1;parse_expression_list_#t~post19#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post19#1 - 1;havoc parse_expression_list_#t~post19#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {248#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 22: Hoare triple {248#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 23: Hoare triple {248#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {248#false} is VALID [2022-02-20 17:00:36,423 INFO L290 TraceCheckUtils]: 24: Hoare triple {248#false} assume 0 == __VERIFIER_assert_~cond#1; {248#false} is VALID [2022-02-20 17:00:36,424 INFO L290 TraceCheckUtils]: 25: Hoare triple {248#false} assume !false; {248#false} is VALID [2022-02-20 17:00:36,424 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:00:36,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:00:36,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621642338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:00:36,424 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:00:36,424 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-02-20 17:00:36,425 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505778482] [2022-02-20 17:00:36,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:00:36,426 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 26 [2022-02-20 17:00:36,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:36,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-02-20 17:00:36,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:36,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:00:36,454 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:36,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:00:36,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:00:36,454 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-02-20 17:00:36,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:36,494 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-02-20 17:00:36,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:00:36,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 26 [2022-02-20 17:00:36,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-02-20 17:00:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 17:00:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-02-20 17:00:36,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 17:00:36,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 17:00:36,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:36,551 INFO L225 Difference]: With dead ends: 62 [2022-02-20 17:00:36,551 INFO L226 Difference]: Without dead ends: 35 [2022-02-20 17:00:36,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:00:36,553 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:36,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:36,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-20 17:00:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-02-20 17:00:36,556 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:36,556 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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-02-20 17:00:36,556 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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-02-20 17:00:36,556 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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-02-20 17:00:36,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:36,557 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 17:00:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-20 17:00:36,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:36,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:36,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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) Second operand 35 states. [2022-02-20 17:00:36,558 INFO L87 Difference]: Start difference. First operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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) Second operand 35 states. [2022-02-20 17:00:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:36,559 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2022-02-20 17:00:36,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-20 17:00:36,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:36,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:36,560 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:36,560 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:36,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 34 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-02-20 17:00:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2022-02-20 17:00:36,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 26 [2022-02-20 17:00:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:36,561 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2022-02-20 17:00:36,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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-02-20 17:00:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2022-02-20 17:00:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:00:36,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:36,562 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:36,593 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-02-20 17:00:36,829 WARN L452 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-02-20 17:00:36,830 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:36,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:36,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1644930483, now seen corresponding path program 1 times [2022-02-20 17:00:36,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:36,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685112244] [2022-02-20 17:00:36,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:36,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:36,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {515#true} is VALID [2022-02-20 17:00:36,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {517#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:36,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {517#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {517#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:36,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {517#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {518#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:00:36,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {518#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 8); {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#false} assume parse_expression_list_#t~switch5#1; {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#false} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {516#false} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#false} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {516#false} is VALID [2022-02-20 17:00:36,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {516#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {516#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {516#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {516#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 16: Hoare triple {516#false} assume !parse_expression_list_#t~short15#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 17: Hoare triple {516#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 18: Hoare triple {516#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {516#false} assume parse_expression_list_#t~short18#1;call parse_expression_list_#t~mem17#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short18#1 := 34 == parse_expression_list_#t~mem17#1; {516#false} is VALID [2022-02-20 17:00:36,909 INFO L290 TraceCheckUtils]: 20: Hoare triple {516#false} assume parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1;parse_expression_list_#t~post19#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post19#1 - 1;havoc parse_expression_list_#t~post19#1; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {516#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {516#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L290 TraceCheckUtils]: 23: Hoare triple {516#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {516#false} assume 0 == __VERIFIER_assert_~cond#1; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 17:00:36,910 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:36,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:36,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685112244] [2022-02-20 17:00:36,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685112244] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:36,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956968565] [2022-02-20 17:00:36,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:36,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:36,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:36,924 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-02-20 17:00:36,932 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-02-20 17:00:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:36,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:00:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:37,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:37,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {515#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {515#true} is VALID [2022-02-20 17:00:37,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {515#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {515#true} is VALID [2022-02-20 17:00:37,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {515#true} is VALID [2022-02-20 17:00:37,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {515#true} is VALID [2022-02-20 17:00:37,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {515#true} assume !(main_~i~1#1 < 8); {515#true} is VALID [2022-02-20 17:00:37,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {515#true} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {515#true} is VALID [2022-02-20 17:00:37,148 INFO L290 TraceCheckUtils]: 6: Hoare triple {515#true} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {515#true} is VALID [2022-02-20 17:00:37,149 INFO L290 TraceCheckUtils]: 7: Hoare triple {515#true} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {515#true} is VALID [2022-02-20 17:00:37,149 INFO L290 TraceCheckUtils]: 8: Hoare triple {515#true} assume parse_expression_list_#t~switch5#1; {515#true} is VALID [2022-02-20 17:00:37,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {515#true} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {515#true} is VALID [2022-02-20 17:00:37,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {515#true} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {515#true} is VALID [2022-02-20 17:00:37,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {515#true} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {515#true} is VALID [2022-02-20 17:00:37,150 INFO L290 TraceCheckUtils]: 12: Hoare triple {515#true} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {515#true} is VALID [2022-02-20 17:00:37,151 INFO L290 TraceCheckUtils]: 13: Hoare triple {515#true} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {515#true} is VALID [2022-02-20 17:00:37,151 INFO L290 TraceCheckUtils]: 14: Hoare triple {515#true} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {515#true} is VALID [2022-02-20 17:00:37,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {515#true} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {567#(or (and (not |ULTIMATE.start_parse_expression_list_#t~short15#1|) (not (< 0 |ULTIMATE.start_parse_expression_list_~j~0#1|))) (and (< 0 |ULTIMATE.start_parse_expression_list_~j~0#1|) |ULTIMATE.start_parse_expression_list_#t~short15#1|))} is VALID [2022-02-20 17:00:37,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {567#(or (and (not |ULTIMATE.start_parse_expression_list_#t~short15#1|) (not (< 0 |ULTIMATE.start_parse_expression_list_~j~0#1|))) (and (< 0 |ULTIMATE.start_parse_expression_list_~j~0#1|) |ULTIMATE.start_parse_expression_list_#t~short15#1|))} assume !parse_expression_list_#t~short15#1; {571#(<= |ULTIMATE.start_parse_expression_list_~j~0#1| 0)} is VALID [2022-02-20 17:00:37,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {571#(<= |ULTIMATE.start_parse_expression_list_~j~0#1| 0)} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {571#(<= |ULTIMATE.start_parse_expression_list_~j~0#1| 0)} is VALID [2022-02-20 17:00:37,155 INFO L290 TraceCheckUtils]: 18: Hoare triple {571#(<= |ULTIMATE.start_parse_expression_list_~j~0#1| 0)} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {578#(not |ULTIMATE.start_parse_expression_list_#t~short18#1|)} is VALID [2022-02-20 17:00:37,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {578#(not |ULTIMATE.start_parse_expression_list_#t~short18#1|)} assume parse_expression_list_#t~short18#1;call parse_expression_list_#t~mem17#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~j~0#1, 1);parse_expression_list_#t~short18#1 := 34 == parse_expression_list_#t~mem17#1; {516#false} is VALID [2022-02-20 17:00:37,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {516#false} assume parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1;parse_expression_list_#t~post19#1 := parse_expression_list_~j~0#1;parse_expression_list_~j~0#1 := parse_expression_list_#t~post19#1 - 1;havoc parse_expression_list_#t~post19#1; {516#false} is VALID [2022-02-20 17:00:37,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {516#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {516#false} is VALID [2022-02-20 17:00:37,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {516#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {516#false} is VALID [2022-02-20 17:00:37,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {516#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {516#false} is VALID [2022-02-20 17:00:37,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {516#false} assume 0 == __VERIFIER_assert_~cond#1; {516#false} is VALID [2022-02-20 17:00:37,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {516#false} assume !false; {516#false} is VALID [2022-02-20 17:00:37,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:00:37,156 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:00:37,156 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1956968565] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:00:37,163 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:00:37,163 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2022-02-20 17:00:37,163 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576396107] [2022-02-20 17:00:37,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:00:37,163 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 26 [2022-02-20 17:00:37,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:37,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-02-20 17:00:37,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:37,182 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:00:37,182 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:37,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:00:37,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:00:37,183 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-02-20 17:00:37,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:37,321 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 17:00:37,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:00:37,321 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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 26 [2022-02-20 17:00:37,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-02-20 17:00:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-02-20 17:00:37,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-02-20 17:00:37,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-02-20 17:00:37,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-02-20 17:00:37,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:37,434 INFO L225 Difference]: With dead ends: 88 [2022-02-20 17:00:37,434 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 17:00:37,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:00:37,437 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:37,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 113 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 17:00:37,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2022-02-20 17:00:37,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:37,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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-02-20 17:00:37,445 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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-02-20 17:00:37,445 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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-02-20 17:00:37,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:37,448 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-02-20 17:00:37,448 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-02-20 17:00:37,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:37,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:37,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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 60 states. [2022-02-20 17:00:37,452 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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 60 states. [2022-02-20 17:00:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:37,455 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-02-20 17:00:37,455 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-02-20 17:00:37,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:37,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:37,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:37,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:37,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 38 states have internal predecessors, (49), 0 states have call successors, (0), 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-02-20 17:00:37,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2022-02-20 17:00:37,458 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 26 [2022-02-20 17:00:37,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:37,458 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2022-02-20 17:00:37,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 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-02-20 17:00:37,459 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2022-02-20 17:00:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:00:37,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:37,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:37,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:00:37,675 WARN L452 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-02-20 17:00:37,676 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:37,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:37,677 INFO L85 PathProgramCache]: Analyzing trace with hash -817771149, now seen corresponding path program 1 times [2022-02-20 17:00:37,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:37,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362852188] [2022-02-20 17:00:37,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:37,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:37,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {873#true} is VALID [2022-02-20 17:00:37,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {875#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:37,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {875#(= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {875#(= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:37,714 INFO L290 TraceCheckUtils]: 3: Hoare triple {875#(= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {876#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:00:37,714 INFO L290 TraceCheckUtils]: 4: Hoare triple {876#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 8); {874#false} is VALID [2022-02-20 17:00:37,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {874#false} is VALID [2022-02-20 17:00:37,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {874#false} is VALID [2022-02-20 17:00:37,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {874#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#false} assume parse_expression_list_#t~switch5#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#false} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {874#false} is VALID [2022-02-20 17:00:37,715 INFO L290 TraceCheckUtils]: 14: Hoare triple {874#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {874#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {874#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {874#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {874#false} is VALID [2022-02-20 17:00:37,717 INFO L290 TraceCheckUtils]: 23: Hoare triple {874#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 17:00:37,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 17:00:37,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 17:00:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:37,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:37,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362852188] [2022-02-20 17:00:37,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362852188] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:37,718 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1823287704] [2022-02-20 17:00:37,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:37,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:37,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:37,719 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:00:37,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 17:00:37,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:37,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:00:37,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:37,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:37,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {873#true} is VALID [2022-02-20 17:00:37,847 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {883#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:37,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#(<= |ULTIMATE.start_main_~i~1#1| 0)} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {883#(<= |ULTIMATE.start_main_~i~1#1| 0)} is VALID [2022-02-20 17:00:37,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#(<= |ULTIMATE.start_main_~i~1#1| 0)} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {876#(<= |ULTIMATE.start_main_~i~1#1| 1)} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {876#(<= |ULTIMATE.start_main_~i~1#1| 1)} assume !(main_~i~1#1 < 8); {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {874#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#false} assume parse_expression_list_#t~switch5#1; {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#false} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {874#false} is VALID [2022-02-20 17:00:37,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {874#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {874#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {874#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {874#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {874#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 17:00:37,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:37,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {874#false} assume !false; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {874#false} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {874#false} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {874#false} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {874#false} assume !parse_expression_list_#t~short18#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {874#false} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {874#false} assume !parse_expression_list_#t~short15#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {874#false} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {874#false} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 13: Hoare triple {874#false} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {874#false} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {874#false} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {874#false} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {874#false} is VALID [2022-02-20 17:00:37,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {874#false} assume parse_expression_list_#t~switch5#1; {874#false} is VALID [2022-02-20 17:00:37,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {874#false} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {874#false} is VALID [2022-02-20 17:00:37,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {874#false} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {874#false} is VALID [2022-02-20 17:00:37,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {874#false} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {874#false} is VALID [2022-02-20 17:00:37,952 INFO L290 TraceCheckUtils]: 4: Hoare triple {1019#(< |ULTIMATE.start_main_~i~1#1| 8)} assume !(main_~i~1#1 < 8); {874#false} is VALID [2022-02-20 17:00:37,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {1023#(< |ULTIMATE.start_main_~i~1#1| 7)} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {1019#(< |ULTIMATE.start_main_~i~1#1| 8)} is VALID [2022-02-20 17:00:37,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {1023#(< |ULTIMATE.start_main_~i~1#1| 7)} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {1023#(< |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 17:00:37,953 INFO L290 TraceCheckUtils]: 1: Hoare triple {873#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {1023#(< |ULTIMATE.start_main_~i~1#1| 7)} is VALID [2022-02-20 17:00:37,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {873#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {873#true} is VALID [2022-02-20 17:00:37,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:37,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1823287704] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:37,954 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:37,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 17:00:37,954 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174072700] [2022-02-20 17:00:37,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:37,954 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 17:00:37,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:37,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:37,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:37,972 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:00:37,972 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:37,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:00:37,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:00:37,972 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,031 INFO L93 Difference]: Finished difference Result 79 states and 101 transitions. [2022-02-20 17:00:38,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:00:38,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 17:00:38,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:38,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 17:00:38,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2022-02-20 17:00:38,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 91 transitions. [2022-02-20 17:00:38,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:38,111 INFO L225 Difference]: With dead ends: 79 [2022-02-20 17:00:38,111 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 17:00:38,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 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-02-20 17:00:38,112 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:38,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 119 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:38,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 17:00:38,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-02-20 17:00:38,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:38,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-20 17:00:38,118 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-20 17:00:38,119 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-20 17:00:38,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,119 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 17:00:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 17:00:38,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:38,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:38,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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 45 states. [2022-02-20 17:00:38,120 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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 45 states. [2022-02-20 17:00:38,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,121 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 17:00:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 17:00:38,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:38,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:38,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:38,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:38,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.25) internal successors, (55), 44 states have internal predecessors, (55), 0 states have call successors, (0), 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-02-20 17:00:38,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-02-20 17:00:38,122 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 26 [2022-02-20 17:00:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:38,123 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-02-20 17:00:38,123 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 7 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-02-20 17:00:38,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 17:00:38,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:38,124 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:38,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 17:00:38,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:38,335 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:38,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:38,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2006005895, now seen corresponding path program 2 times [2022-02-20 17:00:38,335 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:38,335 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958761769] [2022-02-20 17:00:38,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:38,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:38,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:38,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {1271#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2); {1271#true} is VALID [2022-02-20 17:00:38,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {1271#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet22#1, main_#t~post21#1, main_~i~1#1, main_#t~ret23#1, main_~#A~0#1.base, main_~#A~0#1.offset;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(9);main_~i~1#1 := 0; {1271#true} is VALID [2022-02-20 17:00:38,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {1271#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {1271#true} is VALID [2022-02-20 17:00:38,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {1271#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {1271#true} is VALID [2022-02-20 17:00:38,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {1271#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 6: Hoare triple {1271#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 7: Hoare triple {1271#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 8: Hoare triple {1271#true} assume !!(main_~i~1#1 < 8);assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;call write~int(main_#t~nondet22#1, main_~#A~0#1.base, main_~#A~0#1.offset + main_~i~1#1, 1);havoc main_#t~nondet22#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {1271#true} main_#t~post21#1 := main_~i~1#1;main_~i~1#1 := 1 + main_#t~post21#1;havoc main_#t~post21#1; {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {1271#true} assume !(main_~i~1#1 < 8); {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {1271#true} call write~int(0, main_~#A~0#1.base, 8 + main_~#A~0#1.offset, 1);assume { :begin_inline_parse_expression_list } true;parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset := main_~#A~0#1.base, main_~#A~0#1.offset;havoc parse_expression_list_#res#1;havoc parse_expression_list_#t~post3#1, parse_expression_list_#t~mem4#1, parse_expression_list_#t~switch5#1, parse_expression_list_#t~post9#1, parse_expression_list_#t~mem6#1, parse_expression_list_#t~mem7#1, parse_expression_list_#t~short8#1, parse_expression_list_#t~mem10#1, parse_expression_list_#t~post11#1, parse_expression_list_#t~post16#1, parse_expression_list_#t~mem12#1, parse_expression_list_#t~mem13#1, parse_expression_list_#t~short14#1, parse_expression_list_#t~short15#1, parse_expression_list_#t~mem17#1, parse_expression_list_#t~short18#1, parse_expression_list_#t~post19#1, parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset, parse_expression_list_#t~mem2#1, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset, parse_expression_list_~start~0#1, parse_expression_list_~i~0#1, parse_expression_list_~j~0#1, parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset;parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset := parse_expression_list_#in~str#1.base, parse_expression_list_#in~str#1.offset;parse_expression_list_~start~0#1 := 0;parse_expression_list_~i~0#1 := -1;parse_expression_list_~j~0#1 := -1;call parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset := #Ultimate.allocOnStack(2); {1271#true} is VALID [2022-02-20 17:00:38,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {1271#true} assume !(parse_expression_list_~str#1.base == 0 && parse_expression_list_~str#1.offset == 0); {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 13: Hoare triple {1271#true} parse_expression_list_#t~post3#1 := parse_expression_list_~i~0#1;parse_expression_list_~i~0#1 := 1 + parse_expression_list_#t~post3#1;havoc parse_expression_list_#t~post3#1;call parse_expression_list_#t~mem4#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~i~0#1, 1);parse_expression_list_#t~switch5#1 := 0 == parse_expression_list_#t~mem4#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {1271#true} assume parse_expression_list_#t~switch5#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {1271#true} call parse_expression_list_#t~mem6#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 32 == parse_expression_list_#t~mem6#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {1271#true} assume !parse_expression_list_#t~short8#1;call parse_expression_list_#t~mem7#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1);parse_expression_list_#t~short8#1 := 9 == parse_expression_list_#t~mem7#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {1271#true} assume !parse_expression_list_#t~short8#1;havoc parse_expression_list_#t~mem6#1;havoc parse_expression_list_#t~mem7#1;havoc parse_expression_list_#t~short8#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {1271#true} call parse_expression_list_#t~mem10#1 := read~int(parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1); {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {1271#true} assume 34 == parse_expression_list_#t~mem10#1;havoc parse_expression_list_#t~mem10#1;parse_expression_list_#t~post11#1 := parse_expression_list_~start~0#1;parse_expression_list_~start~0#1 := 1 + parse_expression_list_#t~post11#1;havoc parse_expression_list_#t~post11#1; {1271#true} is VALID [2022-02-20 17:00:38,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {1271#true} parse_expression_list_~j~0#1 := parse_expression_list_~i~0#1 - 1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {1271#true} parse_expression_list_#t~short15#1 := 0 < parse_expression_list_~j~0#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 22: Hoare triple {1271#true} assume !parse_expression_list_#t~short15#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 23: Hoare triple {1271#true} assume !parse_expression_list_#t~short15#1;havoc parse_expression_list_#t~mem12#1;havoc parse_expression_list_#t~mem13#1;havoc parse_expression_list_#t~short14#1;havoc parse_expression_list_#t~short15#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1271#true} parse_expression_list_#t~short18#1 := 0 < parse_expression_list_~j~0#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 25: Hoare triple {1271#true} assume !parse_expression_list_#t~short18#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 26: Hoare triple {1271#true} assume !parse_expression_list_#t~short18#1;havoc parse_expression_list_#t~mem17#1;havoc parse_expression_list_#t~short18#1; {1271#true} is VALID [2022-02-20 17:00:38,447 INFO L290 TraceCheckUtils]: 27: Hoare triple {1271#true} assume parse_expression_list_~start~0#1 <= parse_expression_list_~j~0#1; {1271#true} is VALID [2022-02-20 17:00:38,448 INFO L290 TraceCheckUtils]: 28: Hoare triple {1271#true} assume !(1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) >= 2);assume { :begin_inline_r_strncpy } true;r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset, r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset, r_strncpy_#in~n#1 := parse_expression_list_~#str2~0#1.base, parse_expression_list_~#str2~0#1.offset, parse_expression_list_~str#1.base, parse_expression_list_~str#1.offset + parse_expression_list_~start~0#1, 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1);havoc r_strncpy_#res#1.base, r_strncpy_#res#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset, r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1;r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset := r_strncpy_#in~dest#1.base, r_strncpy_#in~dest#1.offset;r_strncpy_~src#1.base, r_strncpy_~src#1.offset := r_strncpy_#in~src#1.base, r_strncpy_#in~src#1.offset;r_strncpy_~n#1 := r_strncpy_#in~n#1;call r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset := strncpy(r_strncpy_~dest#1.base, r_strncpy_~dest#1.offset, r_strncpy_~src#1.base, r_strncpy_~src#1.offset, r_strncpy_~n#1);r_strncpy_#res#1.base, r_strncpy_#res#1.offset := r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset;havoc r_strncpy_#t~ret1#1.base, r_strncpy_#t~ret1#1.offset; {1273#(not (<= (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1) |ULTIMATE.start_parse_expression_list_~j~0#1|))} is VALID [2022-02-20 17:00:38,448 INFO L290 TraceCheckUtils]: 29: Hoare triple {1273#(not (<= (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1) |ULTIMATE.start_parse_expression_list_~j~0#1|))} parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset := r_strncpy_#res#1.base, r_strncpy_#res#1.offset;assume { :end_inline_r_strncpy } true;havoc parse_expression_list_#t~ret20#1.base, parse_expression_list_#t~ret20#1.offset;assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 1 + (parse_expression_list_~j~0#1 - parse_expression_list_~start~0#1) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1274#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} is VALID [2022-02-20 17:00:38,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {1274#(not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0))} assume 0 == __VERIFIER_assert_~cond#1; {1272#false} is VALID [2022-02-20 17:00:38,449 INFO L290 TraceCheckUtils]: 31: Hoare triple {1272#false} assume !false; {1272#false} is VALID [2022-02-20 17:00:38,449 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-02-20 17:00:38,449 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:38,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958761769] [2022-02-20 17:00:38,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958761769] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:00:38,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:00:38,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 17:00:38,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365269725] [2022-02-20 17:00:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:00:38,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 32 [2022-02-20 17:00:38,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:38,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-02-20 17:00:38,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:38,466 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 17:00:38,466 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:38,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 17:00:38,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:00:38,467 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-02-20 17:00:38,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,597 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-02-20 17:00:38,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:00:38,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 32 [2022-02-20 17:00:38,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-02-20 17:00:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 17:00:38,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-02-20 17:00:38,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 17:00:38,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-02-20 17:00:38,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:38,647 INFO L225 Difference]: With dead ends: 72 [2022-02-20 17:00:38,647 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:00:38,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-02-20 17:00:38,648 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:38,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 121 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:38,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:00:38,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:00:38,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:38,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,649 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,649 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,649 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:00:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:00:38,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:38,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:38,649 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:00:38,649 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 17:00:38,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:38,649 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:00:38,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:00:38,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:38,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:38,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:38,649 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:38,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:38,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:00:38,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2022-02-20 17:00:38,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:38,650 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:00:38,650 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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-02-20 17:00:38,650 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:00:38,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:38,651 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:00:38,652 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 17:00:38,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:00:38,676 INFO L861 garLoopResultBuilder]: At program point L85(lines 58 86) the Hoare annotation is: true [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point L70-1(line 70) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point L70-2(line 70) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point L70-4(line 70) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point L70-6(line 70) no Hoare annotation was computed. [2022-02-20 17:00:38,676 INFO L861 garLoopResultBuilder]: At program point L95(lines 87 96) the Hoare annotation is: true [2022-02-20 17:00:38,676 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L861 garLoopResultBuilder]: At program point L70-8(line 70) the Hoare annotation is: true [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L70-9(line 70) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L71-2(line 71) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L71-4(lines 65 83) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L63-1(lines 63 84) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 63 84) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L854 garLoopResultBuilder]: At program point L63-4(lines 63 84) the Hoare annotation is: (or (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (<= (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1) |ULTIMATE.start_parse_expression_list_~j~0#1|))) [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L63-5(lines 63 84) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 81) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L15(lines 15 17) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L854 garLoopResultBuilder]: At program point L15-2(lines 14 19) the Hoare annotation is: (and (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (<= (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1) |ULTIMATE.start_parse_expression_list_~j~0#1|))) [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L65(lines 65 83) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L90-2(lines 90 92) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L861 garLoopResultBuilder]: At program point L90-3(lines 90 92) the Hoare annotation is: true [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L90-4(lines 90 92) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point L66(line 66) no Hoare annotation was computed. [2022-02-20 17:00:38,677 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:00:38,678 INFO L854 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (< |ULTIMATE.start_parse_expression_list_~j~0#1| (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1)) [2022-02-20 17:00:38,678 INFO L858 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2022-02-20 17:00:38,678 INFO L858 garLoopResultBuilder]: For program point L67-3(line 67) no Hoare annotation was computed. [2022-02-20 17:00:38,678 INFO L854 garLoopResultBuilder]: At program point L67-5(line 67) the Hoare annotation is: (or (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (not (<= (+ |ULTIMATE.start_parse_expression_list_~start~0#1| 1) |ULTIMATE.start_parse_expression_list_~j~0#1|))) [2022-02-20 17:00:38,678 INFO L858 garLoopResultBuilder]: For program point L67-6(line 67) no Hoare annotation was computed. [2022-02-20 17:00:38,678 INFO L858 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2022-02-20 17:00:38,678 INFO L858 garLoopResultBuilder]: For program point L68-2(line 68) no Hoare annotation was computed. [2022-02-20 17:00:38,680 INFO L732 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2022-02-20 17:00:38,681 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:00:38,682 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L90-4 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L63-5 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L63-5 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-6 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L65 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-6 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L63-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L68 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L68-2 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L70-9 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L70-9 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L70-1 has no Hoare annotation [2022-02-20 17:00:38,683 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L70-2 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L70-6 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L70-6 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L71-2 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L70-4 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L71-4 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L71-4 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 17:00:38,684 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 17:00:38,684 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:00:38,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:00:38 BoogieIcfgContainer [2022-02-20 17:00:38,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:00:38,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:00:38,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:00:38,690 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:00:38,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:35" (3/4) ... [2022-02-20 17:00:38,692 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:00:38,698 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-02-20 17:00:38,699 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:00:38,699 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:00:38,699 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:00:38,724 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:00:38,725 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:00:38,725 INFO L158 Benchmark]: Toolchain (without parser) took 3831.37ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 89.3MB in the beginning and 75.5MB in the end (delta: 13.9MB). Peak memory consumption was 81.2MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,725 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 99.4MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:00:38,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.02ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 96.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,726 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.53ms. Allocated memory is still 125.8MB. Free memory was 96.6MB in the beginning and 93.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,726 INFO L158 Benchmark]: Boogie Preprocessor took 21.90ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,726 INFO L158 Benchmark]: RCFGBuilder took 380.37ms. Allocated memory is still 125.8MB. Free memory was 92.4MB in the beginning and 76.4MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,726 INFO L158 Benchmark]: TraceAbstraction took 3118.30ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 76.4MB in the beginning and 78.6MB in the end (delta: -2.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,727 INFO L158 Benchmark]: Witness Printer took 34.21ms. Allocated memory is still 195.0MB. Free memory was 78.6MB in the beginning and 75.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 17:00:38,728 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 99.4MB in the beginning and 99.4MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.02ms. Allocated memory is still 125.8MB. Free memory was 89.0MB in the beginning and 96.6MB in the end (delta: -7.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.53ms. Allocated memory is still 125.8MB. Free memory was 96.6MB in the beginning and 93.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.90ms. Allocated memory is still 125.8MB. Free memory was 93.8MB in the beginning and 92.4MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 380.37ms. Allocated memory is still 125.8MB. Free memory was 92.4MB in the beginning and 76.4MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3118.30ms. Allocated memory was 125.8MB in the beginning and 195.0MB in the end (delta: 69.2MB). Free memory was 76.4MB in the beginning and 78.6MB in the end (delta: -2.2MB). Peak memory consumption was 67.0MB. Max. memory is 16.1GB. * Witness Printer took 34.21ms. Allocated memory is still 195.0MB. Free memory was 78.6MB in the beginning and 75.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.1s, OverallIterations: 5, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 84 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 528 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 301 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 111 IncrementalHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 227 mSDtfsCounter, 111 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 123 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 23 NumberOfFragments, 42 HoareAnnotationTreeSize, 8 FomulaSimplifications, 13 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 282 SizeOfPredicates, 2 NumberOfNonLiveVariables, 406 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 18/23 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: !(cond == 0) || !(start + 1 <= j) - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: !(cond == 0) || !(start + 1 <= j) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: j < start + 1 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: !(cond == 0) && !(start + 1 <= j) - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:00:38,758 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE