./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 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:12:40,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:12:40,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:12:40,100 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:12:40,100 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:12:40,101 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:12:40,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:12:40,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:12:40,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:12:40,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:12:40,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:12:40,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:12:40,111 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:12:40,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:12:40,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:12:40,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:12:40,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:12:40,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:12:40,118 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:12:40,120 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:12:40,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:12:40,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:12:40,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:12:40,125 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:12:40,128 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:12:40,128 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:12:40,129 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:12:40,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:12:40,130 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:12:40,131 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:12:40,131 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:12:40,132 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:12:40,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:12:40,134 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:12:40,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:12:40,135 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:12:40,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:12:40,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:12:40,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:12:40,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:12:40,138 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:12:40,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:12:40,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:12:40,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:12:40,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:12:40,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:12:40,160 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:12:40,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:12:40,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:12:40,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:12:40,161 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:12:40,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:12:40,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:12:40,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:12:40,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:12:40,163 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:12:40,163 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:12:40,163 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:12:40,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:12:40,164 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:12:40,164 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:12:40,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:12:40,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:12:40,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:40,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:12:40,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:12:40,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:12:40,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:12:40,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:12:40,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:12:40,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:12:40,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 6450f1ab8e8876cd25bd9465d040f8eaf1b1860b [2020-07-28 18:12:40,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:12:40,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:12:40,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:12:40,511 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:12:40,511 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:12:40,512 INFO L429 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 [2020-07-28 18:12:40,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab4294b4/8a163bfde2ae40169e39b15b15859b1c/FLAG24eaad0b1 [2020-07-28 18:12:41,084 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:12:41,085 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-28 18:12:41,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab4294b4/8a163bfde2ae40169e39b15b15859b1c/FLAG24eaad0b1 [2020-07-28 18:12:41,415 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ab4294b4/8a163bfde2ae40169e39b15b15859b1c [2020-07-28 18:12:41,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:12:41,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:12:41,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:41,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:12:41,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:12:41,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8e9afd5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41, skipping insertion in model container [2020-07-28 18:12:41,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,440 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:12:41,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:12:41,659 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:41,670 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:12:41,767 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:12:41,791 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:12:41,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41 WrapperNode [2020-07-28 18:12:41,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:12:41,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:41,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:12:41,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:12:41,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,811 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,853 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:12:41,853 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:12:41,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:12:41,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:12:41,863 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,863 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,866 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,867 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,881 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... [2020-07-28 18:12:41,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:12:41,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:12:41,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:12:41,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:12:41,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:12:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 18:12:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:12:41,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:12:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure strncpy [2020-07-28 18:12:41,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:12:41,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:12:41,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:12:42,519 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:12:42,520 INFO L295 CfgBuilder]: Removed 14 assume(true) statements. [2020-07-28 18:12:42,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:42 BoogieIcfgContainer [2020-07-28 18:12:42,524 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:12:42,525 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:12:42,525 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:12:42,528 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:12:42,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:12:41" (1/3) ... [2020-07-28 18:12:42,529 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12ad38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:42, skipping insertion in model container [2020-07-28 18:12:42,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:12:41" (2/3) ... [2020-07-28 18:12:42,530 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e12ad38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:12:42, skipping insertion in model container [2020-07-28 18:12:42,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:42" (3/3) ... [2020-07-28 18:12:42,532 INFO L109 eAbstractionObserver]: Analyzing ICFG veris.c_OpenSER_cases1_stripFullBoth_arr.i [2020-07-28 18:12:42,542 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:12:42,549 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:12:42,559 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:12:42,578 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:12:42,579 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:12:42,579 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:12:42,579 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:12:42,579 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:12:42,579 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:12:42,580 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:12:42,580 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:12:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-07-28 18:12:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 18:12:42,600 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:42,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:42,601 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:42,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:42,606 INFO L82 PathProgramCache]: Analyzing trace with hash 297203850, now seen corresponding path program 1 times [2020-07-28 18:12:42,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:42,615 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926270121] [2020-07-28 18:12:42,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:42,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:42,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {41#true} is VALID [2020-07-28 18:12:42,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {41#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {43#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:42,805 INFO L280 TraceCheckUtils]: 2: Hoare triple {43#(= 0 ULTIMATE.start_main_~i~1)} assume !(main_~i~1 < 8); {42#false} is VALID [2020-07-28 18:12:42,805 INFO L280 TraceCheckUtils]: 3: Hoare triple {42#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {42#false} is VALID [2020-07-28 18:12:42,806 INFO L280 TraceCheckUtils]: 4: Hoare triple {42#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {42#false} is VALID [2020-07-28 18:12:42,807 INFO L280 TraceCheckUtils]: 5: Hoare triple {42#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {42#false} is VALID [2020-07-28 18:12:42,807 INFO L280 TraceCheckUtils]: 6: Hoare triple {42#false} assume parse_expression_list_#t~switch4; {42#false} is VALID [2020-07-28 18:12:42,807 INFO L280 TraceCheckUtils]: 7: Hoare triple {42#false} assume !true; {42#false} is VALID [2020-07-28 18:12:42,808 INFO L280 TraceCheckUtils]: 8: Hoare triple {42#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {42#false} is VALID [2020-07-28 18:12:42,808 INFO L280 TraceCheckUtils]: 9: Hoare triple {42#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {42#false} is VALID [2020-07-28 18:12:42,809 INFO L280 TraceCheckUtils]: 10: Hoare triple {42#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {42#false} is VALID [2020-07-28 18:12:42,809 INFO L280 TraceCheckUtils]: 11: Hoare triple {42#false} assume !true; {42#false} is VALID [2020-07-28 18:12:42,810 INFO L280 TraceCheckUtils]: 12: Hoare triple {42#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {42#false} is VALID [2020-07-28 18:12:42,810 INFO L280 TraceCheckUtils]: 13: Hoare triple {42#false} assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem16 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short17 := 34 == parse_expression_list_#t~mem16; {42#false} is VALID [2020-07-28 18:12:42,810 INFO L280 TraceCheckUtils]: 14: Hoare triple {42#false} assume parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; {42#false} is VALID [2020-07-28 18:12:42,811 INFO L280 TraceCheckUtils]: 15: Hoare triple {42#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {42#false} is VALID [2020-07-28 18:12:42,811 INFO L280 TraceCheckUtils]: 16: Hoare triple {42#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {42#false} is VALID [2020-07-28 18:12:42,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {42#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {42#false} is VALID [2020-07-28 18:12:42,812 INFO L280 TraceCheckUtils]: 18: Hoare triple {42#false} assume 0 == __VERIFIER_assert_~cond; {42#false} is VALID [2020-07-28 18:12:42,813 INFO L280 TraceCheckUtils]: 19: Hoare triple {42#false} assume !false; {42#false} is VALID [2020-07-28 18:12:42,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:42,818 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926270121] [2020-07-28 18:12:42,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:12:42,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:12:42,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579413803] [2020-07-28 18:12:42,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 18:12:42,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:42,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:12:42,874 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:42,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:12:42,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:42,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:12:42,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:12:42,888 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-07-28 18:12:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,041 INFO L93 Difference]: Finished difference Result 74 states and 110 transitions. [2020-07-28 18:12:43,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:12:43,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-07-28 18:12:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:43,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-28 18:12:43,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2020-07-28 18:12:43,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2020-07-28 18:12:43,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:43,288 INFO L225 Difference]: With dead ends: 74 [2020-07-28 18:12:43,288 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 18:12:43,292 INFO L675 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 [2020-07-28 18:12:43,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 18:12:43,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-28 18:12:43,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:43,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:43,339 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:43,339 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-28 18:12:43,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,345 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-28 18:12:43,345 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-28 18:12:43,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:43,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:43,347 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-28 18:12:43,347 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-28 18:12:43,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,351 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-28 18:12:43,352 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-28 18:12:43,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:43,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:43,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:43,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-28 18:12:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2020-07-28 18:12:43,360 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 20 [2020-07-28 18:12:43,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:43,361 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2020-07-28 18:12:43,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:12:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2020-07-28 18:12:43,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:12:43,363 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:43,363 INFO L422 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] [2020-07-28 18:12:43,364 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:12:43,364 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:43,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:43,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1628968459, now seen corresponding path program 1 times [2020-07-28 18:12:43,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:43,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77891568] [2020-07-28 18:12:43,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:43,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:43,432 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {247#true} is VALID [2020-07-28 18:12:43,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {249#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:43,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {249#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {249#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:43,437 INFO L280 TraceCheckUtils]: 3: Hoare triple {249#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {250#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:43,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {250#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 8); {248#false} is VALID [2020-07-28 18:12:43,439 INFO L280 TraceCheckUtils]: 5: Hoare triple {248#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {248#false} is VALID [2020-07-28 18:12:43,439 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {248#false} is VALID [2020-07-28 18:12:43,439 INFO L280 TraceCheckUtils]: 7: Hoare triple {248#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {248#false} is VALID [2020-07-28 18:12:43,440 INFO L280 TraceCheckUtils]: 8: Hoare triple {248#false} assume parse_expression_list_#t~switch4; {248#false} is VALID [2020-07-28 18:12:43,440 INFO L280 TraceCheckUtils]: 9: Hoare triple {248#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {248#false} is VALID [2020-07-28 18:12:43,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {248#false} assume parse_expression_list_#t~short7; {248#false} is VALID [2020-07-28 18:12:43,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {248#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {248#false} is VALID [2020-07-28 18:12:43,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {248#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {248#false} is VALID [2020-07-28 18:12:43,442 INFO L280 TraceCheckUtils]: 13: Hoare triple {248#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {248#false} is VALID [2020-07-28 18:12:43,442 INFO L280 TraceCheckUtils]: 14: Hoare triple {248#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {248#false} is VALID [2020-07-28 18:12:43,443 INFO L280 TraceCheckUtils]: 15: Hoare triple {248#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,443 INFO L280 TraceCheckUtils]: 16: Hoare triple {248#false} assume !parse_expression_list_#t~short14; {248#false} is VALID [2020-07-28 18:12:43,444 INFO L280 TraceCheckUtils]: 17: Hoare triple {248#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {248#false} is VALID [2020-07-28 18:12:43,444 INFO L280 TraceCheckUtils]: 18: Hoare triple {248#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,445 INFO L280 TraceCheckUtils]: 19: Hoare triple {248#false} assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem16 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short17 := 34 == parse_expression_list_#t~mem16; {248#false} is VALID [2020-07-28 18:12:43,445 INFO L280 TraceCheckUtils]: 20: Hoare triple {248#false} assume parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; {248#false} is VALID [2020-07-28 18:12:43,445 INFO L280 TraceCheckUtils]: 21: Hoare triple {248#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,446 INFO L280 TraceCheckUtils]: 22: Hoare triple {248#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {248#false} is VALID [2020-07-28 18:12:43,446 INFO L280 TraceCheckUtils]: 23: Hoare triple {248#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {248#false} is VALID [2020-07-28 18:12:43,447 INFO L280 TraceCheckUtils]: 24: Hoare triple {248#false} assume 0 == __VERIFIER_assert_~cond; {248#false} is VALID [2020-07-28 18:12:43,447 INFO L280 TraceCheckUtils]: 25: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 18:12:43,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:43,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77891568] [2020-07-28 18:12:43,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872678708] [2020-07-28 18:12:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:43,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:12:43,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:43,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:43,687 INFO L280 TraceCheckUtils]: 0: Hoare triple {247#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {247#true} is VALID [2020-07-28 18:12:43,688 INFO L280 TraceCheckUtils]: 1: Hoare triple {247#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {247#true} is VALID [2020-07-28 18:12:43,688 INFO L280 TraceCheckUtils]: 2: Hoare triple {247#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {247#true} is VALID [2020-07-28 18:12:43,688 INFO L280 TraceCheckUtils]: 3: Hoare triple {247#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {247#true} is VALID [2020-07-28 18:12:43,689 INFO L280 TraceCheckUtils]: 4: Hoare triple {247#true} assume !(main_~i~1 < 8); {247#true} is VALID [2020-07-28 18:12:43,689 INFO L280 TraceCheckUtils]: 5: Hoare triple {247#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {247#true} is VALID [2020-07-28 18:12:43,690 INFO L280 TraceCheckUtils]: 6: Hoare triple {247#true} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {247#true} is VALID [2020-07-28 18:12:43,690 INFO L280 TraceCheckUtils]: 7: Hoare triple {247#true} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {247#true} is VALID [2020-07-28 18:12:43,690 INFO L280 TraceCheckUtils]: 8: Hoare triple {247#true} assume parse_expression_list_#t~switch4; {247#true} is VALID [2020-07-28 18:12:43,691 INFO L280 TraceCheckUtils]: 9: Hoare triple {247#true} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {247#true} is VALID [2020-07-28 18:12:43,706 INFO L280 TraceCheckUtils]: 10: Hoare triple {247#true} assume parse_expression_list_#t~short7; {284#|ULTIMATE.start_parse_expression_list_#t~short7|} is VALID [2020-07-28 18:12:43,715 INFO L280 TraceCheckUtils]: 11: Hoare triple {284#|ULTIMATE.start_parse_expression_list_#t~short7|} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {248#false} is VALID [2020-07-28 18:12:43,716 INFO L280 TraceCheckUtils]: 12: Hoare triple {248#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {248#false} is VALID [2020-07-28 18:12:43,717 INFO L280 TraceCheckUtils]: 13: Hoare triple {248#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {248#false} is VALID [2020-07-28 18:12:43,717 INFO L280 TraceCheckUtils]: 14: Hoare triple {248#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {248#false} is VALID [2020-07-28 18:12:43,717 INFO L280 TraceCheckUtils]: 15: Hoare triple {248#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,718 INFO L280 TraceCheckUtils]: 16: Hoare triple {248#false} assume !parse_expression_list_#t~short14; {248#false} is VALID [2020-07-28 18:12:43,719 INFO L280 TraceCheckUtils]: 17: Hoare triple {248#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {248#false} is VALID [2020-07-28 18:12:43,719 INFO L280 TraceCheckUtils]: 18: Hoare triple {248#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,719 INFO L280 TraceCheckUtils]: 19: Hoare triple {248#false} assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem16 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short17 := 34 == parse_expression_list_#t~mem16; {248#false} is VALID [2020-07-28 18:12:43,720 INFO L280 TraceCheckUtils]: 20: Hoare triple {248#false} assume parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; {248#false} is VALID [2020-07-28 18:12:43,720 INFO L280 TraceCheckUtils]: 21: Hoare triple {248#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {248#false} is VALID [2020-07-28 18:12:43,721 INFO L280 TraceCheckUtils]: 22: Hoare triple {248#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {248#false} is VALID [2020-07-28 18:12:43,722 INFO L280 TraceCheckUtils]: 23: Hoare triple {248#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {248#false} is VALID [2020-07-28 18:12:43,723 INFO L280 TraceCheckUtils]: 24: Hoare triple {248#false} assume 0 == __VERIFIER_assert_~cond; {248#false} is VALID [2020-07-28 18:12:43,723 INFO L280 TraceCheckUtils]: 25: Hoare triple {248#false} assume !false; {248#false} is VALID [2020-07-28 18:12:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:12:43,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:43,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-28 18:12:43,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32844959] [2020-07-28 18:12:43,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-28 18:12:43,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:43,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:12:43,774 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:43,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:12:43,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:43,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:12:43,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:43,775 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand 3 states. [2020-07-28 18:12:43,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:43,873 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2020-07-28 18:12:43,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:12:43,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-28 18:12:43,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:43,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:43,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-28 18:12:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:12:43,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-28 18:12:43,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-28 18:12:43,991 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:43,993 INFO L225 Difference]: With dead ends: 62 [2020-07-28 18:12:43,994 INFO L226 Difference]: Without dead ends: 35 [2020-07-28 18:12:43,995 INFO L675 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 [2020-07-28 18:12:43,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-28 18:12:44,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2020-07-28 18:12:44,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:44,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2020-07-28 18:12:44,017 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 18:12:44,017 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 18:12:44,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:44,020 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-28 18:12:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-28 18:12:44,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:44,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:44,021 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2020-07-28 18:12:44,022 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2020-07-28 18:12:44,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:44,024 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-28 18:12:44,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-28 18:12:44,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:44,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:44,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:44,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:44,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-28 18:12:44,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-07-28 18:12:44,028 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 45 transitions. Word has length 26 [2020-07-28 18:12:44,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:44,029 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-07-28 18:12:44,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:12:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2020-07-28 18:12:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:12:44,030 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:44,030 INFO L422 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] [2020-07-28 18:12:44,243 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:12:44,244 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:44,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:44,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1644930483, now seen corresponding path program 1 times [2020-07-28 18:12:44,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:44,247 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967834471] [2020-07-28 18:12:44,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:44,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:44,350 INFO L280 TraceCheckUtils]: 0: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {515#true} is VALID [2020-07-28 18:12:44,351 INFO L280 TraceCheckUtils]: 1: Hoare triple {515#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {517#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:44,352 INFO L280 TraceCheckUtils]: 2: Hoare triple {517#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {517#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:44,354 INFO L280 TraceCheckUtils]: 3: Hoare triple {517#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {518#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:44,355 INFO L280 TraceCheckUtils]: 4: Hoare triple {518#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 8); {516#false} is VALID [2020-07-28 18:12:44,355 INFO L280 TraceCheckUtils]: 5: Hoare triple {516#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {516#false} is VALID [2020-07-28 18:12:44,356 INFO L280 TraceCheckUtils]: 6: Hoare triple {516#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {516#false} is VALID [2020-07-28 18:12:44,356 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {516#false} is VALID [2020-07-28 18:12:44,356 INFO L280 TraceCheckUtils]: 8: Hoare triple {516#false} assume parse_expression_list_#t~switch4; {516#false} is VALID [2020-07-28 18:12:44,357 INFO L280 TraceCheckUtils]: 9: Hoare triple {516#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {516#false} is VALID [2020-07-28 18:12:44,358 INFO L280 TraceCheckUtils]: 10: Hoare triple {516#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {516#false} is VALID [2020-07-28 18:12:44,358 INFO L280 TraceCheckUtils]: 11: Hoare triple {516#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {516#false} is VALID [2020-07-28 18:12:44,358 INFO L280 TraceCheckUtils]: 12: Hoare triple {516#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {516#false} is VALID [2020-07-28 18:12:44,359 INFO L280 TraceCheckUtils]: 13: Hoare triple {516#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {516#false} is VALID [2020-07-28 18:12:44,359 INFO L280 TraceCheckUtils]: 14: Hoare triple {516#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {516#false} is VALID [2020-07-28 18:12:44,359 INFO L280 TraceCheckUtils]: 15: Hoare triple {516#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {516#false} is VALID [2020-07-28 18:12:44,360 INFO L280 TraceCheckUtils]: 16: Hoare triple {516#false} assume !parse_expression_list_#t~short14; {516#false} is VALID [2020-07-28 18:12:44,365 INFO L280 TraceCheckUtils]: 17: Hoare triple {516#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {516#false} is VALID [2020-07-28 18:12:44,366 INFO L280 TraceCheckUtils]: 18: Hoare triple {516#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {516#false} is VALID [2020-07-28 18:12:44,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {516#false} assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem16 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short17 := 34 == parse_expression_list_#t~mem16; {516#false} is VALID [2020-07-28 18:12:44,367 INFO L280 TraceCheckUtils]: 20: Hoare triple {516#false} assume parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; {516#false} is VALID [2020-07-28 18:12:44,368 INFO L280 TraceCheckUtils]: 21: Hoare triple {516#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {516#false} is VALID [2020-07-28 18:12:44,368 INFO L280 TraceCheckUtils]: 22: Hoare triple {516#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {516#false} is VALID [2020-07-28 18:12:44,369 INFO L280 TraceCheckUtils]: 23: Hoare triple {516#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {516#false} is VALID [2020-07-28 18:12:44,370 INFO L280 TraceCheckUtils]: 24: Hoare triple {516#false} assume 0 == __VERIFIER_assert_~cond; {516#false} is VALID [2020-07-28 18:12:44,370 INFO L280 TraceCheckUtils]: 25: Hoare triple {516#false} assume !false; {516#false} is VALID [2020-07-28 18:12:44,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:44,373 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967834471] [2020-07-28 18:12:44,374 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147812386] [2020-07-28 18:12:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:44,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:44,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:44,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:44,536 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:44,585 INFO L280 TraceCheckUtils]: 0: Hoare triple {515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {515#true} is VALID [2020-07-28 18:12:44,586 INFO L280 TraceCheckUtils]: 1: Hoare triple {515#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {515#true} is VALID [2020-07-28 18:12:44,586 INFO L280 TraceCheckUtils]: 2: Hoare triple {515#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {515#true} is VALID [2020-07-28 18:12:44,586 INFO L280 TraceCheckUtils]: 3: Hoare triple {515#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {515#true} is VALID [2020-07-28 18:12:44,587 INFO L280 TraceCheckUtils]: 4: Hoare triple {515#true} assume !(main_~i~1 < 8); {515#true} is VALID [2020-07-28 18:12:44,587 INFO L280 TraceCheckUtils]: 5: Hoare triple {515#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {515#true} is VALID [2020-07-28 18:12:44,587 INFO L280 TraceCheckUtils]: 6: Hoare triple {515#true} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {515#true} is VALID [2020-07-28 18:12:44,588 INFO L280 TraceCheckUtils]: 7: Hoare triple {515#true} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {515#true} is VALID [2020-07-28 18:12:44,588 INFO L280 TraceCheckUtils]: 8: Hoare triple {515#true} assume parse_expression_list_#t~switch4; {515#true} is VALID [2020-07-28 18:12:44,588 INFO L280 TraceCheckUtils]: 9: Hoare triple {515#true} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {515#true} is VALID [2020-07-28 18:12:44,589 INFO L280 TraceCheckUtils]: 10: Hoare triple {515#true} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {515#true} is VALID [2020-07-28 18:12:44,589 INFO L280 TraceCheckUtils]: 11: Hoare triple {515#true} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {515#true} is VALID [2020-07-28 18:12:44,589 INFO L280 TraceCheckUtils]: 12: Hoare triple {515#true} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {515#true} is VALID [2020-07-28 18:12:44,590 INFO L280 TraceCheckUtils]: 13: Hoare triple {515#true} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {515#true} is VALID [2020-07-28 18:12:44,590 INFO L280 TraceCheckUtils]: 14: Hoare triple {515#true} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {515#true} is VALID [2020-07-28 18:12:44,591 INFO L280 TraceCheckUtils]: 15: Hoare triple {515#true} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {567#(or (and (not |ULTIMATE.start_parse_expression_list_#t~short14|) (<= ULTIMATE.start_parse_expression_list_~j~0 0)) (and (< 0 ULTIMATE.start_parse_expression_list_~j~0) |ULTIMATE.start_parse_expression_list_#t~short14|))} is VALID [2020-07-28 18:12:44,592 INFO L280 TraceCheckUtils]: 16: Hoare triple {567#(or (and (not |ULTIMATE.start_parse_expression_list_#t~short14|) (<= ULTIMATE.start_parse_expression_list_~j~0 0)) (and (< 0 ULTIMATE.start_parse_expression_list_~j~0) |ULTIMATE.start_parse_expression_list_#t~short14|))} assume !parse_expression_list_#t~short14; {571#(<= ULTIMATE.start_parse_expression_list_~j~0 0)} is VALID [2020-07-28 18:12:44,593 INFO L280 TraceCheckUtils]: 17: Hoare triple {571#(<= ULTIMATE.start_parse_expression_list_~j~0 0)} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {571#(<= ULTIMATE.start_parse_expression_list_~j~0 0)} is VALID [2020-07-28 18:12:44,594 INFO L280 TraceCheckUtils]: 18: Hoare triple {571#(<= ULTIMATE.start_parse_expression_list_~j~0 0)} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {578#(not |ULTIMATE.start_parse_expression_list_#t~short17|)} is VALID [2020-07-28 18:12:44,595 INFO L280 TraceCheckUtils]: 19: Hoare triple {578#(not |ULTIMATE.start_parse_expression_list_#t~short17|)} assume parse_expression_list_#t~short17;call parse_expression_list_#t~mem16 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~j~0, 1);parse_expression_list_#t~short17 := 34 == parse_expression_list_#t~mem16; {516#false} is VALID [2020-07-28 18:12:44,595 INFO L280 TraceCheckUtils]: 20: Hoare triple {516#false} assume parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17;parse_expression_list_#t~post18 := parse_expression_list_~j~0;parse_expression_list_~j~0 := parse_expression_list_#t~post18 - 1;havoc parse_expression_list_#t~post18; {516#false} is VALID [2020-07-28 18:12:44,596 INFO L280 TraceCheckUtils]: 21: Hoare triple {516#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {516#false} is VALID [2020-07-28 18:12:44,596 INFO L280 TraceCheckUtils]: 22: Hoare triple {516#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {516#false} is VALID [2020-07-28 18:12:44,596 INFO L280 TraceCheckUtils]: 23: Hoare triple {516#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {516#false} is VALID [2020-07-28 18:12:44,596 INFO L280 TraceCheckUtils]: 24: Hoare triple {516#false} assume 0 == __VERIFIER_assert_~cond; {516#false} is VALID [2020-07-28 18:12:44,597 INFO L280 TraceCheckUtils]: 25: Hoare triple {516#false} assume !false; {516#false} is VALID [2020-07-28 18:12:44,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-28 18:12:44,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:44,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2020-07-28 18:12:44,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998865973] [2020-07-28 18:12:44,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:44,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:44,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:44,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:44,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:44,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:44,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:44,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:44,638 INFO L87 Difference]: Start difference. First operand 35 states and 45 transitions. Second operand 5 states. [2020-07-28 18:12:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:44,946 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2020-07-28 18:12:44,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:44,947 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:44,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2020-07-28 18:12:44,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:44,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2020-07-28 18:12:44,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2020-07-28 18:12:45,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:45,109 INFO L225 Difference]: With dead ends: 88 [2020-07-28 18:12:45,110 INFO L226 Difference]: Without dead ends: 60 [2020-07-28 18:12:45,113 INFO L675 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 [2020-07-28 18:12:45,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-07-28 18:12:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2020-07-28 18:12:45,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:45,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 39 states. [2020-07-28 18:12:45,130 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 39 states. [2020-07-28 18:12:45,130 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 39 states. [2020-07-28 18:12:45,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:45,137 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2020-07-28 18:12:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-28 18:12:45,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:45,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:45,140 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 60 states. [2020-07-28 18:12:45,140 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 60 states. [2020-07-28 18:12:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:45,146 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2020-07-28 18:12:45,146 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2020-07-28 18:12:45,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:45,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:45,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:45,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:45,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-28 18:12:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2020-07-28 18:12:45,152 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 26 [2020-07-28 18:12:45,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:45,153 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-07-28 18:12:45,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:45,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-28 18:12:45,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 18:12:45,160 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:45,160 INFO L422 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] [2020-07-28 18:12:45,371 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:45,372 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:45,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:45,373 INFO L82 PathProgramCache]: Analyzing trace with hash -817771149, now seen corresponding path program 1 times [2020-07-28 18:12:45,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:45,374 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102208797] [2020-07-28 18:12:45,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:45,444 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-28 18:12:45,445 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {875#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:45,446 INFO L280 TraceCheckUtils]: 2: Hoare triple {875#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {875#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:45,447 INFO L280 TraceCheckUtils]: 3: Hoare triple {875#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {876#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:45,448 INFO L280 TraceCheckUtils]: 4: Hoare triple {876#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 8); {874#false} is VALID [2020-07-28 18:12:45,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {874#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {874#false} is VALID [2020-07-28 18:12:45,449 INFO L280 TraceCheckUtils]: 6: Hoare triple {874#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {874#false} is VALID [2020-07-28 18:12:45,449 INFO L280 TraceCheckUtils]: 7: Hoare triple {874#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {874#false} is VALID [2020-07-28 18:12:45,449 INFO L280 TraceCheckUtils]: 8: Hoare triple {874#false} assume parse_expression_list_#t~switch4; {874#false} is VALID [2020-07-28 18:12:45,450 INFO L280 TraceCheckUtils]: 9: Hoare triple {874#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {874#false} is VALID [2020-07-28 18:12:45,450 INFO L280 TraceCheckUtils]: 10: Hoare triple {874#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {874#false} is VALID [2020-07-28 18:12:45,450 INFO L280 TraceCheckUtils]: 11: Hoare triple {874#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {874#false} is VALID [2020-07-28 18:12:45,451 INFO L280 TraceCheckUtils]: 12: Hoare triple {874#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {874#false} is VALID [2020-07-28 18:12:45,451 INFO L280 TraceCheckUtils]: 13: Hoare triple {874#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {874#false} is VALID [2020-07-28 18:12:45,451 INFO L280 TraceCheckUtils]: 14: Hoare triple {874#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {874#false} is VALID [2020-07-28 18:12:45,452 INFO L280 TraceCheckUtils]: 15: Hoare triple {874#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,452 INFO L280 TraceCheckUtils]: 16: Hoare triple {874#false} assume !parse_expression_list_#t~short14; {874#false} is VALID [2020-07-28 18:12:45,453 INFO L280 TraceCheckUtils]: 17: Hoare triple {874#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {874#false} is VALID [2020-07-28 18:12:45,453 INFO L280 TraceCheckUtils]: 18: Hoare triple {874#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,453 INFO L280 TraceCheckUtils]: 19: Hoare triple {874#false} assume !parse_expression_list_#t~short17; {874#false} is VALID [2020-07-28 18:12:45,454 INFO L280 TraceCheckUtils]: 20: Hoare triple {874#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {874#false} is VALID [2020-07-28 18:12:45,454 INFO L280 TraceCheckUtils]: 21: Hoare triple {874#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,454 INFO L280 TraceCheckUtils]: 22: Hoare triple {874#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {874#false} is VALID [2020-07-28 18:12:45,455 INFO L280 TraceCheckUtils]: 23: Hoare triple {874#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {874#false} is VALID [2020-07-28 18:12:45,455 INFO L280 TraceCheckUtils]: 24: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond; {874#false} is VALID [2020-07-28 18:12:45,456 INFO L280 TraceCheckUtils]: 25: Hoare triple {874#false} assume !false; {874#false} is VALID [2020-07-28 18:12:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:45,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102208797] [2020-07-28 18:12:45,458 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368638484] [2020-07-28 18:12:45,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:45,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:45,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:12:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:45,538 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:45,611 INFO L280 TraceCheckUtils]: 0: Hoare triple {873#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {873#true} is VALID [2020-07-28 18:12:45,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {873#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {883#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:45,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {883#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {883#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:45,614 INFO L280 TraceCheckUtils]: 3: Hoare triple {883#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {876#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:45,615 INFO L280 TraceCheckUtils]: 4: Hoare triple {876#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < 8); {874#false} is VALID [2020-07-28 18:12:45,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {874#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {874#false} is VALID [2020-07-28 18:12:45,615 INFO L280 TraceCheckUtils]: 6: Hoare triple {874#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {874#false} is VALID [2020-07-28 18:12:45,616 INFO L280 TraceCheckUtils]: 7: Hoare triple {874#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {874#false} is VALID [2020-07-28 18:12:45,616 INFO L280 TraceCheckUtils]: 8: Hoare triple {874#false} assume parse_expression_list_#t~switch4; {874#false} is VALID [2020-07-28 18:12:45,616 INFO L280 TraceCheckUtils]: 9: Hoare triple {874#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {874#false} is VALID [2020-07-28 18:12:45,616 INFO L280 TraceCheckUtils]: 10: Hoare triple {874#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {874#false} is VALID [2020-07-28 18:12:45,617 INFO L280 TraceCheckUtils]: 11: Hoare triple {874#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {874#false} is VALID [2020-07-28 18:12:45,617 INFO L280 TraceCheckUtils]: 12: Hoare triple {874#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {874#false} is VALID [2020-07-28 18:12:45,617 INFO L280 TraceCheckUtils]: 13: Hoare triple {874#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {874#false} is VALID [2020-07-28 18:12:45,617 INFO L280 TraceCheckUtils]: 14: Hoare triple {874#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {874#false} is VALID [2020-07-28 18:12:45,617 INFO L280 TraceCheckUtils]: 15: Hoare triple {874#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,618 INFO L280 TraceCheckUtils]: 16: Hoare triple {874#false} assume !parse_expression_list_#t~short14; {874#false} is VALID [2020-07-28 18:12:45,618 INFO L280 TraceCheckUtils]: 17: Hoare triple {874#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {874#false} is VALID [2020-07-28 18:12:45,618 INFO L280 TraceCheckUtils]: 18: Hoare triple {874#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,618 INFO L280 TraceCheckUtils]: 19: Hoare triple {874#false} assume !parse_expression_list_#t~short17; {874#false} is VALID [2020-07-28 18:12:45,619 INFO L280 TraceCheckUtils]: 20: Hoare triple {874#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {874#false} is VALID [2020-07-28 18:12:45,619 INFO L280 TraceCheckUtils]: 21: Hoare triple {874#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {874#false} is VALID [2020-07-28 18:12:45,619 INFO L280 TraceCheckUtils]: 22: Hoare triple {874#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {874#false} is VALID [2020-07-28 18:12:45,619 INFO L280 TraceCheckUtils]: 23: Hoare triple {874#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {874#false} is VALID [2020-07-28 18:12:45,620 INFO L280 TraceCheckUtils]: 24: Hoare triple {874#false} assume 0 == __VERIFIER_assert_~cond; {874#false} is VALID [2020-07-28 18:12:45,620 INFO L280 TraceCheckUtils]: 25: Hoare triple {874#false} assume !false; {874#false} is VALID [2020-07-28 18:12:45,621 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:45,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:45,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:12:45,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90070901] [2020-07-28 18:12:45,622 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:45,622 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:45,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:45,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:45,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:45,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:45,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:45,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:45,657 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 5 states. [2020-07-28 18:12:45,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:45,765 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2020-07-28 18:12:45,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:12:45,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2020-07-28 18:12:45,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:45,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:45,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2020-07-28 18:12:45,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:45,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 86 transitions. [2020-07-28 18:12:45,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 86 transitions. [2020-07-28 18:12:45,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:45,862 INFO L225 Difference]: With dead ends: 76 [2020-07-28 18:12:45,862 INFO L226 Difference]: Without dead ends: 42 [2020-07-28 18:12:45,863 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:12:45,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-07-28 18:12:45,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-07-28 18:12:45,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:45,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2020-07-28 18:12:45,872 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2020-07-28 18:12:45,872 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2020-07-28 18:12:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:45,874 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-28 18:12:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-28 18:12:45,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:45,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:45,875 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2020-07-28 18:12:45,875 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2020-07-28 18:12:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:45,877 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2020-07-28 18:12:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2020-07-28 18:12:45,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:45,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:45,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:45,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:45,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-28 18:12:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2020-07-28 18:12:45,880 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 26 [2020-07-28 18:12:45,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:45,881 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2020-07-28 18:12:45,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:45,881 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2020-07-28 18:12:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-28 18:12:45,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:45,882 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:46,094 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:46,095 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:46,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:46,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1849885685, now seen corresponding path program 2 times [2020-07-28 18:12:46,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:46,097 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932917715] [2020-07-28 18:12:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:46,165 INFO L280 TraceCheckUtils]: 0: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1177#true} is VALID [2020-07-28 18:12:46,166 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1179#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:46,167 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1179#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:46,168 INFO L280 TraceCheckUtils]: 3: Hoare triple {1179#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1180#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:46,168 INFO L280 TraceCheckUtils]: 4: Hoare triple {1180#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1180#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:46,169 INFO L280 TraceCheckUtils]: 5: Hoare triple {1180#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1181#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:46,169 INFO L280 TraceCheckUtils]: 6: Hoare triple {1181#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 8); {1178#false} is VALID [2020-07-28 18:12:46,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {1178#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {1178#false} is VALID [2020-07-28 18:12:46,170 INFO L280 TraceCheckUtils]: 8: Hoare triple {1178#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {1178#false} is VALID [2020-07-28 18:12:46,170 INFO L280 TraceCheckUtils]: 9: Hoare triple {1178#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {1178#false} is VALID [2020-07-28 18:12:46,170 INFO L280 TraceCheckUtils]: 10: Hoare triple {1178#false} assume parse_expression_list_#t~switch4; {1178#false} is VALID [2020-07-28 18:12:46,170 INFO L280 TraceCheckUtils]: 11: Hoare triple {1178#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {1178#false} is VALID [2020-07-28 18:12:46,171 INFO L280 TraceCheckUtils]: 12: Hoare triple {1178#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {1178#false} is VALID [2020-07-28 18:12:46,171 INFO L280 TraceCheckUtils]: 13: Hoare triple {1178#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {1178#false} is VALID [2020-07-28 18:12:46,171 INFO L280 TraceCheckUtils]: 14: Hoare triple {1178#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {1178#false} is VALID [2020-07-28 18:12:46,171 INFO L280 TraceCheckUtils]: 15: Hoare triple {1178#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {1178#false} is VALID [2020-07-28 18:12:46,171 INFO L280 TraceCheckUtils]: 16: Hoare triple {1178#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {1178#false} is VALID [2020-07-28 18:12:46,172 INFO L280 TraceCheckUtils]: 17: Hoare triple {1178#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {1178#false} is VALID [2020-07-28 18:12:46,172 INFO L280 TraceCheckUtils]: 18: Hoare triple {1178#false} assume !parse_expression_list_#t~short14; {1178#false} is VALID [2020-07-28 18:12:46,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {1178#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {1178#false} is VALID [2020-07-28 18:12:46,172 INFO L280 TraceCheckUtils]: 20: Hoare triple {1178#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {1178#false} is VALID [2020-07-28 18:12:46,173 INFO L280 TraceCheckUtils]: 21: Hoare triple {1178#false} assume !parse_expression_list_#t~short17; {1178#false} is VALID [2020-07-28 18:12:46,173 INFO L280 TraceCheckUtils]: 22: Hoare triple {1178#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {1178#false} is VALID [2020-07-28 18:12:46,173 INFO L280 TraceCheckUtils]: 23: Hoare triple {1178#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1178#false} is VALID [2020-07-28 18:12:46,173 INFO L280 TraceCheckUtils]: 24: Hoare triple {1178#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1178#false} is VALID [2020-07-28 18:12:46,173 INFO L280 TraceCheckUtils]: 25: Hoare triple {1178#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1178#false} is VALID [2020-07-28 18:12:46,174 INFO L280 TraceCheckUtils]: 26: Hoare triple {1178#false} assume 0 == __VERIFIER_assert_~cond; {1178#false} is VALID [2020-07-28 18:12:46,174 INFO L280 TraceCheckUtils]: 27: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2020-07-28 18:12:46,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:46,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932917715] [2020-07-28 18:12:46,175 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681461713] [2020-07-28 18:12:46,175 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:46,238 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:46,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:46,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:12:46,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:46,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:46,478 INFO L280 TraceCheckUtils]: 0: Hoare triple {1177#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1177#true} is VALID [2020-07-28 18:12:46,478 INFO L280 TraceCheckUtils]: 1: Hoare triple {1177#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1177#true} is VALID [2020-07-28 18:12:46,479 INFO L280 TraceCheckUtils]: 2: Hoare triple {1177#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1177#true} is VALID [2020-07-28 18:12:46,480 INFO L280 TraceCheckUtils]: 3: Hoare triple {1177#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1177#true} is VALID [2020-07-28 18:12:46,480 INFO L280 TraceCheckUtils]: 4: Hoare triple {1177#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1177#true} is VALID [2020-07-28 18:12:46,480 INFO L280 TraceCheckUtils]: 5: Hoare triple {1177#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1177#true} is VALID [2020-07-28 18:12:46,481 INFO L280 TraceCheckUtils]: 6: Hoare triple {1177#true} assume !(main_~i~1 < 8); {1177#true} is VALID [2020-07-28 18:12:46,483 INFO L280 TraceCheckUtils]: 7: Hoare triple {1177#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {1206#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} is VALID [2020-07-28 18:12:46,484 INFO L280 TraceCheckUtils]: 8: Hoare triple {1206#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {1206#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} is VALID [2020-07-28 18:12:46,486 INFO L280 TraceCheckUtils]: 9: Hoare triple {1206#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,488 INFO L280 TraceCheckUtils]: 10: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume parse_expression_list_#t~switch4; {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,489 INFO L280 TraceCheckUtils]: 11: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,490 INFO L280 TraceCheckUtils]: 12: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,490 INFO L280 TraceCheckUtils]: 13: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,491 INFO L280 TraceCheckUtils]: 14: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:46,492 INFO L280 TraceCheckUtils]: 15: Hoare triple {1213#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {1232#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~i~0 0))} is VALID [2020-07-28 18:12:46,493 INFO L280 TraceCheckUtils]: 16: Hoare triple {1232#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~i~0 0))} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,494 INFO L280 TraceCheckUtils]: 17: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,494 INFO L280 TraceCheckUtils]: 18: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} assume !parse_expression_list_#t~short14; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,495 INFO L280 TraceCheckUtils]: 19: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,496 INFO L280 TraceCheckUtils]: 20: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,496 INFO L280 TraceCheckUtils]: 21: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} assume !parse_expression_list_#t~short17; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,497 INFO L280 TraceCheckUtils]: 22: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} is VALID [2020-07-28 18:12:46,497 INFO L280 TraceCheckUtils]: 23: Hoare triple {1236#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0))} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1178#false} is VALID [2020-07-28 18:12:46,498 INFO L280 TraceCheckUtils]: 24: Hoare triple {1178#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1178#false} is VALID [2020-07-28 18:12:46,498 INFO L280 TraceCheckUtils]: 25: Hoare triple {1178#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1178#false} is VALID [2020-07-28 18:12:46,498 INFO L280 TraceCheckUtils]: 26: Hoare triple {1178#false} assume 0 == __VERIFIER_assert_~cond; {1178#false} is VALID [2020-07-28 18:12:46,498 INFO L280 TraceCheckUtils]: 27: Hoare triple {1178#false} assume !false; {1178#false} is VALID [2020-07-28 18:12:46,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-28 18:12:46,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:46,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2020-07-28 18:12:46,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375621508] [2020-07-28 18:12:46,501 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-28 18:12:46,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:46,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:46,542 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:46,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:46,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:46,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:46,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:12:46,543 INFO L87 Difference]: Start difference. First operand 41 states and 51 transitions. Second operand 6 states. [2020-07-28 18:12:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,030 INFO L93 Difference]: Finished difference Result 126 states and 162 transitions. [2020-07-28 18:12:47,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:12:47,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-28 18:12:47,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:47,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-28 18:12:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:47,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 139 transitions. [2020-07-28 18:12:47,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 139 transitions. [2020-07-28 18:12:47,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:47,199 INFO L225 Difference]: With dead ends: 126 [2020-07-28 18:12:47,199 INFO L226 Difference]: Without dead ends: 73 [2020-07-28 18:12:47,200 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:12:47,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-07-28 18:12:47,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2020-07-28 18:12:47,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:47,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 48 states. [2020-07-28 18:12:47,215 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 48 states. [2020-07-28 18:12:47,215 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 48 states. [2020-07-28 18:12:47,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,219 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-28 18:12:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-28 18:12:47,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:47,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:47,219 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 73 states. [2020-07-28 18:12:47,219 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 73 states. [2020-07-28 18:12:47,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,222 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2020-07-28 18:12:47,222 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 89 transitions. [2020-07-28 18:12:47,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:47,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:47,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:47,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-28 18:12:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2020-07-28 18:12:47,227 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2020-07-28 18:12:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:47,228 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2020-07-28 18:12:47,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2020-07-28 18:12:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-28 18:12:47,229 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:47,230 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:47,445 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:47,446 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1263079671, now seen corresponding path program 1 times [2020-07-28 18:12:47,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:47,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591463070] [2020-07-28 18:12:47,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:47,499 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-28 18:12:47,499 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1624#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:47,500 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1624#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:47,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1625#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:47,501 INFO L280 TraceCheckUtils]: 4: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1625#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:47,502 INFO L280 TraceCheckUtils]: 5: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1626#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:47,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {1626#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 8); {1623#false} is VALID [2020-07-28 18:12:47,503 INFO L280 TraceCheckUtils]: 7: Hoare triple {1623#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {1623#false} is VALID [2020-07-28 18:12:47,503 INFO L280 TraceCheckUtils]: 8: Hoare triple {1623#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {1623#false} is VALID [2020-07-28 18:12:47,503 INFO L280 TraceCheckUtils]: 9: Hoare triple {1623#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {1623#false} is VALID [2020-07-28 18:12:47,504 INFO L280 TraceCheckUtils]: 10: Hoare triple {1623#false} assume parse_expression_list_#t~switch4; {1623#false} is VALID [2020-07-28 18:12:47,504 INFO L280 TraceCheckUtils]: 11: Hoare triple {1623#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {1623#false} is VALID [2020-07-28 18:12:47,504 INFO L280 TraceCheckUtils]: 12: Hoare triple {1623#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {1623#false} is VALID [2020-07-28 18:12:47,504 INFO L280 TraceCheckUtils]: 13: Hoare triple {1623#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {1623#false} is VALID [2020-07-28 18:12:47,504 INFO L280 TraceCheckUtils]: 14: Hoare triple {1623#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {1623#false} is VALID [2020-07-28 18:12:47,505 INFO L280 TraceCheckUtils]: 15: Hoare triple {1623#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {1623#false} is VALID [2020-07-28 18:12:47,505 INFO L280 TraceCheckUtils]: 16: Hoare triple {1623#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {1623#false} is VALID [2020-07-28 18:12:47,505 INFO L280 TraceCheckUtils]: 17: Hoare triple {1623#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,505 INFO L280 TraceCheckUtils]: 18: Hoare triple {1623#false} assume !parse_expression_list_#t~short14; {1623#false} is VALID [2020-07-28 18:12:47,506 INFO L280 TraceCheckUtils]: 19: Hoare triple {1623#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {1623#false} is VALID [2020-07-28 18:12:47,506 INFO L280 TraceCheckUtils]: 20: Hoare triple {1623#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,506 INFO L280 TraceCheckUtils]: 21: Hoare triple {1623#false} assume !parse_expression_list_#t~short17; {1623#false} is VALID [2020-07-28 18:12:47,506 INFO L280 TraceCheckUtils]: 22: Hoare triple {1623#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {1623#false} is VALID [2020-07-28 18:12:47,506 INFO L280 TraceCheckUtils]: 23: Hoare triple {1623#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,507 INFO L280 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1623#false} is VALID [2020-07-28 18:12:47,507 INFO L280 TraceCheckUtils]: 25: Hoare triple {1623#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1623#false} is VALID [2020-07-28 18:12:47,507 INFO L280 TraceCheckUtils]: 26: Hoare triple {1623#false} assume 0 == __VERIFIER_assert_~cond; {1623#false} is VALID [2020-07-28 18:12:47,507 INFO L280 TraceCheckUtils]: 27: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-28 18:12:47,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:47,508 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591463070] [2020-07-28 18:12:47,509 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1977749995] [2020-07-28 18:12:47,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:47,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:47,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:47,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:47,654 INFO L280 TraceCheckUtils]: 0: Hoare triple {1622#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1622#true} is VALID [2020-07-28 18:12:47,655 INFO L280 TraceCheckUtils]: 1: Hoare triple {1622#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1633#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:47,656 INFO L280 TraceCheckUtils]: 2: Hoare triple {1633#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1633#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:47,657 INFO L280 TraceCheckUtils]: 3: Hoare triple {1633#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1625#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:47,658 INFO L280 TraceCheckUtils]: 4: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1625#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:47,659 INFO L280 TraceCheckUtils]: 5: Hoare triple {1625#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1626#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:47,659 INFO L280 TraceCheckUtils]: 6: Hoare triple {1626#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < 8); {1623#false} is VALID [2020-07-28 18:12:47,660 INFO L280 TraceCheckUtils]: 7: Hoare triple {1623#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {1623#false} is VALID [2020-07-28 18:12:47,660 INFO L280 TraceCheckUtils]: 8: Hoare triple {1623#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {1623#false} is VALID [2020-07-28 18:12:47,660 INFO L280 TraceCheckUtils]: 9: Hoare triple {1623#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {1623#false} is VALID [2020-07-28 18:12:47,660 INFO L280 TraceCheckUtils]: 10: Hoare triple {1623#false} assume parse_expression_list_#t~switch4; {1623#false} is VALID [2020-07-28 18:12:47,660 INFO L280 TraceCheckUtils]: 11: Hoare triple {1623#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {1623#false} is VALID [2020-07-28 18:12:47,661 INFO L280 TraceCheckUtils]: 12: Hoare triple {1623#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {1623#false} is VALID [2020-07-28 18:12:47,661 INFO L280 TraceCheckUtils]: 13: Hoare triple {1623#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {1623#false} is VALID [2020-07-28 18:12:47,661 INFO L280 TraceCheckUtils]: 14: Hoare triple {1623#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {1623#false} is VALID [2020-07-28 18:12:47,662 INFO L280 TraceCheckUtils]: 15: Hoare triple {1623#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {1623#false} is VALID [2020-07-28 18:12:47,662 INFO L280 TraceCheckUtils]: 16: Hoare triple {1623#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {1623#false} is VALID [2020-07-28 18:12:47,662 INFO L280 TraceCheckUtils]: 17: Hoare triple {1623#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,662 INFO L280 TraceCheckUtils]: 18: Hoare triple {1623#false} assume !parse_expression_list_#t~short14; {1623#false} is VALID [2020-07-28 18:12:47,662 INFO L280 TraceCheckUtils]: 19: Hoare triple {1623#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {1623#false} is VALID [2020-07-28 18:12:47,663 INFO L280 TraceCheckUtils]: 20: Hoare triple {1623#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,663 INFO L280 TraceCheckUtils]: 21: Hoare triple {1623#false} assume !parse_expression_list_#t~short17; {1623#false} is VALID [2020-07-28 18:12:47,663 INFO L280 TraceCheckUtils]: 22: Hoare triple {1623#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {1623#false} is VALID [2020-07-28 18:12:47,663 INFO L280 TraceCheckUtils]: 23: Hoare triple {1623#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1623#false} is VALID [2020-07-28 18:12:47,664 INFO L280 TraceCheckUtils]: 24: Hoare triple {1623#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1623#false} is VALID [2020-07-28 18:12:47,664 INFO L280 TraceCheckUtils]: 25: Hoare triple {1623#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1623#false} is VALID [2020-07-28 18:12:47,664 INFO L280 TraceCheckUtils]: 26: Hoare triple {1623#false} assume 0 == __VERIFIER_assert_~cond; {1623#false} is VALID [2020-07-28 18:12:47,664 INFO L280 TraceCheckUtils]: 27: Hoare triple {1623#false} assume !false; {1623#false} is VALID [2020-07-28 18:12:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:47,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:47,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:12:47,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678788597] [2020-07-28 18:12:47,666 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-28 18:12:47,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:47,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:47,703 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:47,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:47,704 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:47,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:47,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:47,704 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 6 states. [2020-07-28 18:12:47,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,842 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2020-07-28 18:12:47,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:47,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-28 18:12:47,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:47,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:47,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2020-07-28 18:12:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2020-07-28 18:12:47,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2020-07-28 18:12:47,939 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:47,941 INFO L225 Difference]: With dead ends: 92 [2020-07-28 18:12:47,941 INFO L226 Difference]: Without dead ends: 51 [2020-07-28 18:12:47,942 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:12:47,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-07-28 18:12:47,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2020-07-28 18:12:47,959 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:47,959 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 50 states. [2020-07-28 18:12:47,959 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 50 states. [2020-07-28 18:12:47,959 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 50 states. [2020-07-28 18:12:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,962 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2020-07-28 18:12:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2020-07-28 18:12:47,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:47,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:47,963 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 51 states. [2020-07-28 18:12:47,963 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 51 states. [2020-07-28 18:12:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:47,965 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2020-07-28 18:12:47,965 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2020-07-28 18:12:47,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:47,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:47,966 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:47,966 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:47,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-07-28 18:12:47,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2020-07-28 18:12:47,968 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 28 [2020-07-28 18:12:47,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:47,968 INFO L479 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2020-07-28 18:12:47,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2020-07-28 18:12:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-28 18:12:47,969 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:47,969 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:48,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-28 18:12:48,183 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 785821433, now seen corresponding path program 2 times [2020-07-28 18:12:48,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:48,185 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806201445] [2020-07-28 18:12:48,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:48,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:48,258 INFO L280 TraceCheckUtils]: 0: Hoare triple {1984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1984#true} is VALID [2020-07-28 18:12:48,259 INFO L280 TraceCheckUtils]: 1: Hoare triple {1984#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1986#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:48,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {1986#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1986#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:48,260 INFO L280 TraceCheckUtils]: 3: Hoare triple {1986#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1987#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:48,261 INFO L280 TraceCheckUtils]: 4: Hoare triple {1987#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1987#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:48,262 INFO L280 TraceCheckUtils]: 5: Hoare triple {1987#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1988#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:48,262 INFO L280 TraceCheckUtils]: 6: Hoare triple {1988#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1988#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:48,263 INFO L280 TraceCheckUtils]: 7: Hoare triple {1988#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1989#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:48,264 INFO L280 TraceCheckUtils]: 8: Hoare triple {1989#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 8); {1985#false} is VALID [2020-07-28 18:12:48,265 INFO L280 TraceCheckUtils]: 9: Hoare triple {1985#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {1985#false} is VALID [2020-07-28 18:12:48,265 INFO L280 TraceCheckUtils]: 10: Hoare triple {1985#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {1985#false} is VALID [2020-07-28 18:12:48,265 INFO L280 TraceCheckUtils]: 11: Hoare triple {1985#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {1985#false} is VALID [2020-07-28 18:12:48,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {1985#false} assume parse_expression_list_#t~switch4; {1985#false} is VALID [2020-07-28 18:12:48,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {1985#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {1985#false} is VALID [2020-07-28 18:12:48,266 INFO L280 TraceCheckUtils]: 14: Hoare triple {1985#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {1985#false} is VALID [2020-07-28 18:12:48,266 INFO L280 TraceCheckUtils]: 15: Hoare triple {1985#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {1985#false} is VALID [2020-07-28 18:12:48,266 INFO L280 TraceCheckUtils]: 16: Hoare triple {1985#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {1985#false} is VALID [2020-07-28 18:12:48,267 INFO L280 TraceCheckUtils]: 17: Hoare triple {1985#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {1985#false} is VALID [2020-07-28 18:12:48,267 INFO L280 TraceCheckUtils]: 18: Hoare triple {1985#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {1985#false} is VALID [2020-07-28 18:12:48,267 INFO L280 TraceCheckUtils]: 19: Hoare triple {1985#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {1985#false} is VALID [2020-07-28 18:12:48,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {1985#false} assume !parse_expression_list_#t~short14; {1985#false} is VALID [2020-07-28 18:12:48,268 INFO L280 TraceCheckUtils]: 21: Hoare triple {1985#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {1985#false} is VALID [2020-07-28 18:12:48,268 INFO L280 TraceCheckUtils]: 22: Hoare triple {1985#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {1985#false} is VALID [2020-07-28 18:12:48,268 INFO L280 TraceCheckUtils]: 23: Hoare triple {1985#false} assume !parse_expression_list_#t~short17; {1985#false} is VALID [2020-07-28 18:12:48,268 INFO L280 TraceCheckUtils]: 24: Hoare triple {1985#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {1985#false} is VALID [2020-07-28 18:12:48,269 INFO L280 TraceCheckUtils]: 25: Hoare triple {1985#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1985#false} is VALID [2020-07-28 18:12:48,269 INFO L280 TraceCheckUtils]: 26: Hoare triple {1985#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1985#false} is VALID [2020-07-28 18:12:48,269 INFO L280 TraceCheckUtils]: 27: Hoare triple {1985#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1985#false} is VALID [2020-07-28 18:12:48,269 INFO L280 TraceCheckUtils]: 28: Hoare triple {1985#false} assume 0 == __VERIFIER_assert_~cond; {1985#false} is VALID [2020-07-28 18:12:48,270 INFO L280 TraceCheckUtils]: 29: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2020-07-28 18:12:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:12:48,271 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806201445] [2020-07-28 18:12:48,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908489098] [2020-07-28 18:12:48,272 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:48,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:48,326 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:48,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:12:48,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:48,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:48,528 INFO L280 TraceCheckUtils]: 0: Hoare triple {1984#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1984#true} is VALID [2020-07-28 18:12:48,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {1984#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {1984#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 3: Hoare triple {1984#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 4: Hoare triple {1984#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 5: Hoare triple {1984#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 6: Hoare triple {1984#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {1984#true} is VALID [2020-07-28 18:12:48,529 INFO L280 TraceCheckUtils]: 7: Hoare triple {1984#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {1984#true} is VALID [2020-07-28 18:12:48,530 INFO L280 TraceCheckUtils]: 8: Hoare triple {1984#true} assume !(main_~i~1 < 8); {1984#true} is VALID [2020-07-28 18:12:48,531 INFO L280 TraceCheckUtils]: 9: Hoare triple {1984#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {2020#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} is VALID [2020-07-28 18:12:48,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {2020#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {2020#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} is VALID [2020-07-28 18:12:48,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {2020#(and (<= 0 ULTIMATE.start_parse_expression_list_~start~0) (<= (+ ULTIMATE.start_parse_expression_list_~i~0 1) 0))} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume parse_expression_list_#t~switch4; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,534 INFO L280 TraceCheckUtils]: 13: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,535 INFO L280 TraceCheckUtils]: 15: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,535 INFO L280 TraceCheckUtils]: 16: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {2027#(and (<= ULTIMATE.start_parse_expression_list_~i~0 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,537 INFO L280 TraceCheckUtils]: 19: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,538 INFO L280 TraceCheckUtils]: 20: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short14; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,538 INFO L280 TraceCheckUtils]: 21: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,539 INFO L280 TraceCheckUtils]: 22: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,539 INFO L280 TraceCheckUtils]: 23: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short17; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,540 INFO L280 TraceCheckUtils]: 24: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} is VALID [2020-07-28 18:12:48,541 INFO L280 TraceCheckUtils]: 25: Hoare triple {2049#(and (<= (+ ULTIMATE.start_parse_expression_list_~j~0 1) 0) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {1985#false} is VALID [2020-07-28 18:12:48,541 INFO L280 TraceCheckUtils]: 26: Hoare triple {1985#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {1985#false} is VALID [2020-07-28 18:12:48,542 INFO L280 TraceCheckUtils]: 27: Hoare triple {1985#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1985#false} is VALID [2020-07-28 18:12:48,542 INFO L280 TraceCheckUtils]: 28: Hoare triple {1985#false} assume 0 == __VERIFIER_assert_~cond; {1985#false} is VALID [2020-07-28 18:12:48,542 INFO L280 TraceCheckUtils]: 29: Hoare triple {1985#false} assume !false; {1985#false} is VALID [2020-07-28 18:12:48,543 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-28 18:12:48,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:48,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2020-07-28 18:12:48,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921494343] [2020-07-28 18:12:48,545 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-28 18:12:48,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:48,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:12:48,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:48,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:12:48,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:48,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:12:48,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:12:48,583 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 5 states. [2020-07-28 18:12:48,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:48,914 INFO L93 Difference]: Finished difference Result 112 states and 141 transitions. [2020-07-28 18:12:48,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:48,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2020-07-28 18:12:48,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2020-07-28 18:12:48,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:12:48,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 121 transitions. [2020-07-28 18:12:48,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 121 transitions. [2020-07-28 18:12:49,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:49,067 INFO L225 Difference]: With dead ends: 112 [2020-07-28 18:12:49,067 INFO L226 Difference]: Without dead ends: 61 [2020-07-28 18:12:49,068 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:12:49,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-07-28 18:12:49,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2020-07-28 18:12:49,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:49,085 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 45 states. [2020-07-28 18:12:49,086 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 45 states. [2020-07-28 18:12:49,086 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 45 states. [2020-07-28 18:12:49,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:49,087 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2020-07-28 18:12:49,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-07-28 18:12:49,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:49,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:49,088 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 61 states. [2020-07-28 18:12:49,088 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 61 states. [2020-07-28 18:12:49,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:49,090 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2020-07-28 18:12:49,090 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2020-07-28 18:12:49,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:49,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:49,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:49,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:49,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-28 18:12:49,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2020-07-28 18:12:49,092 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 30 [2020-07-28 18:12:49,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:49,093 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2020-07-28 18:12:49,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:12:49,093 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2020-07-28 18:12:49,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-28 18:12:49,093 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:49,093 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:49,298 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:49,299 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:49,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 255830495, now seen corresponding path program 1 times [2020-07-28 18:12:49,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:49,301 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088646793] [2020-07-28 18:12:49,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:49,377 INFO L280 TraceCheckUtils]: 0: Hoare triple {2395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2395#true} is VALID [2020-07-28 18:12:49,378 INFO L280 TraceCheckUtils]: 1: Hoare triple {2395#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {2397#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:49,378 INFO L280 TraceCheckUtils]: 2: Hoare triple {2397#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2397#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:49,379 INFO L280 TraceCheckUtils]: 3: Hoare triple {2397#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2398#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:49,379 INFO L280 TraceCheckUtils]: 4: Hoare triple {2398#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2398#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:49,380 INFO L280 TraceCheckUtils]: 5: Hoare triple {2398#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2399#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:49,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {2399#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2399#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:49,381 INFO L280 TraceCheckUtils]: 7: Hoare triple {2399#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2400#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:49,381 INFO L280 TraceCheckUtils]: 8: Hoare triple {2400#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 8); {2396#false} is VALID [2020-07-28 18:12:49,381 INFO L280 TraceCheckUtils]: 9: Hoare triple {2396#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {2396#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 11: Hoare triple {2396#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 12: Hoare triple {2396#false} assume !parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 13: Hoare triple {2396#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 14: Hoare triple {2396#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {2396#false} is VALID [2020-07-28 18:12:49,382 INFO L280 TraceCheckUtils]: 15: Hoare triple {2396#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 16: Hoare triple {2396#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 17: Hoare triple {2396#false} assume parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 18: Hoare triple {2396#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 19: Hoare triple {2396#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 20: Hoare triple {2396#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {2396#false} is VALID [2020-07-28 18:12:49,383 INFO L280 TraceCheckUtils]: 21: Hoare triple {2396#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 22: Hoare triple {2396#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 23: Hoare triple {2396#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 24: Hoare triple {2396#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 25: Hoare triple {2396#false} assume !parse_expression_list_#t~short14; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 26: Hoare triple {2396#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 27: Hoare triple {2396#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,384 INFO L280 TraceCheckUtils]: 28: Hoare triple {2396#false} assume !parse_expression_list_#t~short17; {2396#false} is VALID [2020-07-28 18:12:49,385 INFO L280 TraceCheckUtils]: 29: Hoare triple {2396#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {2396#false} is VALID [2020-07-28 18:12:49,385 INFO L280 TraceCheckUtils]: 30: Hoare triple {2396#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,385 INFO L280 TraceCheckUtils]: 31: Hoare triple {2396#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {2396#false} is VALID [2020-07-28 18:12:49,385 INFO L280 TraceCheckUtils]: 32: Hoare triple {2396#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2396#false} is VALID [2020-07-28 18:12:49,385 INFO L280 TraceCheckUtils]: 33: Hoare triple {2396#false} assume 0 == __VERIFIER_assert_~cond; {2396#false} is VALID [2020-07-28 18:12:49,386 INFO L280 TraceCheckUtils]: 34: Hoare triple {2396#false} assume !false; {2396#false} is VALID [2020-07-28 18:12:49,387 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:49,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088646793] [2020-07-28 18:12:49,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855795238] [2020-07-28 18:12:49,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:49,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:12:49,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:49,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:49,566 INFO L280 TraceCheckUtils]: 0: Hoare triple {2395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2395#true} is VALID [2020-07-28 18:12:49,570 INFO L280 TraceCheckUtils]: 1: Hoare triple {2395#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {2407#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:49,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {2407#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2407#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:49,571 INFO L280 TraceCheckUtils]: 3: Hoare triple {2407#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2398#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:49,572 INFO L280 TraceCheckUtils]: 4: Hoare triple {2398#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2398#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:49,573 INFO L280 TraceCheckUtils]: 5: Hoare triple {2398#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2399#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:49,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {2399#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2399#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:49,575 INFO L280 TraceCheckUtils]: 7: Hoare triple {2399#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2400#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:49,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {2400#(<= ULTIMATE.start_main_~i~1 3)} assume !(main_~i~1 < 8); {2396#false} is VALID [2020-07-28 18:12:49,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {2396#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {2396#false} is VALID [2020-07-28 18:12:49,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {2396#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {2396#false} is VALID [2020-07-28 18:12:49,576 INFO L280 TraceCheckUtils]: 11: Hoare triple {2396#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2396#false} is VALID [2020-07-28 18:12:49,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {2396#false} assume !parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {2396#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,576 INFO L280 TraceCheckUtils]: 14: Hoare triple {2396#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {2396#false} is VALID [2020-07-28 18:12:49,576 INFO L280 TraceCheckUtils]: 15: Hoare triple {2396#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {2396#false} is VALID [2020-07-28 18:12:49,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {2396#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2396#false} is VALID [2020-07-28 18:12:49,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {2396#false} assume parse_expression_list_#t~switch4; {2396#false} is VALID [2020-07-28 18:12:49,577 INFO L280 TraceCheckUtils]: 18: Hoare triple {2396#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {2396#false} is VALID [2020-07-28 18:12:49,577 INFO L280 TraceCheckUtils]: 19: Hoare triple {2396#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {2396#false} is VALID [2020-07-28 18:12:49,578 INFO L280 TraceCheckUtils]: 20: Hoare triple {2396#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {2396#false} is VALID [2020-07-28 18:12:49,578 INFO L280 TraceCheckUtils]: 21: Hoare triple {2396#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {2396#false} is VALID [2020-07-28 18:12:49,578 INFO L280 TraceCheckUtils]: 22: Hoare triple {2396#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {2396#false} is VALID [2020-07-28 18:12:49,578 INFO L280 TraceCheckUtils]: 23: Hoare triple {2396#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {2396#false} is VALID [2020-07-28 18:12:49,578 INFO L280 TraceCheckUtils]: 24: Hoare triple {2396#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,579 INFO L280 TraceCheckUtils]: 25: Hoare triple {2396#false} assume !parse_expression_list_#t~short14; {2396#false} is VALID [2020-07-28 18:12:49,579 INFO L280 TraceCheckUtils]: 26: Hoare triple {2396#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {2396#false} is VALID [2020-07-28 18:12:49,579 INFO L280 TraceCheckUtils]: 27: Hoare triple {2396#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,579 INFO L280 TraceCheckUtils]: 28: Hoare triple {2396#false} assume !parse_expression_list_#t~short17; {2396#false} is VALID [2020-07-28 18:12:49,579 INFO L280 TraceCheckUtils]: 29: Hoare triple {2396#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {2396#false} is VALID [2020-07-28 18:12:49,580 INFO L280 TraceCheckUtils]: 30: Hoare triple {2396#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {2396#false} is VALID [2020-07-28 18:12:49,580 INFO L280 TraceCheckUtils]: 31: Hoare triple {2396#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {2396#false} is VALID [2020-07-28 18:12:49,580 INFO L280 TraceCheckUtils]: 32: Hoare triple {2396#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2396#false} is VALID [2020-07-28 18:12:49,580 INFO L280 TraceCheckUtils]: 33: Hoare triple {2396#false} assume 0 == __VERIFIER_assert_~cond; {2396#false} is VALID [2020-07-28 18:12:49,580 INFO L280 TraceCheckUtils]: 34: Hoare triple {2396#false} assume !false; {2396#false} is VALID [2020-07-28 18:12:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:49,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:49,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-28 18:12:49,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924403704] [2020-07-28 18:12:49,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-28 18:12:49,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:49,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 18:12:49,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:49,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 18:12:49,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 18:12:49,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:49,621 INFO L87 Difference]: Start difference. First operand 45 states and 55 transitions. Second operand 7 states. [2020-07-28 18:12:49,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:49,712 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2020-07-28 18:12:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:12:49,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2020-07-28 18:12:49,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:49,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:12:49,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2020-07-28 18:12:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:12:49,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 90 transitions. [2020-07-28 18:12:49,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 90 transitions. [2020-07-28 18:12:49,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:49,811 INFO L225 Difference]: With dead ends: 84 [2020-07-28 18:12:49,812 INFO L226 Difference]: Without dead ends: 48 [2020-07-28 18:12:49,812 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:12:49,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-28 18:12:49,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-28 18:12:49,825 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:49,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-28 18:12:49,825 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-28 18:12:49,826 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-28 18:12:49,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:49,828 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-28 18:12:49,828 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-28 18:12:49,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:49,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:49,829 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-28 18:12:49,829 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-28 18:12:49,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:49,830 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2020-07-28 18:12:49,830 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2020-07-28 18:12:49,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:49,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:49,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:49,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-28 18:12:49,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2020-07-28 18:12:49,832 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 35 [2020-07-28 18:12:49,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:49,833 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2020-07-28 18:12:49,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 18:12:49,833 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2020-07-28 18:12:49,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-28 18:12:49,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:49,833 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:50,045 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:50,046 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:50,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:50,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1283892637, now seen corresponding path program 2 times [2020-07-28 18:12:50,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:50,047 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171682492] [2020-07-28 18:12:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:50,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:50,139 INFO L280 TraceCheckUtils]: 0: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2761#true} is VALID [2020-07-28 18:12:50,140 INFO L280 TraceCheckUtils]: 1: Hoare triple {2761#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {2763#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:50,141 INFO L280 TraceCheckUtils]: 2: Hoare triple {2763#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2763#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:50,141 INFO L280 TraceCheckUtils]: 3: Hoare triple {2763#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2764#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:50,142 INFO L280 TraceCheckUtils]: 4: Hoare triple {2764#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2764#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:50,142 INFO L280 TraceCheckUtils]: 5: Hoare triple {2764#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2765#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:50,143 INFO L280 TraceCheckUtils]: 6: Hoare triple {2765#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2765#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:50,143 INFO L280 TraceCheckUtils]: 7: Hoare triple {2765#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2766#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:50,144 INFO L280 TraceCheckUtils]: 8: Hoare triple {2766#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2766#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:50,144 INFO L280 TraceCheckUtils]: 9: Hoare triple {2766#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2767#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-28 18:12:50,145 INFO L280 TraceCheckUtils]: 10: Hoare triple {2767#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 8); {2762#false} is VALID [2020-07-28 18:12:50,145 INFO L280 TraceCheckUtils]: 11: Hoare triple {2762#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {2762#false} is VALID [2020-07-28 18:12:50,145 INFO L280 TraceCheckUtils]: 12: Hoare triple {2762#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {2762#false} is VALID [2020-07-28 18:12:50,145 INFO L280 TraceCheckUtils]: 13: Hoare triple {2762#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 14: Hoare triple {2762#false} assume !parse_expression_list_#t~switch4; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 15: Hoare triple {2762#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 16: Hoare triple {2762#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 17: Hoare triple {2762#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 18: Hoare triple {2762#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 19: Hoare triple {2762#false} assume parse_expression_list_#t~switch4; {2762#false} is VALID [2020-07-28 18:12:50,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {2762#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 21: Hoare triple {2762#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 22: Hoare triple {2762#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 23: Hoare triple {2762#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 24: Hoare triple {2762#false} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 25: Hoare triple {2762#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {2762#false} is VALID [2020-07-28 18:12:50,147 INFO L280 TraceCheckUtils]: 26: Hoare triple {2762#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 27: Hoare triple {2762#false} assume !parse_expression_list_#t~short14; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 28: Hoare triple {2762#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 29: Hoare triple {2762#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 30: Hoare triple {2762#false} assume !parse_expression_list_#t~short17; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 31: Hoare triple {2762#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 32: Hoare triple {2762#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {2762#false} is VALID [2020-07-28 18:12:50,148 INFO L280 TraceCheckUtils]: 33: Hoare triple {2762#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {2762#false} is VALID [2020-07-28 18:12:50,149 INFO L280 TraceCheckUtils]: 34: Hoare triple {2762#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2762#false} is VALID [2020-07-28 18:12:50,149 INFO L280 TraceCheckUtils]: 35: Hoare triple {2762#false} assume 0 == __VERIFIER_assert_~cond; {2762#false} is VALID [2020-07-28 18:12:50,149 INFO L280 TraceCheckUtils]: 36: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2020-07-28 18:12:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:50,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171682492] [2020-07-28 18:12:50,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107574255] [2020-07-28 18:12:50,150 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:50,191 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:50,192 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:50,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:12:50,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:50,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:50,360 INFO L280 TraceCheckUtils]: 0: Hoare triple {2761#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2761#true} is VALID [2020-07-28 18:12:50,360 INFO L280 TraceCheckUtils]: 1: Hoare triple {2761#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {2761#true} is VALID [2020-07-28 18:12:50,360 INFO L280 TraceCheckUtils]: 2: Hoare triple {2761#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2761#true} is VALID [2020-07-28 18:12:50,361 INFO L280 TraceCheckUtils]: 3: Hoare triple {2761#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2761#true} is VALID [2020-07-28 18:12:50,361 INFO L280 TraceCheckUtils]: 4: Hoare triple {2761#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2761#true} is VALID [2020-07-28 18:12:50,361 INFO L280 TraceCheckUtils]: 5: Hoare triple {2761#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2761#true} is VALID [2020-07-28 18:12:50,362 INFO L280 TraceCheckUtils]: 6: Hoare triple {2761#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2761#true} is VALID [2020-07-28 18:12:50,362 INFO L280 TraceCheckUtils]: 7: Hoare triple {2761#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2761#true} is VALID [2020-07-28 18:12:50,362 INFO L280 TraceCheckUtils]: 8: Hoare triple {2761#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {2761#true} is VALID [2020-07-28 18:12:50,362 INFO L280 TraceCheckUtils]: 9: Hoare triple {2761#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {2761#true} is VALID [2020-07-28 18:12:50,363 INFO L280 TraceCheckUtils]: 10: Hoare triple {2761#true} assume !(main_~i~1 < 8); {2761#true} is VALID [2020-07-28 18:12:50,364 INFO L280 TraceCheckUtils]: 11: Hoare triple {2761#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,364 INFO L280 TraceCheckUtils]: 12: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,364 INFO L280 TraceCheckUtils]: 13: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,365 INFO L280 TraceCheckUtils]: 14: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume !parse_expression_list_#t~switch4; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,365 INFO L280 TraceCheckUtils]: 15: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,366 INFO L280 TraceCheckUtils]: 16: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,366 INFO L280 TraceCheckUtils]: 17: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,366 INFO L280 TraceCheckUtils]: 18: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,367 INFO L280 TraceCheckUtils]: 19: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume parse_expression_list_#t~switch4; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,367 INFO L280 TraceCheckUtils]: 20: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,368 INFO L280 TraceCheckUtils]: 21: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,368 INFO L280 TraceCheckUtils]: 22: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,368 INFO L280 TraceCheckUtils]: 23: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,369 INFO L280 TraceCheckUtils]: 24: Hoare triple {2804#(<= 0 ULTIMATE.start_parse_expression_list_~start~0)} assume 34 == parse_expression_list_#t~mem9;havoc parse_expression_list_#t~mem9;parse_expression_list_#t~post10 := parse_expression_list_~start~0;parse_expression_list_~start~0 := 1 + parse_expression_list_#t~post10;havoc parse_expression_list_#t~post10; {2844#(<= 1 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,370 INFO L280 TraceCheckUtils]: 25: Hoare triple {2844#(<= 1 ULTIMATE.start_parse_expression_list_~start~0)} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {2844#(<= 1 ULTIMATE.start_parse_expression_list_~start~0)} is VALID [2020-07-28 18:12:50,370 INFO L280 TraceCheckUtils]: 26: Hoare triple {2844#(<= 1 ULTIMATE.start_parse_expression_list_~start~0)} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {2851#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (or (and (not |ULTIMATE.start_parse_expression_list_#t~short14|) (<= ULTIMATE.start_parse_expression_list_~j~0 0)) (and (< 0 ULTIMATE.start_parse_expression_list_~j~0) |ULTIMATE.start_parse_expression_list_#t~short14|)))} is VALID [2020-07-28 18:12:50,371 INFO L280 TraceCheckUtils]: 27: Hoare triple {2851#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (or (and (not |ULTIMATE.start_parse_expression_list_#t~short14|) (<= ULTIMATE.start_parse_expression_list_~j~0 0)) (and (< 0 ULTIMATE.start_parse_expression_list_~j~0) |ULTIMATE.start_parse_expression_list_#t~short14|)))} assume !parse_expression_list_#t~short14; {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} is VALID [2020-07-28 18:12:50,371 INFO L280 TraceCheckUtils]: 28: Hoare triple {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} is VALID [2020-07-28 18:12:50,372 INFO L280 TraceCheckUtils]: 29: Hoare triple {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} is VALID [2020-07-28 18:12:50,372 INFO L280 TraceCheckUtils]: 30: Hoare triple {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} assume !parse_expression_list_#t~short17; {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} is VALID [2020-07-28 18:12:50,373 INFO L280 TraceCheckUtils]: 31: Hoare triple {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} is VALID [2020-07-28 18:12:50,374 INFO L280 TraceCheckUtils]: 32: Hoare triple {2855#(and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~j~0 0))} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {2762#false} is VALID [2020-07-28 18:12:50,374 INFO L280 TraceCheckUtils]: 33: Hoare triple {2762#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {2762#false} is VALID [2020-07-28 18:12:50,374 INFO L280 TraceCheckUtils]: 34: Hoare triple {2762#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {2762#false} is VALID [2020-07-28 18:12:50,374 INFO L280 TraceCheckUtils]: 35: Hoare triple {2762#false} assume 0 == __VERIFIER_assert_~cond; {2762#false} is VALID [2020-07-28 18:12:50,374 INFO L280 TraceCheckUtils]: 36: Hoare triple {2762#false} assume !false; {2762#false} is VALID [2020-07-28 18:12:50,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2020-07-28 18:12:50,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:50,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2020-07-28 18:12:50,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093575942] [2020-07-28 18:12:50,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-28 18:12:50,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:50,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:12:50,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:50,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:12:50,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:50,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:12:50,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:12:50,415 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand 6 states. [2020-07-28 18:12:50,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:50,828 INFO L93 Difference]: Finished difference Result 140 states and 176 transitions. [2020-07-28 18:12:50,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:50,828 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2020-07-28 18:12:50,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2020-07-28 18:12:50,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:12:50,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2020-07-28 18:12:50,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 150 transitions. [2020-07-28 18:12:51,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:51,021 INFO L225 Difference]: With dead ends: 140 [2020-07-28 18:12:51,022 INFO L226 Difference]: Without dead ends: 103 [2020-07-28 18:12:51,022 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:12:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-07-28 18:12:51,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 69. [2020-07-28 18:12:51,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:51,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 69 states. [2020-07-28 18:12:51,050 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 69 states. [2020-07-28 18:12:51,051 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 69 states. [2020-07-28 18:12:51,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:51,054 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2020-07-28 18:12:51,054 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2020-07-28 18:12:51,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:51,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:51,055 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 103 states. [2020-07-28 18:12:51,055 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 103 states. [2020-07-28 18:12:51,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:51,058 INFO L93 Difference]: Finished difference Result 103 states and 129 transitions. [2020-07-28 18:12:51,058 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 129 transitions. [2020-07-28 18:12:51,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:51,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:51,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:51,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:51,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-07-28 18:12:51,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 88 transitions. [2020-07-28 18:12:51,060 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 88 transitions. Word has length 37 [2020-07-28 18:12:51,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:51,060 INFO L479 AbstractCegarLoop]: Abstraction has 69 states and 88 transitions. [2020-07-28 18:12:51,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:12:51,061 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 88 transitions. [2020-07-28 18:12:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-28 18:12:51,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:51,061 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:51,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2020-07-28 18:12:51,275 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:51,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:51,276 INFO L82 PathProgramCache]: Analyzing trace with hash 697086623, now seen corresponding path program 1 times [2020-07-28 18:12:51,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:51,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386621765] [2020-07-28 18:12:51,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:51,362 INFO L280 TraceCheckUtils]: 0: Hoare triple {3339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3339#true} is VALID [2020-07-28 18:12:51,363 INFO L280 TraceCheckUtils]: 1: Hoare triple {3339#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {3341#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:51,364 INFO L280 TraceCheckUtils]: 2: Hoare triple {3341#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3341#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:51,369 INFO L280 TraceCheckUtils]: 3: Hoare triple {3341#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3342#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:51,377 INFO L280 TraceCheckUtils]: 4: Hoare triple {3342#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3342#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:51,378 INFO L280 TraceCheckUtils]: 5: Hoare triple {3342#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3343#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:51,380 INFO L280 TraceCheckUtils]: 6: Hoare triple {3343#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3343#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:51,383 INFO L280 TraceCheckUtils]: 7: Hoare triple {3343#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3344#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:51,384 INFO L280 TraceCheckUtils]: 8: Hoare triple {3344#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3344#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:51,385 INFO L280 TraceCheckUtils]: 9: Hoare triple {3344#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3345#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-28 18:12:51,386 INFO L280 TraceCheckUtils]: 10: Hoare triple {3345#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 8); {3340#false} is VALID [2020-07-28 18:12:51,386 INFO L280 TraceCheckUtils]: 11: Hoare triple {3340#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {3340#false} is VALID [2020-07-28 18:12:51,386 INFO L280 TraceCheckUtils]: 12: Hoare triple {3340#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {3340#false} is VALID [2020-07-28 18:12:51,386 INFO L280 TraceCheckUtils]: 13: Hoare triple {3340#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3340#false} is VALID [2020-07-28 18:12:51,387 INFO L280 TraceCheckUtils]: 14: Hoare triple {3340#false} assume !parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,387 INFO L280 TraceCheckUtils]: 15: Hoare triple {3340#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,387 INFO L280 TraceCheckUtils]: 16: Hoare triple {3340#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {3340#false} is VALID [2020-07-28 18:12:51,387 INFO L280 TraceCheckUtils]: 17: Hoare triple {3340#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {3340#false} is VALID [2020-07-28 18:12:51,387 INFO L280 TraceCheckUtils]: 18: Hoare triple {3340#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3340#false} is VALID [2020-07-28 18:12:51,388 INFO L280 TraceCheckUtils]: 19: Hoare triple {3340#false} assume parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,388 INFO L280 TraceCheckUtils]: 20: Hoare triple {3340#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {3340#false} is VALID [2020-07-28 18:12:51,388 INFO L280 TraceCheckUtils]: 21: Hoare triple {3340#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {3340#false} is VALID [2020-07-28 18:12:51,388 INFO L280 TraceCheckUtils]: 22: Hoare triple {3340#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {3340#false} is VALID [2020-07-28 18:12:51,389 INFO L280 TraceCheckUtils]: 23: Hoare triple {3340#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {3340#false} is VALID [2020-07-28 18:12:51,389 INFO L280 TraceCheckUtils]: 24: Hoare triple {3340#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {3340#false} is VALID [2020-07-28 18:12:51,389 INFO L280 TraceCheckUtils]: 25: Hoare triple {3340#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {3340#false} is VALID [2020-07-28 18:12:51,389 INFO L280 TraceCheckUtils]: 26: Hoare triple {3340#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,390 INFO L280 TraceCheckUtils]: 27: Hoare triple {3340#false} assume !parse_expression_list_#t~short14; {3340#false} is VALID [2020-07-28 18:12:51,390 INFO L280 TraceCheckUtils]: 28: Hoare triple {3340#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {3340#false} is VALID [2020-07-28 18:12:51,390 INFO L280 TraceCheckUtils]: 29: Hoare triple {3340#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,391 INFO L280 TraceCheckUtils]: 30: Hoare triple {3340#false} assume !parse_expression_list_#t~short17; {3340#false} is VALID [2020-07-28 18:12:51,391 INFO L280 TraceCheckUtils]: 31: Hoare triple {3340#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {3340#false} is VALID [2020-07-28 18:12:51,391 INFO L280 TraceCheckUtils]: 32: Hoare triple {3340#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,391 INFO L280 TraceCheckUtils]: 33: Hoare triple {3340#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {3340#false} is VALID [2020-07-28 18:12:51,392 INFO L280 TraceCheckUtils]: 34: Hoare triple {3340#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3340#false} is VALID [2020-07-28 18:12:51,392 INFO L280 TraceCheckUtils]: 35: Hoare triple {3340#false} assume 0 == __VERIFIER_assert_~cond; {3340#false} is VALID [2020-07-28 18:12:51,393 INFO L280 TraceCheckUtils]: 36: Hoare triple {3340#false} assume !false; {3340#false} is VALID [2020-07-28 18:12:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:51,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386621765] [2020-07-28 18:12:51,395 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1426010659] [2020-07-28 18:12:51,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:51,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:12:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:51,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:51,642 INFO L280 TraceCheckUtils]: 0: Hoare triple {3339#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3339#true} is VALID [2020-07-28 18:12:51,644 INFO L280 TraceCheckUtils]: 1: Hoare triple {3339#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {3352#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:51,644 INFO L280 TraceCheckUtils]: 2: Hoare triple {3352#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3352#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-28 18:12:51,645 INFO L280 TraceCheckUtils]: 3: Hoare triple {3352#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3342#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:51,646 INFO L280 TraceCheckUtils]: 4: Hoare triple {3342#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3342#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:51,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {3342#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3343#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:51,647 INFO L280 TraceCheckUtils]: 6: Hoare triple {3343#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3343#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:51,648 INFO L280 TraceCheckUtils]: 7: Hoare triple {3343#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3344#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:51,649 INFO L280 TraceCheckUtils]: 8: Hoare triple {3344#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3344#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:51,649 INFO L280 TraceCheckUtils]: 9: Hoare triple {3344#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3345#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-28 18:12:51,650 INFO L280 TraceCheckUtils]: 10: Hoare triple {3345#(<= ULTIMATE.start_main_~i~1 4)} assume !(main_~i~1 < 8); {3340#false} is VALID [2020-07-28 18:12:51,650 INFO L280 TraceCheckUtils]: 11: Hoare triple {3340#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {3340#false} is VALID [2020-07-28 18:12:51,650 INFO L280 TraceCheckUtils]: 12: Hoare triple {3340#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {3340#false} is VALID [2020-07-28 18:12:51,650 INFO L280 TraceCheckUtils]: 13: Hoare triple {3340#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 14: Hoare triple {3340#false} assume !parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 15: Hoare triple {3340#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 16: Hoare triple {3340#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 17: Hoare triple {3340#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 18: Hoare triple {3340#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3340#false} is VALID [2020-07-28 18:12:51,651 INFO L280 TraceCheckUtils]: 19: Hoare triple {3340#false} assume parse_expression_list_#t~switch4; {3340#false} is VALID [2020-07-28 18:12:51,652 INFO L280 TraceCheckUtils]: 20: Hoare triple {3340#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {3340#false} is VALID [2020-07-28 18:12:51,652 INFO L280 TraceCheckUtils]: 21: Hoare triple {3340#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {3340#false} is VALID [2020-07-28 18:12:51,652 INFO L280 TraceCheckUtils]: 22: Hoare triple {3340#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {3340#false} is VALID [2020-07-28 18:12:51,652 INFO L280 TraceCheckUtils]: 23: Hoare triple {3340#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {3340#false} is VALID [2020-07-28 18:12:51,652 INFO L280 TraceCheckUtils]: 24: Hoare triple {3340#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 25: Hoare triple {3340#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 26: Hoare triple {3340#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 27: Hoare triple {3340#false} assume !parse_expression_list_#t~short14; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 28: Hoare triple {3340#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 29: Hoare triple {3340#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,653 INFO L280 TraceCheckUtils]: 30: Hoare triple {3340#false} assume !parse_expression_list_#t~short17; {3340#false} is VALID [2020-07-28 18:12:51,654 INFO L280 TraceCheckUtils]: 31: Hoare triple {3340#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {3340#false} is VALID [2020-07-28 18:12:51,654 INFO L280 TraceCheckUtils]: 32: Hoare triple {3340#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {3340#false} is VALID [2020-07-28 18:12:51,654 INFO L280 TraceCheckUtils]: 33: Hoare triple {3340#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {3340#false} is VALID [2020-07-28 18:12:51,654 INFO L280 TraceCheckUtils]: 34: Hoare triple {3340#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3340#false} is VALID [2020-07-28 18:12:51,654 INFO L280 TraceCheckUtils]: 35: Hoare triple {3340#false} assume 0 == __VERIFIER_assert_~cond; {3340#false} is VALID [2020-07-28 18:12:51,655 INFO L280 TraceCheckUtils]: 36: Hoare triple {3340#false} assume !false; {3340#false} is VALID [2020-07-28 18:12:51,656 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:51,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:12:51,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2020-07-28 18:12:51,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491093752] [2020-07-28 18:12:51,658 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-28 18:12:51,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:51,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:12:51,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:51,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:12:51,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:51,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:12:51,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:51,708 INFO L87 Difference]: Start difference. First operand 69 states and 88 transitions. Second operand 8 states. [2020-07-28 18:12:51,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:51,851 INFO L93 Difference]: Finished difference Result 130 states and 168 transitions. [2020-07-28 18:12:51,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:12:51,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-28 18:12:51,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:51,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:51,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2020-07-28 18:12:51,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:12:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 92 transitions. [2020-07-28 18:12:51,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 92 transitions. [2020-07-28 18:12:51,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:51,956 INFO L225 Difference]: With dead ends: 130 [2020-07-28 18:12:51,956 INFO L226 Difference]: Without dead ends: 72 [2020-07-28 18:12:51,957 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:12:51,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-07-28 18:12:51,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-07-28 18:12:51,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:51,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 71 states. [2020-07-28 18:12:51,976 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 71 states. [2020-07-28 18:12:51,977 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 71 states. [2020-07-28 18:12:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:51,979 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-28 18:12:51,979 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-28 18:12:51,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:51,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:51,980 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 72 states. [2020-07-28 18:12:51,980 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 72 states. [2020-07-28 18:12:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:51,981 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2020-07-28 18:12:51,981 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2020-07-28 18:12:51,982 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:51,982 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:51,982 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:51,982 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-07-28 18:12:51,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2020-07-28 18:12:51,984 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 37 [2020-07-28 18:12:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:51,985 INFO L479 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2020-07-28 18:12:51,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:12:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2020-07-28 18:12:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-07-28 18:12:51,986 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:12:51,986 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:12:52,197 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:52,198 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:12:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:12:52,199 INFO L82 PathProgramCache]: Analyzing trace with hash 822327005, now seen corresponding path program 2 times [2020-07-28 18:12:52,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:12:52,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435213802] [2020-07-28 18:12:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:12:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:52,302 INFO L280 TraceCheckUtils]: 0: Hoare triple {3844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3844#true} is VALID [2020-07-28 18:12:52,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {3844#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {3846#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:52,303 INFO L280 TraceCheckUtils]: 2: Hoare triple {3846#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3846#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-28 18:12:52,303 INFO L280 TraceCheckUtils]: 3: Hoare triple {3846#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3847#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:52,304 INFO L280 TraceCheckUtils]: 4: Hoare triple {3847#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3847#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-28 18:12:52,305 INFO L280 TraceCheckUtils]: 5: Hoare triple {3847#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3848#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:52,306 INFO L280 TraceCheckUtils]: 6: Hoare triple {3848#(<= ULTIMATE.start_main_~i~1 2)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3848#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-28 18:12:52,306 INFO L280 TraceCheckUtils]: 7: Hoare triple {3848#(<= ULTIMATE.start_main_~i~1 2)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3849#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:52,307 INFO L280 TraceCheckUtils]: 8: Hoare triple {3849#(<= ULTIMATE.start_main_~i~1 3)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3849#(<= ULTIMATE.start_main_~i~1 3)} is VALID [2020-07-28 18:12:52,308 INFO L280 TraceCheckUtils]: 9: Hoare triple {3849#(<= ULTIMATE.start_main_~i~1 3)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3850#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-28 18:12:52,308 INFO L280 TraceCheckUtils]: 10: Hoare triple {3850#(<= ULTIMATE.start_main_~i~1 4)} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3850#(<= ULTIMATE.start_main_~i~1 4)} is VALID [2020-07-28 18:12:52,309 INFO L280 TraceCheckUtils]: 11: Hoare triple {3850#(<= ULTIMATE.start_main_~i~1 4)} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3851#(<= ULTIMATE.start_main_~i~1 5)} is VALID [2020-07-28 18:12:52,309 INFO L280 TraceCheckUtils]: 12: Hoare triple {3851#(<= ULTIMATE.start_main_~i~1 5)} assume !(main_~i~1 < 8); {3845#false} is VALID [2020-07-28 18:12:52,310 INFO L280 TraceCheckUtils]: 13: Hoare triple {3845#false} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {3845#false} is VALID [2020-07-28 18:12:52,310 INFO L280 TraceCheckUtils]: 14: Hoare triple {3845#false} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {3845#false} is VALID [2020-07-28 18:12:52,310 INFO L280 TraceCheckUtils]: 15: Hoare triple {3845#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3845#false} is VALID [2020-07-28 18:12:52,310 INFO L280 TraceCheckUtils]: 16: Hoare triple {3845#false} assume !parse_expression_list_#t~switch4; {3845#false} is VALID [2020-07-28 18:12:52,311 INFO L280 TraceCheckUtils]: 17: Hoare triple {3845#false} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {3845#false} is VALID [2020-07-28 18:12:52,311 INFO L280 TraceCheckUtils]: 18: Hoare triple {3845#false} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {3845#false} is VALID [2020-07-28 18:12:52,311 INFO L280 TraceCheckUtils]: 19: Hoare triple {3845#false} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {3845#false} is VALID [2020-07-28 18:12:52,311 INFO L280 TraceCheckUtils]: 20: Hoare triple {3845#false} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3845#false} is VALID [2020-07-28 18:12:52,312 INFO L280 TraceCheckUtils]: 21: Hoare triple {3845#false} assume parse_expression_list_#t~switch4; {3845#false} is VALID [2020-07-28 18:12:52,312 INFO L280 TraceCheckUtils]: 22: Hoare triple {3845#false} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {3845#false} is VALID [2020-07-28 18:12:52,312 INFO L280 TraceCheckUtils]: 23: Hoare triple {3845#false} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {3845#false} is VALID [2020-07-28 18:12:52,312 INFO L280 TraceCheckUtils]: 24: Hoare triple {3845#false} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {3845#false} is VALID [2020-07-28 18:12:52,312 INFO L280 TraceCheckUtils]: 25: Hoare triple {3845#false} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 26: Hoare triple {3845#false} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 27: Hoare triple {3845#false} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 28: Hoare triple {3845#false} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 29: Hoare triple {3845#false} assume !parse_expression_list_#t~short14; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 30: Hoare triple {3845#false} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 31: Hoare triple {3845#false} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {3845#false} is VALID [2020-07-28 18:12:52,313 INFO L280 TraceCheckUtils]: 32: Hoare triple {3845#false} assume !parse_expression_list_#t~short17; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 33: Hoare triple {3845#false} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 34: Hoare triple {3845#false} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 35: Hoare triple {3845#false} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 36: Hoare triple {3845#false} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 37: Hoare triple {3845#false} assume 0 == __VERIFIER_assert_~cond; {3845#false} is VALID [2020-07-28 18:12:52,314 INFO L280 TraceCheckUtils]: 38: Hoare triple {3845#false} assume !false; {3845#false} is VALID [2020-07-28 18:12:52,315 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:12:52,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435213802] [2020-07-28 18:12:52,316 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159148679] [2020-07-28 18:12:52,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:52,354 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:12:52,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:12:52,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:12:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:12:52,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:12:52,463 INFO L523 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-28 18:12:52,512 INFO L280 TraceCheckUtils]: 0: Hoare triple {3844#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3844#true} is VALID [2020-07-28 18:12:52,512 INFO L280 TraceCheckUtils]: 1: Hoare triple {3844#true} havoc main_#res;havoc main_#t~nondet21, main_#t~post20, main_~i~1, main_#t~ret22, main_~#A~0.base, main_~#A~0.offset;call main_~#A~0.base, main_~#A~0.offset := #Ultimate.allocOnStack(9);main_~i~1 := 0; {3844#true} is VALID [2020-07-28 18:12:52,512 INFO L280 TraceCheckUtils]: 2: Hoare triple {3844#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3844#true} is VALID [2020-07-28 18:12:52,512 INFO L280 TraceCheckUtils]: 3: Hoare triple {3844#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3844#true} is VALID [2020-07-28 18:12:52,512 INFO L280 TraceCheckUtils]: 4: Hoare triple {3844#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 5: Hoare triple {3844#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 6: Hoare triple {3844#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 7: Hoare triple {3844#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 8: Hoare triple {3844#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 9: Hoare triple {3844#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 10: Hoare triple {3844#true} assume !!(main_~i~1 < 8);assume -128 <= main_#t~nondet21 && main_#t~nondet21 <= 127;call write~int(main_#t~nondet21, main_~#A~0.base, main_~#A~0.offset + main_~i~1, 1);havoc main_#t~nondet21; {3844#true} is VALID [2020-07-28 18:12:52,513 INFO L280 TraceCheckUtils]: 11: Hoare triple {3844#true} main_#t~post20 := main_~i~1;main_~i~1 := 1 + main_#t~post20;havoc main_#t~post20; {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 12: Hoare triple {3844#true} assume !(main_~i~1 < 8); {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 13: Hoare triple {3844#true} call write~int(0, main_~#A~0.base, 8 + main_~#A~0.offset, 1);parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset := main_~#A~0.base, main_~#A~0.offset;havoc parse_expression_list_#res;havoc parse_expression_list_#t~post2, parse_expression_list_#t~mem3, parse_expression_list_#t~switch4, parse_expression_list_#t~post8, parse_expression_list_#t~mem5, parse_expression_list_#t~mem6, parse_expression_list_#t~short7, parse_expression_list_#t~mem9, parse_expression_list_#t~post10, parse_expression_list_#t~post15, parse_expression_list_#t~mem11, parse_expression_list_#t~mem12, parse_expression_list_#t~short13, parse_expression_list_#t~short14, parse_expression_list_#t~mem16, parse_expression_list_#t~short17, parse_expression_list_#t~post18, parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset, parse_expression_list_#t~mem1, parse_expression_list_~str.base, parse_expression_list_~str.offset, parse_expression_list_~start~0, parse_expression_list_~i~0, parse_expression_list_~j~0, parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset;parse_expression_list_~str.base, parse_expression_list_~str.offset := parse_expression_list_#in~str.base, parse_expression_list_#in~str.offset;parse_expression_list_~start~0 := 0;parse_expression_list_~i~0 := -1;parse_expression_list_~j~0 := -1;call parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset := #Ultimate.allocOnStack(2); {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 14: Hoare triple {3844#true} assume !(parse_expression_list_~str.base == 0 && parse_expression_list_~str.offset == 0); {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 15: Hoare triple {3844#true} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 16: Hoare triple {3844#true} assume !parse_expression_list_#t~switch4; {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 17: Hoare triple {3844#true} havoc parse_expression_list_#t~mem3;havoc parse_expression_list_#t~switch4; {3844#true} is VALID [2020-07-28 18:12:52,514 INFO L280 TraceCheckUtils]: 18: Hoare triple {3844#true} call parse_expression_list_#t~mem1 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1); {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 19: Hoare triple {3844#true} assume !!(0 != parse_expression_list_#t~mem1);havoc parse_expression_list_#t~mem1; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 20: Hoare triple {3844#true} parse_expression_list_#t~post2 := parse_expression_list_~i~0;parse_expression_list_~i~0 := 1 + parse_expression_list_#t~post2;havoc parse_expression_list_#t~post2;call parse_expression_list_#t~mem3 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~i~0, 1);parse_expression_list_#t~switch4 := 0 == parse_expression_list_#t~mem3; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 21: Hoare triple {3844#true} assume parse_expression_list_#t~switch4; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 22: Hoare triple {3844#true} call parse_expression_list_#t~mem5 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 32 == parse_expression_list_#t~mem5; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 23: Hoare triple {3844#true} assume !parse_expression_list_#t~short7;call parse_expression_list_#t~mem6 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1);parse_expression_list_#t~short7 := 9 == parse_expression_list_#t~mem6; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 24: Hoare triple {3844#true} assume !parse_expression_list_#t~short7;havoc parse_expression_list_#t~short7;havoc parse_expression_list_#t~mem5;havoc parse_expression_list_#t~mem6; {3844#true} is VALID [2020-07-28 18:12:52,515 INFO L280 TraceCheckUtils]: 25: Hoare triple {3844#true} call parse_expression_list_#t~mem9 := read~int(parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1); {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 26: Hoare triple {3844#true} assume !(34 == parse_expression_list_#t~mem9);havoc parse_expression_list_#t~mem9; {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 27: Hoare triple {3844#true} parse_expression_list_~j~0 := parse_expression_list_~i~0 - 1; {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 28: Hoare triple {3844#true} parse_expression_list_#t~short14 := 0 < parse_expression_list_~j~0; {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 29: Hoare triple {3844#true} assume !parse_expression_list_#t~short14; {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 30: Hoare triple {3844#true} assume !parse_expression_list_#t~short14;havoc parse_expression_list_#t~mem12;havoc parse_expression_list_#t~mem11;havoc parse_expression_list_#t~short13;havoc parse_expression_list_#t~short14; {3844#true} is VALID [2020-07-28 18:12:52,516 INFO L280 TraceCheckUtils]: 31: Hoare triple {3844#true} parse_expression_list_#t~short17 := 0 < parse_expression_list_~j~0; {3844#true} is VALID [2020-07-28 18:12:52,517 INFO L280 TraceCheckUtils]: 32: Hoare triple {3844#true} assume !parse_expression_list_#t~short17; {3844#true} is VALID [2020-07-28 18:12:52,517 INFO L280 TraceCheckUtils]: 33: Hoare triple {3844#true} assume !parse_expression_list_#t~short17;havoc parse_expression_list_#t~mem16;havoc parse_expression_list_#t~short17; {3844#true} is VALID [2020-07-28 18:12:52,517 INFO L280 TraceCheckUtils]: 34: Hoare triple {3844#true} assume parse_expression_list_~start~0 <= parse_expression_list_~j~0; {3844#true} is VALID [2020-07-28 18:12:52,521 INFO L280 TraceCheckUtils]: 35: Hoare triple {3844#true} assume !(1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) >= 2);r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset, r_strncpy_#in~src.base, r_strncpy_#in~src.offset, r_strncpy_#in~n := parse_expression_list_~#str2~0.base, parse_expression_list_~#str2~0.offset, parse_expression_list_~str.base, parse_expression_list_~str.offset + parse_expression_list_~start~0, 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0);havoc r_strncpy_#res.base, r_strncpy_#res.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset, r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n;r_strncpy_~dest.base, r_strncpy_~dest.offset := r_strncpy_#in~dest.base, r_strncpy_#in~dest.offset;r_strncpy_~src.base, r_strncpy_~src.offset := r_strncpy_#in~src.base, r_strncpy_#in~src.offset;r_strncpy_~n := r_strncpy_#in~n;call r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset := strncpy(r_strncpy_~dest.base, r_strncpy_~dest.offset, r_strncpy_~src.base, r_strncpy_~src.offset, r_strncpy_~n);r_strncpy_#res.base, r_strncpy_#res.offset := r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset;havoc r_strncpy_#t~ret0.base, r_strncpy_#t~ret0.offset; {3960#(< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1))} is VALID [2020-07-28 18:12:52,525 INFO L280 TraceCheckUtils]: 36: Hoare triple {3960#(< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1))} parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset := r_strncpy_#res.base, r_strncpy_#res.offset;havoc parse_expression_list_#t~ret19.base, parse_expression_list_#t~ret19.offset;__VERIFIER_assert_#in~cond := (if 1 + (parse_expression_list_~j~0 - parse_expression_list_~start~0) < 2 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {3964#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} is VALID [2020-07-28 18:12:52,526 INFO L280 TraceCheckUtils]: 37: Hoare triple {3964#(<= 1 ULTIMATE.start___VERIFIER_assert_~cond)} assume 0 == __VERIFIER_assert_~cond; {3845#false} is VALID [2020-07-28 18:12:52,526 INFO L280 TraceCheckUtils]: 38: Hoare triple {3845#false} assume !false; {3845#false} is VALID [2020-07-28 18:12:52,527 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-28 18:12:52,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:12:52,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2020-07-28 18:12:52,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504232454] [2020-07-28 18:12:52,528 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-28 18:12:52,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:12:52,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:12:52,560 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:52,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:12:52,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:12:52,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:12:52,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:12:52,561 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand 4 states. [2020-07-28 18:12:52,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:52,768 INFO L93 Difference]: Finished difference Result 87 states and 111 transitions. [2020-07-28 18:12:52,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:12:52,768 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-07-28 18:12:52,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:12:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:52,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2020-07-28 18:12:52,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:12:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2020-07-28 18:12:52,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2020-07-28 18:12:52,860 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:12:52,860 INFO L225 Difference]: With dead ends: 87 [2020-07-28 18:12:52,860 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:12:52,861 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2020-07-28 18:12:52,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:12:52,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:12:52,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:12:52,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:52,862 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:52,862 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:52,863 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:52,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:52,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:52,863 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:52,863 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:12:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:12:52,863 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:12:52,863 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:52,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:52,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:12:52,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:12:52,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:12:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:12:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:12:52,864 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2020-07-28 18:12:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:12:52,864 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:12:52,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:12:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:12:52,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:12:53,065 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:12:53,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:12:53,161 INFO L268 CegarLoopResult]: For program point L60(line 60) no Hoare annotation was computed. [2020-07-28 18:12:53,161 INFO L268 CegarLoopResult]: For program point L60-2(line 60) no Hoare annotation was computed. [2020-07-28 18:12:53,161 INFO L268 CegarLoopResult]: For program point L60-4(lines 54 72) no Hoare annotation was computed. [2020-07-28 18:12:53,161 INFO L268 CegarLoopResult]: For program point L52-1(lines 52 73) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L52-2(lines 52 73) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L264 CegarLoopResult]: At program point L52-4(lines 52 73) the Hoare annotation is: (or (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (and (< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1)) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))) [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L52-5(lines 52 73) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L61(lines 61 70) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L264 CegarLoopResult]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond)) [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L62(lines 62 64) no Hoare annotation was computed. [2020-07-28 18:12:53,162 INFO L268 CegarLoopResult]: For program point L54(lines 54 72) no Hoare annotation was computed. [2020-07-28 18:12:53,163 INFO L268 CegarLoopResult]: For program point L79-2(lines 79 81) no Hoare annotation was computed. [2020-07-28 18:12:53,163 INFO L271 CegarLoopResult]: At program point L79-3(lines 79 81) the Hoare annotation is: true [2020-07-28 18:12:53,163 INFO L268 CegarLoopResult]: For program point L79-4(lines 79 81) no Hoare annotation was computed. [2020-07-28 18:12:53,163 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:12:53,163 INFO L268 CegarLoopResult]: For program point L55(line 55) no Hoare annotation was computed. [2020-07-28 18:12:53,163 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1)) [2020-07-28 18:12:53,163 INFO L268 CegarLoopResult]: For program point L56-1(line 56) no Hoare annotation was computed. [2020-07-28 18:12:53,164 INFO L268 CegarLoopResult]: For program point L56-3(line 56) no Hoare annotation was computed. [2020-07-28 18:12:53,164 INFO L264 CegarLoopResult]: At program point L56-5(line 56) the Hoare annotation is: (or (and (<= 1 ULTIMATE.start_parse_expression_list_~start~0) (<= ULTIMATE.start_parse_expression_list_~i~0 0)) (<= 1 ULTIMATE.start___VERIFIER_assert_~cond) (and (< ULTIMATE.start_parse_expression_list_~j~0 (+ ULTIMATE.start_parse_expression_list_~start~0 1)) (<= 0 ULTIMATE.start_parse_expression_list_~start~0))) [2020-07-28 18:12:53,164 INFO L268 CegarLoopResult]: For program point L56-6(line 56) no Hoare annotation was computed. [2020-07-28 18:12:53,164 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:12:53,164 INFO L268 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2020-07-28 18:12:53,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:12:53,165 INFO L268 CegarLoopResult]: For program point L57-2(line 57) no Hoare annotation was computed. [2020-07-28 18:12:53,165 INFO L271 CegarLoopResult]: At program point L74(lines 47 75) the Hoare annotation is: true [2020-07-28 18:12:53,165 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:12:53,165 INFO L268 CegarLoopResult]: For program point L59-1(line 59) no Hoare annotation was computed. [2020-07-28 18:12:53,165 INFO L268 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-07-28 18:12:53,166 INFO L268 CegarLoopResult]: For program point L59-4(line 59) no Hoare annotation was computed. [2020-07-28 18:12:53,166 INFO L268 CegarLoopResult]: For program point L59-6(line 59) no Hoare annotation was computed. [2020-07-28 18:12:53,166 INFO L271 CegarLoopResult]: At program point L84(lines 76 85) the Hoare annotation is: true [2020-07-28 18:12:53,166 INFO L268 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2020-07-28 18:12:53,166 INFO L271 CegarLoopResult]: At program point L59-8(line 59) the Hoare annotation is: true [2020-07-28 18:12:53,167 INFO L268 CegarLoopResult]: For program point L59-9(line 59) no Hoare annotation was computed. [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L79-4 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L79-2 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 18:12:53,171 WARN L170 areAnnotationChecker]: L51 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L52-5 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-28 18:12:53,172 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L56-6 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L56-3 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L52-2 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L57-2 has no Hoare annotation [2020-07-28 18:12:53,173 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L59-9 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 18:12:53,174 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L59-2 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L59-6 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-28 18:12:53,175 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2020-07-28 18:12:53,176 WARN L170 areAnnotationChecker]: L59-4 has no Hoare annotation [2020-07-28 18:12:53,176 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-28 18:12:53,176 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2020-07-28 18:12:53,176 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 18:12:53,176 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:12:53,177 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 18:12:53,178 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2020-07-28 18:12:53,178 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. [2020-07-28 18:12:53,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:12:53 BoogieIcfgContainer [2020-07-28 18:12:53,204 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:12:53,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:12:53,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:12:53,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:12:53,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:12:42" (3/4) ... [2020-07-28 18:12:53,211 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:12:53,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2020-07-28 18:12:53,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:12:53,225 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 18:12:53,293 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:12:53,293 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:12:53,297 INFO L168 Benchmark]: Toolchain (without parser) took 11876.19 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 313.5 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -151.4 MB). Peak memory consumption was 162.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,297 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:12:53,298 INFO L168 Benchmark]: CACSL2BoogieTranslator took 369.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,299 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,299 INFO L168 Benchmark]: Boogie Preprocessor took 41.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,300 INFO L168 Benchmark]: RCFGBuilder took 628.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,300 INFO L168 Benchmark]: TraceAbstraction took 10678.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,301 INFO L168 Benchmark]: Witness Printer took 89.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:12:53,303 INFO L336 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 369.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 962.9 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 628.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.4 MB). Peak memory consumption was 38.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10678.89 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 172.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -39.0 MB). Peak memory consumption was 133.5 MB. Max. memory is 11.5 GB. * Witness Printer took 89.57 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.8 MB). Peak memory consumption was 8.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: j < start + 1 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant Derived loop invariant: 1 <= cond || (j < start + 1 && 0 <= start) - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: j < start + 1 && 1 <= cond - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: ((1 <= start && i <= 0) || 1 <= cond) || (j < start + 1 && 0 <= start) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 76]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 10.4s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 440 SDtfs, 250 SDslu, 826 SDs, 0 SdLazy, 415 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 368 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 101 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 31 NumberOfFragments, 51 HoareAnnotationTreeSize, 8 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 21 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 644 NumberOfCodeBlocks, 606 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 623 ConstructedInterpolants, 0 QuantifiedInterpolants, 34391 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1087 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 21 InterpolantComputations, 7 PerfectInterpolantSequences, 72/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...