./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:16:24,059 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:16:24,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:16:24,095 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:16:24,096 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:16:24,098 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:16:24,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:16:24,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:16:24,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:16:24,106 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:16:24,107 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:16:24,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:16:24,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:16:24,110 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:16:24,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:16:24,113 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:16:24,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:16:24,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:16:24,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:16:24,121 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:16:24,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:16:24,123 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:16:24,124 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:16:24,124 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:16:24,129 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:16:24,130 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:16:24,130 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:16:24,131 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:16:24,131 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:16:24,132 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:16:24,132 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:16:24,133 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:16:24,134 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:16:24,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:16:24,135 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:16:24,136 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:16:24,136 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:16:24,136 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:16:24,136 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:16:24,137 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:16:24,137 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:16:24,139 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:16:24,165 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:16:24,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:16:24,165 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:16:24,165 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:16:24,166 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:16:24,166 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:16:24,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:16:24,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:16:24,167 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:16:24,171 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:16:24,171 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:16:24,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:16:24,173 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:16:24,173 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:16:24,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:16:24,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:16:24,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:16:24,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:24,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:16:24,174 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:16:24,175 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 715908359373978289cc76ce2f00faf49f4d4a3c6ddae64771646fc969bea981 [2022-02-20 18:16:24,351 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:16:24,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:16:24,369 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:16:24,370 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:16:24,370 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:16:24,371 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2022-02-20 18:16:24,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7795bab4b/e042e693b1464c6d9316eec631a224f1/FLAGf70929704 [2022-02-20 18:16:24,787 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:16:24,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c [2022-02-20 18:16:24,793 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7795bab4b/e042e693b1464c6d9316eec631a224f1/FLAGf70929704 [2022-02-20 18:16:25,222 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7795bab4b/e042e693b1464c6d9316eec631a224f1 [2022-02-20 18:16:25,224 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:16:25,225 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:16:25,227 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:25,227 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:16:25,229 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:16:25,230 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,231 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e7dd63b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,231 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:16:25,244 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:16:25,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c[454,467] [2022-02-20 18:16:25,335 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:25,341 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:16:25,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i15_o15-1.c[454,467] [2022-02-20 18:16:25,351 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:16:25,360 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:16:25,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25 WrapperNode [2022-02-20 18:16:25,360 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:16:25,361 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:25,361 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:16:25,361 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:16:25,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,383 INFO L137 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-02-20 18:16:25,384 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:16:25,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:16:25,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:16:25,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:16:25,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,393 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,394 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,402 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:16:25,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:16:25,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:16:25,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:16:25,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (1/1) ... [2022-02-20 18:16:25,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:16:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:25,449 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:16:25,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:16:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:16:25,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:16:25,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:16:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:16:25,494 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-02-20 18:16:25,494 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-02-20 18:16:25,538 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:16:25,539 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:16:25,681 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:16:25,686 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:16:25,703 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:16:25,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:25 BoogieIcfgContainer [2022-02-20 18:16:25,705 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:16:25,721 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:16:25,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:16:25,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:16:25,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:16:25" (1/3) ... [2022-02-20 18:16:25,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492b486b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:16:25" (2/3) ... [2022-02-20 18:16:25,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@492b486b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:16:25, skipping insertion in model container [2022-02-20 18:16:25,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:16:25" (3/3) ... [2022-02-20 18:16:25,726 INFO L111 eAbstractionObserver]: Analyzing ICFG id_i15_o15-1.c [2022-02-20 18:16:25,730 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:16:25,730 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:16:25,760 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:16:25,767 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:16:25,767 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:16:25,799 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 18:16:25,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 18:16:25,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:25,819 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:25,820 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:25,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:25,824 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-02-20 18:16:25,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:25,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691238067] [2022-02-20 18:16:25,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:25,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:25,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:25,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,042 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} ~x := #in~x; {26#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,044 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#(= |id_#in~x| 0)} assume true; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#(= |id_#in~x| 0)} {21#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {20#false} is VALID [2022-02-20 18:16:26,046 INFO L290 TraceCheckUtils]: 0: Hoare triple {19#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-02-20 18:16:26,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {21#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:26,047 INFO L272 TraceCheckUtils]: 2: Hoare triple {21#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {19#true} is VALID [2022-02-20 18:16:26,047 INFO L290 TraceCheckUtils]: 3: Hoare triple {19#true} ~x := #in~x; {26#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {26#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#(= |id_#in~x| 0)} assume true; {27#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,049 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {27#(= |id_#in~x| 0)} {21#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {20#false} is VALID [2022-02-20 18:16:26,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {20#false} is VALID [2022-02-20 18:16:26,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume 15 != main_~result~0#1; {20#false} is VALID [2022-02-20 18:16:26,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-02-20 18:16:26,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:16:26,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:26,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691238067] [2022-02-20 18:16:26,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691238067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:16:26,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:16:26,052 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:16:26,053 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989095293] [2022-02-20 18:16:26,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:16:26,060 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:16:26,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:26,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:26,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:16:26,082 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:26,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:16:26,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:16:26,115 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,220 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-02-20 18:16:26,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:16:26,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-02-20 18:16:26,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:26,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 18:16:26,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 18:16:26,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 18:16:26,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:26,263 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:26,263 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 18:16:26,265 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:16:26,268 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 11 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:26,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 36 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:26,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 18:16:26,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 18:16:26,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:26,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,294 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,294 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,297 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:16:26,298 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 15 states. [2022-02-20 18:16:26,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:26,300 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-02-20 18:16:26,300 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:26,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:26,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:26,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 18:16:26,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-02-20 18:16:26,304 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-02-20 18:16:26,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:26,304 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-02-20 18:16:26,304 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 18:16:26,304 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-02-20 18:16:26,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 18:16:26,305 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:26,305 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:26,305 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:16:26,306 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:26,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:26,306 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-02-20 18:16:26,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:26,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389678588] [2022-02-20 18:16:26,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,403 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {121#(= |id_#in~x| id_~x)} assume !(0 == ~x); {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,404 INFO L272 TraceCheckUtils]: 2: Hoare triple {121#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,406 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,407 INFO L290 TraceCheckUtils]: 8: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,408 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {126#(<= |id_#in~x| 1)} {110#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:26,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {110#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:26,409 INFO L272 TraceCheckUtils]: 2: Hoare triple {110#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:26,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,414 INFO L290 TraceCheckUtils]: 4: Hoare triple {121#(= |id_#in~x| id_~x)} assume !(0 == ~x); {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,414 INFO L272 TraceCheckUtils]: 5: Hoare triple {121#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {121#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {121#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {127#(= |id_#in~x| 0)} assume true; {127#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,416 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {127#(= |id_#in~x| 0)} {121#(= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,431 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {110#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:26,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 != main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:26,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:26,433 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:16:26,433 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:26,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389678588] [2022-02-20 18:16:26,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389678588] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:26,434 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378610128] [2022-02-20 18:16:26,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:26,434 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:26,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:26,443 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:26,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 18:16:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 18:16:26,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:26,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:26,692 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:26,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:26,693 INFO L272 TraceCheckUtils]: 2: Hoare triple {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:26,694 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,694 INFO L290 TraceCheckUtils]: 4: Hoare triple {141#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,694 INFO L272 TraceCheckUtils]: 5: Hoare triple {141#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:26,695 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {141#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:26,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,696 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= |id_#in~x| 0)} assume true; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:26,697 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {141#(<= |id_#in~x| id_~x)} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,697 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,697 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:26,698 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {134#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {109#false} is VALID [2022-02-20 18:16:26,699 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:26,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 != main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:26,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:26,699 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 18:16:26,700 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:27,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {109#false} assume !false; {109#false} is VALID [2022-02-20 18:16:27,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {109#false} assume 15 != main_~result~0#1; {109#false} is VALID [2022-02-20 18:16:27,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {109#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {109#false} is VALID [2022-02-20 18:16:27,107 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {126#(<= |id_#in~x| 1)} {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} #25#return; {109#false} is VALID [2022-02-20 18:16:27,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {126#(<= |id_#in~x| 1)} assume true; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,108 INFO L290 TraceCheckUtils]: 10: Hoare triple {126#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,109 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {154#(<= |id_#in~x| 0)} {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {126#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {154#(<= |id_#in~x| 0)} assume true; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,110 INFO L290 TraceCheckUtils]: 7: Hoare triple {211#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {154#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {108#true} ~x := #in~x; {211#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:27,110 INFO L272 TraceCheckUtils]: 5: Hoare triple {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {108#true} is VALID [2022-02-20 18:16:27,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:27,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {108#true} ~x := #in~x; {201#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:27,111 INFO L272 TraceCheckUtils]: 2: Hoare triple {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {108#true} is VALID [2022-02-20 18:16:27,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {108#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {188#(< 1 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:27,112 INFO L290 TraceCheckUtils]: 0: Hoare triple {108#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {108#true} is VALID [2022-02-20 18:16:27,112 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 18:16:27,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378610128] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:27,113 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:27,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2022-02-20 18:16:27,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132199721] [2022-02-20 18:16:27,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:27,115 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2022-02-20 18:16:27,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:27,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:27,143 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 18:16:27,143 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:27,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 18:16:27,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:16:27,144 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,239 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2022-02-20 18:16:27,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 18:16:27,240 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) Word has length 16 [2022-02-20 18:16:27,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:27,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 23 transitions. [2022-02-20 18:16:27,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 23 transitions. [2022-02-20 18:16:27,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:27,262 INFO L225 Difference]: With dead ends: 22 [2022-02-20 18:16:27,262 INFO L226 Difference]: Without dead ends: 18 [2022-02-20 18:16:27,262 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:16:27,263 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 28 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:27,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 39 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-02-20 18:16:27,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-02-20 18:16:27,266 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:27,266 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,267 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,267 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,268 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:27,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:27,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 18 states. [2022-02-20 18:16:27,270 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 18 states. [2022-02-20 18:16:27,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:27,271 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-02-20 18:16:27,271 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:27,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:27,272 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:27,272 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 18:16:27,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2022-02-20 18:16:27,273 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2022-02-20 18:16:27,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:27,274 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2022-02-20 18:16:27,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 12 states have internal predecessors, (21), 6 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-20 18:16:27,274 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2022-02-20 18:16:27,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 18:16:27,275 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:27,275 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:27,310 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:27,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:27,493 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:27,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:27,494 INFO L85 PathProgramCache]: Analyzing trace with hash -41010676, now seen corresponding path program 2 times [2022-02-20 18:16:27,494 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:27,494 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929604340] [2022-02-20 18:16:27,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:27,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:27,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,581 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,583 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,584 INFO L272 TraceCheckUtils]: 2: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,598 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,598 INFO L290 TraceCheckUtils]: 8: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,599 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,600 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,600 INFO L272 TraceCheckUtils]: 2: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,601 INFO L272 TraceCheckUtils]: 5: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,603 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,605 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,606 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {313#false} is VALID [2022-02-20 18:16:27,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:27,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {314#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:27,607 INFO L272 TraceCheckUtils]: 2: Hoare triple {314#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:27,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,608 INFO L272 TraceCheckUtils]: 5: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,608 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {331#(= |id_#in~x| id_~x)} assume !(0 == ~x); {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,609 INFO L272 TraceCheckUtils]: 8: Hoare triple {331#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {331#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,610 INFO L290 TraceCheckUtils]: 10: Hoare triple {331#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,610 INFO L290 TraceCheckUtils]: 11: Hoare triple {348#(= |id_#in~x| 0)} assume true; {348#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,611 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {348#(= |id_#in~x| 0)} {331#(= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,612 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {331#(= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,614 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {314#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {313#false} is VALID [2022-02-20 18:16:27,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:27,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 != main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:27,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:16:27,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:27,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929604340] [2022-02-20 18:16:27,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929604340] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:27,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493585158] [2022-02-20 18:16:27,615 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 18:16:27,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:27,617 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:27,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 18:16:27,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 18:16:27,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:27,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 18:16:27,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:27,673 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:27,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:27,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:27,806 INFO L272 TraceCheckUtils]: 2: Hoare triple {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:27,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {362#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,807 INFO L272 TraceCheckUtils]: 5: Hoare triple {362#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,807 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {362#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,807 INFO L272 TraceCheckUtils]: 8: Hoare triple {362#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:27,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {362#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:27,808 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,809 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |id_#in~x| 0)} assume true; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:27,809 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {384#(<= |id_#in~x| 0)} {362#(<= |id_#in~x| id_~x)} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,810 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,810 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:27,811 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {362#(<= |id_#in~x| id_~x)} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,811 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:27,812 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {355#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:27,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:27,813 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 != main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:27,813 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 18:16:27,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:28,490 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume !false; {313#false} is VALID [2022-02-20 18:16:28,490 INFO L290 TraceCheckUtils]: 20: Hoare triple {313#false} assume 15 != main_~result~0#1; {313#false} is VALID [2022-02-20 18:16:28,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {313#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {313#false} is VALID [2022-02-20 18:16:28,491 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {342#(<= |id_#in~x| 2)} {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} #25#return; {313#false} is VALID [2022-02-20 18:16:28,491 INFO L290 TraceCheckUtils]: 17: Hoare triple {342#(<= |id_#in~x| 2)} assume true; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,497 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {347#(<= |id_#in~x| 1)} {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {342#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:28,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {347#(<= |id_#in~x| 1)} assume true; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,498 INFO L290 TraceCheckUtils]: 13: Hoare triple {347#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,498 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {384#(<= |id_#in~x| 0)} {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {347#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:28,498 INFO L290 TraceCheckUtils]: 11: Hoare triple {384#(<= |id_#in~x| 0)} assume true; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:28,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {463#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {384#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:28,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} ~x := #in~x; {463#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:28,499 INFO L272 TraceCheckUtils]: 8: Hoare triple {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:28,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:28,500 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} ~x := #in~x; {453#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:28,500 INFO L272 TraceCheckUtils]: 5: Hoare triple {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {312#true} is VALID [2022-02-20 18:16:28,500 INFO L290 TraceCheckUtils]: 4: Hoare triple {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:28,500 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~x := #in~x; {440#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:28,501 INFO L272 TraceCheckUtils]: 2: Hoare triple {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {312#true} is VALID [2022-02-20 18:16:28,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {427#(< 2 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:28,501 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {312#true} is VALID [2022-02-20 18:16:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 18:16:28,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493585158] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:28,515 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:28,515 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 14 [2022-02-20 18:16:28,515 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517960265] [2022-02-20 18:16:28,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:28,519 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2022-02-20 18:16:28,524 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:28,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:28,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:28,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 18:16:28,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:28,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 18:16:28,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 18:16:28,542 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:28,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:28,657 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-02-20 18:16:28,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 18:16:28,658 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) Word has length 22 [2022-02-20 18:16:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:28,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:28,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:28,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2022-02-20 18:16:28,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 26 transitions. [2022-02-20 18:16:28,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:28,681 INFO L225 Difference]: With dead ends: 25 [2022-02-20 18:16:28,681 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 18:16:28,681 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:16:28,682 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 39 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:28,682 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 36 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 18:16:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 18:16:28,685 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:28,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:28,686 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:28,686 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:28,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:28,687 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:28,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:28,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:28,688 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:28,688 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Second operand 21 states. [2022-02-20 18:16:28,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:28,690 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-02-20 18:16:28,690 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:28,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:28,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:28,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:28,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:28,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-02-20 18:16:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-02-20 18:16:28,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2022-02-20 18:16:28,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:28,692 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-02-20 18:16:28,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (9), 3 states have call predecessors, (9), 7 states have call successors, (9) [2022-02-20 18:16:28,693 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-02-20 18:16:28,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 18:16:28,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:28,693 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:28,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:28,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 18:16:28,912 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:28,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:28,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 3 times [2022-02-20 18:16:28,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:28,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049062384] [2022-02-20 18:16:28,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:28,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:28,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:28,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:28,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,021 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,022 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,022 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,022 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,024 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,025 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,026 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,026 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,030 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,031 INFO L290 TraceCheckUtils]: 8: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,032 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,032 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,033 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,038 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,039 INFO L272 TraceCheckUtils]: 2: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,040 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,040 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,040 INFO L272 TraceCheckUtils]: 8: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,061 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,063 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,064 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,065 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {626#(<= |id_#in~x| 3)} {586#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {585#false} is VALID [2022-02-20 18:16:29,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:29,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {586#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:29,066 INFO L272 TraceCheckUtils]: 2: Hoare triple {586#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:29,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,066 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,067 INFO L272 TraceCheckUtils]: 5: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,067 INFO L290 TraceCheckUtils]: 7: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,067 INFO L272 TraceCheckUtils]: 8: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {609#(= |id_#in~x| id_~x)} assume !(0 == ~x); {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {609#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {609#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {609#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {643#(= |id_#in~x| 0)} assume true; {643#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,070 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {643#(= |id_#in~x| 0)} {609#(= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,070 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,071 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {642#(<= |id_#in~x| 1)} {609#(= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,072 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,072 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {637#(<= |id_#in~x| 2)} {609#(= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,074 INFO L290 TraceCheckUtils]: 22: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,075 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {626#(<= |id_#in~x| 3)} {586#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {585#false} is VALID [2022-02-20 18:16:29,075 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {585#false} is VALID [2022-02-20 18:16:29,075 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} assume 15 != main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:29,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:29,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:29,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049062384] [2022-02-20 18:16:29,076 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049062384] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:29,076 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [944407686] [2022-02-20 18:16:29,077 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 18:16:29,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:29,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:29,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:29,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 18:16:29,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 18:16:29,119 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:29,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 18:16:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:29,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:29,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:29,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {650#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:29,283 INFO L272 TraceCheckUtils]: 2: Hoare triple {650#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:29,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {657#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,284 INFO L272 TraceCheckUtils]: 5: Hoare triple {657#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,285 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,285 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,285 INFO L272 TraceCheckUtils]: 8: Hoare triple {657#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,286 INFO L290 TraceCheckUtils]: 10: Hoare triple {657#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,286 INFO L272 TraceCheckUtils]: 11: Hoare triple {657#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:29,286 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {657#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:29,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {657#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {688#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#(<= |id_#in~x| 0)} assume true; {688#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:29,288 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {688#(<= |id_#in~x| 0)} {657#(<= |id_#in~x| id_~x)} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:29,289 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {642#(<= |id_#in~x| 1)} {657#(<= |id_#in~x| id_~x)} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:29,291 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {637#(<= |id_#in~x| 2)} {657#(<= |id_#in~x| id_~x)} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:29,292 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {626#(<= |id_#in~x| 3)} {650#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {585#false} is VALID [2022-02-20 18:16:29,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {585#false} is VALID [2022-02-20 18:16:29,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} assume 15 != main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:29,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:29,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:29,293 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:30,515 INFO L290 TraceCheckUtils]: 27: Hoare triple {585#false} assume !false; {585#false} is VALID [2022-02-20 18:16:30,515 INFO L290 TraceCheckUtils]: 26: Hoare triple {585#false} assume 15 != main_~result~0#1; {585#false} is VALID [2022-02-20 18:16:30,515 INFO L290 TraceCheckUtils]: 25: Hoare triple {585#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {585#false} is VALID [2022-02-20 18:16:30,516 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {626#(<= |id_#in~x| 3)} {740#(< 3 |ULTIMATE.start_main_~input~0#1|)} #25#return; {585#false} is VALID [2022-02-20 18:16:30,517 INFO L290 TraceCheckUtils]: 23: Hoare triple {626#(<= |id_#in~x| 3)} assume true; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:30,517 INFO L290 TraceCheckUtils]: 22: Hoare triple {626#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:30,518 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {637#(<= |id_#in~x| 2)} {753#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {626#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:30,518 INFO L290 TraceCheckUtils]: 20: Hoare triple {637#(<= |id_#in~x| 2)} assume true; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:30,518 INFO L290 TraceCheckUtils]: 19: Hoare triple {637#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:30,519 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {642#(<= |id_#in~x| 1)} {766#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {637#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:30,519 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#(<= |id_#in~x| 1)} assume true; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:30,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:30,520 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {688#(<= |id_#in~x| 0)} {779#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {642#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:30,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {688#(<= |id_#in~x| 0)} assume true; {688#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:30,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {789#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {688#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:30,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {584#true} ~x := #in~x; {789#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:30,522 INFO L272 TraceCheckUtils]: 11: Hoare triple {779#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:30,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {779#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {779#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:30,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {584#true} ~x := #in~x; {779#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:30,523 INFO L272 TraceCheckUtils]: 8: Hoare triple {766#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:30,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {766#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {766#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:30,524 INFO L290 TraceCheckUtils]: 6: Hoare triple {584#true} ~x := #in~x; {766#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:30,524 INFO L272 TraceCheckUtils]: 5: Hoare triple {753#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {584#true} is VALID [2022-02-20 18:16:30,524 INFO L290 TraceCheckUtils]: 4: Hoare triple {753#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {753#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:30,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {584#true} ~x := #in~x; {753#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:30,525 INFO L272 TraceCheckUtils]: 2: Hoare triple {740#(< 3 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {584#true} is VALID [2022-02-20 18:16:30,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {584#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {740#(< 3 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:30,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {584#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {584#true} is VALID [2022-02-20 18:16:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 18:16:30,526 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [944407686] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:30,526 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:30,526 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 16 [2022-02-20 18:16:30,526 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861005941] [2022-02-20 18:16:30,526 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:30,527 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 28 [2022-02-20 18:16:30,533 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:30,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 18:16:30,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:30,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-02-20 18:16:30,565 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:30,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-02-20 18:16:30,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2022-02-20 18:16:30,566 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 18:16:30,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:30,713 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-02-20 18:16:30,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:16:30,713 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) Word has length 28 [2022-02-20 18:16:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:30,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 18:16:30,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 18:16:30,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 18:16:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2022-02-20 18:16:30,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2022-02-20 18:16:30,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:30,739 INFO L225 Difference]: With dead ends: 28 [2022-02-20 18:16:30,739 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 18:16:30,740 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=114, Invalid=266, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:16:30,740 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:30,741 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 53 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 18:16:30,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 18:16:30,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:30,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:16:30,743 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:16:30,744 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:16:30,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:30,745 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 18:16:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 18:16:30,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:30,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:30,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Second operand 24 states. [2022-02-20 18:16:30,746 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) Second operand 24 states. [2022-02-20 18:16:30,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:30,747 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-02-20 18:16:30,747 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 18:16:30,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:30,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:30,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:30,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:30,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 2 states have call successors, (2), 1 states have call predecessors, (2), 5 states have return successors, (6), 5 states have call predecessors, (6), 2 states have call successors, (6) [2022-02-20 18:16:30,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-02-20 18:16:30,749 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 28 [2022-02-20 18:16:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:30,749 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-02-20 18:16:30,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.230769230769231) internal successors, (29), 16 states have internal predecessors, (29), 8 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (12), 4 states have call predecessors, (12), 8 states have call successors, (12) [2022-02-20 18:16:30,750 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-02-20 18:16:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 18:16:30,750 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:30,750 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:30,775 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:30,967 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:30,968 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:30,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:30,968 INFO L85 PathProgramCache]: Analyzing trace with hash 371264716, now seen corresponding path program 4 times [2022-02-20 18:16:30,968 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:30,968 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714596758] [2022-02-20 18:16:30,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:30,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,216 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,218 INFO L272 TraceCheckUtils]: 2: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,219 INFO L290 TraceCheckUtils]: 5: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,220 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,221 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1017#(<= |id_#in~x| 1)} {961#(= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,221 INFO L272 TraceCheckUtils]: 2: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,222 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,222 INFO L272 TraceCheckUtils]: 5: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,225 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,227 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1017#(<= |id_#in~x| 1)} {961#(= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,228 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1012#(<= |id_#in~x| 2)} {961#(= |id_#in~x| id_~x)} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,228 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,228 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,229 INFO L272 TraceCheckUtils]: 2: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,229 INFO L272 TraceCheckUtils]: 5: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,231 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,231 INFO L290 TraceCheckUtils]: 14: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,232 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1017#(<= |id_#in~x| 1)} {961#(= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,232 INFO L290 TraceCheckUtils]: 16: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,234 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1012#(<= |id_#in~x| 2)} {961#(= |id_#in~x| id_~x)} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1001#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1001#(<= |id_#in~x| 3)} assume true; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,235 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1001#(<= |id_#in~x| 3)} {961#(= |id_#in~x| id_~x)} #27#return; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,235 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,236 INFO L272 TraceCheckUtils]: 2: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,236 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,236 INFO L290 TraceCheckUtils]: 4: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,236 INFO L272 TraceCheckUtils]: 5: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,237 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,237 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,237 INFO L272 TraceCheckUtils]: 8: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,237 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,237 INFO L272 TraceCheckUtils]: 11: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,238 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,238 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,238 INFO L290 TraceCheckUtils]: 14: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,239 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,241 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1017#(<= |id_#in~x| 1)} {961#(= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,242 INFO L290 TraceCheckUtils]: 19: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,249 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1012#(<= |id_#in~x| 2)} {961#(= |id_#in~x| id_~x)} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {1001#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {1001#(<= |id_#in~x| 3)} assume true; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,250 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1001#(<= |id_#in~x| 3)} {961#(= |id_#in~x| id_~x)} #27#return; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {984#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,251 INFO L290 TraceCheckUtils]: 26: Hoare triple {984#(<= |id_#in~x| 4)} assume true; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,251 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {984#(<= |id_#in~x| 4)} {932#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {931#false} is VALID [2022-02-20 18:16:31,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {930#true} is VALID [2022-02-20 18:16:31,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {930#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {932#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:31,252 INFO L272 TraceCheckUtils]: 2: Hoare triple {932#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {930#true} is VALID [2022-02-20 18:16:31,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,252 INFO L272 TraceCheckUtils]: 5: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,253 INFO L290 TraceCheckUtils]: 7: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,253 INFO L272 TraceCheckUtils]: 8: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,253 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,253 INFO L290 TraceCheckUtils]: 10: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,253 INFO L272 TraceCheckUtils]: 11: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {961#(= |id_#in~x| id_~x)} assume !(0 == ~x); {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,254 INFO L272 TraceCheckUtils]: 14: Hoare triple {961#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,254 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#true} ~x := #in~x; {961#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,254 INFO L290 TraceCheckUtils]: 16: Hoare triple {961#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,255 INFO L290 TraceCheckUtils]: 17: Hoare triple {1018#(= |id_#in~x| 0)} assume true; {1018#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,255 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1018#(= |id_#in~x| 0)} {961#(= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,255 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,256 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,256 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1017#(<= |id_#in~x| 1)} {961#(= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,256 INFO L290 TraceCheckUtils]: 22: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,257 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,257 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1012#(<= |id_#in~x| 2)} {961#(= |id_#in~x| id_~x)} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,257 INFO L290 TraceCheckUtils]: 25: Hoare triple {1001#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,258 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#(<= |id_#in~x| 3)} assume true; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,258 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1001#(<= |id_#in~x| 3)} {961#(= |id_#in~x| id_~x)} #27#return; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,258 INFO L290 TraceCheckUtils]: 28: Hoare triple {984#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {984#(<= |id_#in~x| 4)} assume true; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,259 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {984#(<= |id_#in~x| 4)} {932#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {931#false} is VALID [2022-02-20 18:16:31,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {931#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {931#false} is VALID [2022-02-20 18:16:31,259 INFO L290 TraceCheckUtils]: 32: Hoare triple {931#false} assume 15 != main_~result~0#1; {931#false} is VALID [2022-02-20 18:16:31,259 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#false} assume !false; {931#false} is VALID [2022-02-20 18:16:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 18:16:31,259 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:31,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714596758] [2022-02-20 18:16:31,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714596758] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:31,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223343013] [2022-02-20 18:16:31,260 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 18:16:31,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:31,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:31,276 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:31,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 18:16:31,358 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 18:16:31,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:31,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 18:16:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:31,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:31,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {930#true} is VALID [2022-02-20 18:16:31,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {930#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1025#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:31,509 INFO L272 TraceCheckUtils]: 2: Hoare triple {1025#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {930#true} is VALID [2022-02-20 18:16:31,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {1032#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,510 INFO L272 TraceCheckUtils]: 5: Hoare triple {1032#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {1032#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,510 INFO L272 TraceCheckUtils]: 8: Hoare triple {1032#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,511 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#true} ~x := #in~x; {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {1032#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,511 INFO L272 TraceCheckUtils]: 11: Hoare triple {1032#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,511 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#true} ~x := #in~x; {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,512 INFO L290 TraceCheckUtils]: 13: Hoare triple {1032#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,512 INFO L272 TraceCheckUtils]: 14: Hoare triple {1032#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:31,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#true} ~x := #in~x; {1032#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:31,513 INFO L290 TraceCheckUtils]: 16: Hoare triple {1032#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1072#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#(<= |id_#in~x| 0)} assume true; {1072#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:31,514 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#(<= |id_#in~x| 0)} {1032#(<= |id_#in~x| id_~x)} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:31,515 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1017#(<= |id_#in~x| 1)} {1032#(<= |id_#in~x| id_~x)} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,515 INFO L290 TraceCheckUtils]: 22: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,516 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:31,516 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1012#(<= |id_#in~x| 2)} {1032#(<= |id_#in~x| id_~x)} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,517 INFO L290 TraceCheckUtils]: 25: Hoare triple {1001#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,517 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#(<= |id_#in~x| 3)} assume true; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:31,518 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1001#(<= |id_#in~x| 3)} {1032#(<= |id_#in~x| id_~x)} #27#return; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {984#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,519 INFO L290 TraceCheckUtils]: 29: Hoare triple {984#(<= |id_#in~x| 4)} assume true; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:31,519 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {984#(<= |id_#in~x| 4)} {1025#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {931#false} is VALID [2022-02-20 18:16:31,519 INFO L290 TraceCheckUtils]: 31: Hoare triple {931#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {931#false} is VALID [2022-02-20 18:16:31,519 INFO L290 TraceCheckUtils]: 32: Hoare triple {931#false} assume 15 != main_~result~0#1; {931#false} is VALID [2022-02-20 18:16:31,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#false} assume !false; {931#false} is VALID [2022-02-20 18:16:31,520 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-02-20 18:16:31,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:33,535 INFO L290 TraceCheckUtils]: 33: Hoare triple {931#false} assume !false; {931#false} is VALID [2022-02-20 18:16:33,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {931#false} assume 15 != main_~result~0#1; {931#false} is VALID [2022-02-20 18:16:33,536 INFO L290 TraceCheckUtils]: 31: Hoare triple {931#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {931#false} is VALID [2022-02-20 18:16:33,537 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {984#(<= |id_#in~x| 4)} {1133#(< 4 |ULTIMATE.start_main_~input~0#1|)} #25#return; {931#false} is VALID [2022-02-20 18:16:33,537 INFO L290 TraceCheckUtils]: 29: Hoare triple {984#(<= |id_#in~x| 4)} assume true; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:33,537 INFO L290 TraceCheckUtils]: 28: Hoare triple {984#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:33,538 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1001#(<= |id_#in~x| 3)} {1146#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {984#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:33,538 INFO L290 TraceCheckUtils]: 26: Hoare triple {1001#(<= |id_#in~x| 3)} assume true; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:33,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {1001#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:33,539 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1012#(<= |id_#in~x| 2)} {1159#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {1001#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:33,540 INFO L290 TraceCheckUtils]: 23: Hoare triple {1012#(<= |id_#in~x| 2)} assume true; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:33,540 INFO L290 TraceCheckUtils]: 22: Hoare triple {1012#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:33,541 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1017#(<= |id_#in~x| 1)} {1172#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {1012#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:33,541 INFO L290 TraceCheckUtils]: 20: Hoare triple {1017#(<= |id_#in~x| 1)} assume true; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:33,541 INFO L290 TraceCheckUtils]: 19: Hoare triple {1017#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:33,542 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1072#(<= |id_#in~x| 0)} {1185#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {1017#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:33,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {1072#(<= |id_#in~x| 0)} assume true; {1072#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:33,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {1195#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {1072#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:33,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {930#true} ~x := #in~x; {1195#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:33,543 INFO L272 TraceCheckUtils]: 14: Hoare triple {1185#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:33,543 INFO L290 TraceCheckUtils]: 13: Hoare triple {1185#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {1185#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:33,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {930#true} ~x := #in~x; {1185#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:33,544 INFO L272 TraceCheckUtils]: 11: Hoare triple {1172#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:33,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {1172#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:33,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {930#true} ~x := #in~x; {1172#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:33,544 INFO L272 TraceCheckUtils]: 8: Hoare triple {1159#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:33,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {1159#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {1159#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:33,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {930#true} ~x := #in~x; {1159#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:33,545 INFO L272 TraceCheckUtils]: 5: Hoare triple {1146#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {930#true} is VALID [2022-02-20 18:16:33,546 INFO L290 TraceCheckUtils]: 4: Hoare triple {1146#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {1146#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:33,546 INFO L290 TraceCheckUtils]: 3: Hoare triple {930#true} ~x := #in~x; {1146#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:33,546 INFO L272 TraceCheckUtils]: 2: Hoare triple {1133#(< 4 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {930#true} is VALID [2022-02-20 18:16:33,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {930#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1133#(< 4 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:33,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {930#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {930#true} is VALID [2022-02-20 18:16:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 18:16:33,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223343013] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:33,547 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:33,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 18 [2022-02-20 18:16:33,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485302601] [2022-02-20 18:16:33,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:33,548 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) Word has length 34 [2022-02-20 18:16:33,601 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:33,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:16:33,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:33,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 18:16:33,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:33,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 18:16:33,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2022-02-20 18:16:33,651 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:16:33,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,882 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-02-20 18:16:33,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 18:16:33,883 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) Word has length 34 [2022-02-20 18:16:33,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:33,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:16:33,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-02-20 18:16:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:16:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 32 transitions. [2022-02-20 18:16:33,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 32 transitions. [2022-02-20 18:16:33,917 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:33,918 INFO L225 Difference]: With dead ends: 31 [2022-02-20 18:16:33,918 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 18:16:33,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2022-02-20 18:16:33,919 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:33,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 67 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:16:33,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 18:16:33,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 18:16:33,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:33,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:16:33,924 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:16:33,924 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:16:33,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,925 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 18:16:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 18:16:33,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:33,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:33,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) Second operand 27 states. [2022-02-20 18:16:33,926 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) Second operand 27 states. [2022-02-20 18:16:33,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:33,927 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 18:16:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 18:16:33,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:33,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:33,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:33,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:33,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 6 states have return successors, (7), 6 states have call predecessors, (7), 2 states have call successors, (7) [2022-02-20 18:16:33,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-02-20 18:16:33,929 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 34 [2022-02-20 18:16:33,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:33,929 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-02-20 18:16:33,929 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.2) internal successors, (33), 18 states have internal predecessors, (33), 9 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (15), 5 states have call predecessors, (15), 9 states have call successors, (15) [2022-02-20 18:16:33,929 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-02-20 18:16:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-02-20 18:16:33,930 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:33,930 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:33,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:34,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:34,148 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:34,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:34,148 INFO L85 PathProgramCache]: Analyzing trace with hash -886339242, now seen corresponding path program 5 times [2022-02-20 18:16:34,148 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:34,148 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100660613] [2022-02-20 18:16:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:34,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,276 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,276 INFO L272 TraceCheckUtils]: 2: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,277 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,278 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,279 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,280 INFO L272 TraceCheckUtils]: 2: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,281 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,294 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,295 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,297 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1393#(= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,297 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,297 INFO L272 TraceCheckUtils]: 2: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,298 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,298 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,298 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,298 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,299 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,299 INFO L272 TraceCheckUtils]: 8: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,299 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,299 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,300 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,300 INFO L290 TraceCheckUtils]: 13: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,301 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,302 INFO L290 TraceCheckUtils]: 16: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,303 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1393#(= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,304 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1393#(= |id_#in~x| id_~x)} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,304 INFO L272 TraceCheckUtils]: 2: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,305 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,306 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,306 INFO L272 TraceCheckUtils]: 8: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,306 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,306 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,307 INFO L272 TraceCheckUtils]: 11: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,308 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,308 INFO L290 TraceCheckUtils]: 16: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,309 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,309 INFO L290 TraceCheckUtils]: 19: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,310 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1393#(= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,311 INFO L290 TraceCheckUtils]: 23: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,311 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1393#(= |id_#in~x| id_~x)} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {1445#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {1445#(<= |id_#in~x| 4)} assume true; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,313 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1445#(<= |id_#in~x| 4)} {1393#(= |id_#in~x| id_~x)} #27#return; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,328 INFO L272 TraceCheckUtils]: 2: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,329 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,329 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,330 INFO L272 TraceCheckUtils]: 8: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,330 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,330 INFO L272 TraceCheckUtils]: 11: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,331 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,331 INFO L290 TraceCheckUtils]: 13: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,331 INFO L272 TraceCheckUtils]: 14: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,333 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,334 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,336 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1393#(= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,336 INFO L290 TraceCheckUtils]: 26: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,337 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1393#(= |id_#in~x| id_~x)} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {1445#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {1445#(<= |id_#in~x| 4)} assume true; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,338 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1445#(<= |id_#in~x| 4)} {1393#(= |id_#in~x| id_~x)} #27#return; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {1422#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {1422#(<= |id_#in~x| 5)} assume true; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,339 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1422#(<= |id_#in~x| 5)} {1358#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1357#false} is VALID [2022-02-20 18:16:34,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1356#true} is VALID [2022-02-20 18:16:34,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1358#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:34,340 INFO L272 TraceCheckUtils]: 2: Hoare triple {1358#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {1356#true} is VALID [2022-02-20 18:16:34,340 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,341 INFO L290 TraceCheckUtils]: 4: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,341 INFO L272 TraceCheckUtils]: 5: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,341 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,341 INFO L272 TraceCheckUtils]: 8: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,342 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,342 INFO L272 TraceCheckUtils]: 11: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,342 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,343 INFO L272 TraceCheckUtils]: 14: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,344 INFO L290 TraceCheckUtils]: 16: Hoare triple {1393#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,344 INFO L272 TraceCheckUtils]: 17: Hoare triple {1393#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,344 INFO L290 TraceCheckUtils]: 18: Hoare triple {1356#true} ~x := #in~x; {1393#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,344 INFO L290 TraceCheckUtils]: 19: Hoare triple {1393#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {1479#(= |id_#in~x| 0)} assume true; {1479#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,345 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1479#(= |id_#in~x| 0)} {1393#(= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,346 INFO L290 TraceCheckUtils]: 22: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,346 INFO L290 TraceCheckUtils]: 23: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,347 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1393#(= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,347 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,347 INFO L290 TraceCheckUtils]: 26: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,348 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1393#(= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,348 INFO L290 TraceCheckUtils]: 28: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,349 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1393#(= |id_#in~x| id_~x)} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {1445#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {1445#(<= |id_#in~x| 4)} assume true; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,351 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1445#(<= |id_#in~x| 4)} {1393#(= |id_#in~x| id_~x)} #27#return; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {1422#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {1422#(<= |id_#in~x| 5)} assume true; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,352 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1422#(<= |id_#in~x| 5)} {1358#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1357#false} is VALID [2022-02-20 18:16:34,352 INFO L290 TraceCheckUtils]: 37: Hoare triple {1357#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1357#false} is VALID [2022-02-20 18:16:34,352 INFO L290 TraceCheckUtils]: 38: Hoare triple {1357#false} assume 15 != main_~result~0#1; {1357#false} is VALID [2022-02-20 18:16:34,352 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 18:16:34,352 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 18:16:34,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:34,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100660613] [2022-02-20 18:16:34,353 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100660613] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:34,353 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [245124789] [2022-02-20 18:16:34,353 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 18:16:34,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:34,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:34,354 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:34,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 18:16:34,397 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 18:16:34,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:34,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 18:16:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:34,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:34,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1356#true} is VALID [2022-02-20 18:16:34,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1486#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:34,647 INFO L272 TraceCheckUtils]: 2: Hoare triple {1486#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1356#true} is VALID [2022-02-20 18:16:34,652 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,652 INFO L272 TraceCheckUtils]: 5: Hoare triple {1493#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,653 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,653 INFO L290 TraceCheckUtils]: 7: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,653 INFO L272 TraceCheckUtils]: 8: Hoare triple {1493#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,653 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,653 INFO L290 TraceCheckUtils]: 10: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,653 INFO L272 TraceCheckUtils]: 11: Hoare triple {1493#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,654 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,656 INFO L290 TraceCheckUtils]: 13: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,656 INFO L272 TraceCheckUtils]: 14: Hoare triple {1493#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,656 INFO L290 TraceCheckUtils]: 15: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,657 INFO L272 TraceCheckUtils]: 17: Hoare triple {1493#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:34,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {1356#true} ~x := #in~x; {1493#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:34,657 INFO L290 TraceCheckUtils]: 19: Hoare triple {1493#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {1542#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {1542#(<= |id_#in~x| 0)} assume true; {1542#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:34,658 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1542#(<= |id_#in~x| 0)} {1493#(<= |id_#in~x| id_~x)} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,658 INFO L290 TraceCheckUtils]: 22: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,659 INFO L290 TraceCheckUtils]: 23: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:34,659 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1493#(<= |id_#in~x| id_~x)} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,659 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,660 INFO L290 TraceCheckUtils]: 26: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:34,660 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1493#(<= |id_#in~x| id_~x)} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:34,661 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1493#(<= |id_#in~x| id_~x)} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,662 INFO L290 TraceCheckUtils]: 31: Hoare triple {1445#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,662 INFO L290 TraceCheckUtils]: 32: Hoare triple {1445#(<= |id_#in~x| 4)} assume true; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:34,663 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1445#(<= |id_#in~x| 4)} {1493#(<= |id_#in~x| id_~x)} #27#return; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,664 INFO L290 TraceCheckUtils]: 34: Hoare triple {1422#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,664 INFO L290 TraceCheckUtils]: 35: Hoare triple {1422#(<= |id_#in~x| 5)} assume true; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:34,665 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1422#(<= |id_#in~x| 5)} {1486#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1357#false} is VALID [2022-02-20 18:16:34,665 INFO L290 TraceCheckUtils]: 37: Hoare triple {1357#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1357#false} is VALID [2022-02-20 18:16:34,665 INFO L290 TraceCheckUtils]: 38: Hoare triple {1357#false} assume 15 != main_~result~0#1; {1357#false} is VALID [2022-02-20 18:16:34,665 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 18:16:34,665 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-02-20 18:16:34,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:38,069 INFO L290 TraceCheckUtils]: 39: Hoare triple {1357#false} assume !false; {1357#false} is VALID [2022-02-20 18:16:38,069 INFO L290 TraceCheckUtils]: 38: Hoare triple {1357#false} assume 15 != main_~result~0#1; {1357#false} is VALID [2022-02-20 18:16:38,069 INFO L290 TraceCheckUtils]: 37: Hoare triple {1357#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1357#false} is VALID [2022-02-20 18:16:38,070 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1422#(<= |id_#in~x| 5)} {1612#(< 5 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1357#false} is VALID [2022-02-20 18:16:38,070 INFO L290 TraceCheckUtils]: 35: Hoare triple {1422#(<= |id_#in~x| 5)} assume true; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:38,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {1422#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:38,071 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1445#(<= |id_#in~x| 4)} {1625#(or (< 5 id_~x) (<= |id_#in~x| 5))} #27#return; {1422#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:38,071 INFO L290 TraceCheckUtils]: 32: Hoare triple {1445#(<= |id_#in~x| 4)} assume true; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:38,072 INFO L290 TraceCheckUtils]: 31: Hoare triple {1445#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:38,072 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1462#(<= |id_#in~x| 3)} {1638#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {1445#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:38,072 INFO L290 TraceCheckUtils]: 29: Hoare triple {1462#(<= |id_#in~x| 3)} assume true; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:38,073 INFO L290 TraceCheckUtils]: 28: Hoare triple {1462#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:38,073 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1473#(<= |id_#in~x| 2)} {1651#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {1462#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:38,074 INFO L290 TraceCheckUtils]: 26: Hoare triple {1473#(<= |id_#in~x| 2)} assume true; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:38,074 INFO L290 TraceCheckUtils]: 25: Hoare triple {1473#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:38,074 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {1478#(<= |id_#in~x| 1)} {1664#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {1473#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:38,075 INFO L290 TraceCheckUtils]: 23: Hoare triple {1478#(<= |id_#in~x| 1)} assume true; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:38,075 INFO L290 TraceCheckUtils]: 22: Hoare triple {1478#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:38,076 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1542#(<= |id_#in~x| 0)} {1677#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {1478#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:38,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {1542#(<= |id_#in~x| 0)} assume true; {1542#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:38,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {1687#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {1542#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:38,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {1356#true} ~x := #in~x; {1687#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:38,077 INFO L272 TraceCheckUtils]: 17: Hoare triple {1677#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:38,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {1677#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {1677#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:38,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {1356#true} ~x := #in~x; {1677#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:38,082 INFO L272 TraceCheckUtils]: 14: Hoare triple {1664#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:38,082 INFO L290 TraceCheckUtils]: 13: Hoare triple {1664#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {1664#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:38,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {1356#true} ~x := #in~x; {1664#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:38,092 INFO L272 TraceCheckUtils]: 11: Hoare triple {1651#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:38,093 INFO L290 TraceCheckUtils]: 10: Hoare triple {1651#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {1651#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:38,093 INFO L290 TraceCheckUtils]: 9: Hoare triple {1356#true} ~x := #in~x; {1651#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:38,093 INFO L272 TraceCheckUtils]: 8: Hoare triple {1638#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:38,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {1638#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {1638#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:38,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {1356#true} ~x := #in~x; {1638#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:38,094 INFO L272 TraceCheckUtils]: 5: Hoare triple {1625#(or (< 5 id_~x) (<= |id_#in~x| 5))} call #t~ret4 := id(~x - 1); {1356#true} is VALID [2022-02-20 18:16:38,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {1625#(or (< 5 id_~x) (<= |id_#in~x| 5))} assume !(0 == ~x); {1625#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:38,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {1356#true} ~x := #in~x; {1625#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:38,095 INFO L272 TraceCheckUtils]: 2: Hoare triple {1612#(< 5 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1356#true} is VALID [2022-02-20 18:16:38,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1356#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1612#(< 5 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:38,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {1356#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1356#true} is VALID [2022-02-20 18:16:38,095 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-02-20 18:16:38,096 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [245124789] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:38,096 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:38,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 20 [2022-02-20 18:16:38,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171420727] [2022-02-20 18:16:38,096 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:38,097 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) Word has length 40 [2022-02-20 18:16:39,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:16:39,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-20 18:16:39,280 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:39,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 18:16:39,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:16:39,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 18:16:39,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2022-02-20 18:16:39,281 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-20 18:16:39,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:39,452 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-02-20 18:16:39,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 18:16:39,452 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) Word has length 40 [2022-02-20 18:16:39,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:16:39,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-20 18:16:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-02-20 18:16:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-20 18:16:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 35 transitions. [2022-02-20 18:16:39,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 35 transitions. [2022-02-20 18:16:39,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:16:39,478 INFO L225 Difference]: With dead ends: 34 [2022-02-20 18:16:39,478 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 18:16:39,479 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=452, Unknown=0, NotChecked=0, Total=650 [2022-02-20 18:16:39,479 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:16:39,479 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:16:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 18:16:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 18:16:39,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:16:39,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:16:39,482 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:16:39,482 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:16:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:39,483 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 18:16:39,486 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 18:16:39,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:39,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:39,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) Second operand 30 states. [2022-02-20 18:16:39,488 INFO L87 Difference]: Start difference. First operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) Second operand 30 states. [2022-02-20 18:16:39,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:16:39,490 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-02-20 18:16:39,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 18:16:39,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:16:39,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:16:39,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:16:39,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:16:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 7 states have return successors, (8), 7 states have call predecessors, (8), 2 states have call successors, (8) [2022-02-20 18:16:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-02-20 18:16:39,495 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 40 [2022-02-20 18:16:39,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:16:39,495 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-02-20 18:16:39,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.176470588235294) internal successors, (37), 20 states have internal predecessors, (37), 10 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (18), 6 states have call predecessors, (18), 10 states have call successors, (18) [2022-02-20 18:16:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-02-20 18:16:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 18:16:39,497 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:16:39,498 INFO L514 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:16:39,533 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 18:16:39,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:39,715 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:16:39,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:16:39,715 INFO L85 PathProgramCache]: Analyzing trace with hash -918712436, now seen corresponding path program 6 times [2022-02-20 18:16:39,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:16:39,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655625272] [2022-02-20 18:16:39,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:16:39,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:16:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:16:39,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:39,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,894 INFO L290 TraceCheckUtils]: 2: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,895 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,896 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,896 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,897 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,898 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,899 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,900 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,900 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,901 INFO L290 TraceCheckUtils]: 8: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,901 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,902 INFO L290 TraceCheckUtils]: 10: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,902 INFO L290 TraceCheckUtils]: 11: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,903 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,903 INFO L290 TraceCheckUtils]: 13: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,903 INFO L290 TraceCheckUtils]: 14: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,904 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,904 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,905 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,905 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,906 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,906 INFO L272 TraceCheckUtils]: 8: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,908 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,909 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,910 INFO L290 TraceCheckUtils]: 17: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,911 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,911 INFO L290 TraceCheckUtils]: 19: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,914 INFO L290 TraceCheckUtils]: 20: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,915 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2015#(<= |id_#in~x| 3)} {1911#(= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,915 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,916 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,916 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,917 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,917 INFO L272 TraceCheckUtils]: 8: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,918 INFO L272 TraceCheckUtils]: 11: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,922 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,922 INFO L290 TraceCheckUtils]: 20: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,923 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,923 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,924 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2015#(<= |id_#in~x| 3)} {1911#(= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,925 INFO L290 TraceCheckUtils]: 26: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,925 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {1998#(<= |id_#in~x| 4)} {1911#(= |id_#in~x| id_~x)} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,926 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,927 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,928 INFO L272 TraceCheckUtils]: 8: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,928 INFO L272 TraceCheckUtils]: 11: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,929 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,929 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,929 INFO L272 TraceCheckUtils]: 14: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,931 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,933 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,934 INFO L290 TraceCheckUtils]: 23: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,934 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,935 INFO L290 TraceCheckUtils]: 26: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,935 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2015#(<= |id_#in~x| 3)} {1911#(= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,936 INFO L290 TraceCheckUtils]: 29: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,937 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {1998#(<= |id_#in~x| 4)} {1911#(= |id_#in~x| id_~x)} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,937 INFO L290 TraceCheckUtils]: 31: Hoare triple {1975#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {1975#(<= |id_#in~x| 5)} assume true; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,938 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1975#(<= |id_#in~x| 5)} {1911#(= |id_#in~x| id_~x)} #27#return; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,939 INFO L272 TraceCheckUtils]: 2: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,939 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,940 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,940 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,940 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,941 INFO L272 TraceCheckUtils]: 8: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,941 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,941 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,941 INFO L272 TraceCheckUtils]: 11: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,942 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,942 INFO L272 TraceCheckUtils]: 14: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,942 INFO L290 TraceCheckUtils]: 15: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,943 INFO L290 TraceCheckUtils]: 16: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,943 INFO L272 TraceCheckUtils]: 17: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,943 INFO L290 TraceCheckUtils]: 18: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,943 INFO L290 TraceCheckUtils]: 19: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,944 INFO L290 TraceCheckUtils]: 20: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,944 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,945 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,947 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,948 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2015#(<= |id_#in~x| 3)} {1911#(= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,949 INFO L290 TraceCheckUtils]: 32: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,949 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1998#(<= |id_#in~x| 4)} {1911#(= |id_#in~x| id_~x)} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,949 INFO L290 TraceCheckUtils]: 34: Hoare triple {1975#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,950 INFO L290 TraceCheckUtils]: 35: Hoare triple {1975#(<= |id_#in~x| 5)} assume true; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,950 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1975#(<= |id_#in~x| 5)} {1911#(= |id_#in~x| id_~x)} #27#return; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {1946#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {1946#(<= |id_#in~x| 6)} assume true; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,951 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1946#(<= |id_#in~x| 6)} {1870#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1869#false} is VALID [2022-02-20 18:16:39,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1868#true} is VALID [2022-02-20 18:16:39,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {1868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {1870#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:16:39,952 INFO L272 TraceCheckUtils]: 2: Hoare triple {1870#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {1868#true} is VALID [2022-02-20 18:16:39,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,953 INFO L272 TraceCheckUtils]: 5: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,953 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,954 INFO L272 TraceCheckUtils]: 8: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,954 INFO L290 TraceCheckUtils]: 10: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,954 INFO L272 TraceCheckUtils]: 11: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,955 INFO L272 TraceCheckUtils]: 14: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,956 INFO L290 TraceCheckUtils]: 16: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,956 INFO L272 TraceCheckUtils]: 17: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,956 INFO L290 TraceCheckUtils]: 18: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,956 INFO L290 TraceCheckUtils]: 19: Hoare triple {1911#(= |id_#in~x| id_~x)} assume !(0 == ~x); {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,956 INFO L272 TraceCheckUtils]: 20: Hoare triple {1911#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:39,957 INFO L290 TraceCheckUtils]: 21: Hoare triple {1868#true} ~x := #in~x; {1911#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:39,957 INFO L290 TraceCheckUtils]: 22: Hoare triple {1911#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,958 INFO L290 TraceCheckUtils]: 23: Hoare triple {2032#(= |id_#in~x| 0)} assume true; {2032#(= |id_#in~x| 0)} is VALID [2022-02-20 18:16:39,959 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2032#(= |id_#in~x| 0)} {1911#(= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,959 INFO L290 TraceCheckUtils]: 25: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,959 INFO L290 TraceCheckUtils]: 26: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:39,960 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2031#(<= |id_#in~x| 1)} {1911#(= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,960 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,961 INFO L290 TraceCheckUtils]: 29: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:39,961 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2026#(<= |id_#in~x| 2)} {1911#(= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:39,963 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2015#(<= |id_#in~x| 3)} {1911#(= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,963 INFO L290 TraceCheckUtils]: 34: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,963 INFO L290 TraceCheckUtils]: 35: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:39,964 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1998#(<= |id_#in~x| 4)} {1911#(= |id_#in~x| id_~x)} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,964 INFO L290 TraceCheckUtils]: 37: Hoare triple {1975#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,964 INFO L290 TraceCheckUtils]: 38: Hoare triple {1975#(<= |id_#in~x| 5)} assume true; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:39,965 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1975#(<= |id_#in~x| 5)} {1911#(= |id_#in~x| id_~x)} #27#return; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,965 INFO L290 TraceCheckUtils]: 40: Hoare triple {1946#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,966 INFO L290 TraceCheckUtils]: 41: Hoare triple {1946#(<= |id_#in~x| 6)} assume true; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:39,966 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1946#(<= |id_#in~x| 6)} {1870#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {1869#false} is VALID [2022-02-20 18:16:39,966 INFO L290 TraceCheckUtils]: 43: Hoare triple {1869#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1869#false} is VALID [2022-02-20 18:16:39,966 INFO L290 TraceCheckUtils]: 44: Hoare triple {1869#false} assume 15 != main_~result~0#1; {1869#false} is VALID [2022-02-20 18:16:39,966 INFO L290 TraceCheckUtils]: 45: Hoare triple {1869#false} assume !false; {1869#false} is VALID [2022-02-20 18:16:39,967 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-20 18:16:39,967 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:16:39,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655625272] [2022-02-20 18:16:39,967 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655625272] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:16:39,967 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248675365] [2022-02-20 18:16:39,967 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 18:16:39,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:16:39,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:16:39,980 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:16:39,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 18:16:40,036 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-02-20 18:16:40,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 18:16:40,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 18:16:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:16:40,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:16:40,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1868#true} is VALID [2022-02-20 18:16:40,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {1868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {2039#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:40,468 INFO L272 TraceCheckUtils]: 2: Hoare triple {2039#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1868#true} is VALID [2022-02-20 18:16:40,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,469 INFO L272 TraceCheckUtils]: 5: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,470 INFO L272 TraceCheckUtils]: 8: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,470 INFO L272 TraceCheckUtils]: 11: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,471 INFO L272 TraceCheckUtils]: 14: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,472 INFO L272 TraceCheckUtils]: 17: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,472 INFO L272 TraceCheckUtils]: 20: Hoare triple {2046#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:40,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {1868#true} ~x := #in~x; {2046#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:16:40,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {2046#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2104#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:40,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {2104#(<= |id_#in~x| 0)} assume true; {2104#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:40,475 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2104#(<= |id_#in~x| 0)} {2046#(<= |id_#in~x| id_~x)} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:40,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:40,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:40,476 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2031#(<= |id_#in~x| 1)} {2046#(<= |id_#in~x| id_~x)} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:40,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:40,477 INFO L290 TraceCheckUtils]: 29: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:40,477 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2026#(<= |id_#in~x| 2)} {2046#(<= |id_#in~x| id_~x)} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:40,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:40,478 INFO L290 TraceCheckUtils]: 32: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:40,479 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2015#(<= |id_#in~x| 3)} {2046#(<= |id_#in~x| id_~x)} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:40,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:40,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:40,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1998#(<= |id_#in~x| 4)} {2046#(<= |id_#in~x| id_~x)} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:40,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {1975#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:40,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {1975#(<= |id_#in~x| 5)} assume true; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:40,482 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1975#(<= |id_#in~x| 5)} {2046#(<= |id_#in~x| id_~x)} #27#return; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:40,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {1946#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:40,482 INFO L290 TraceCheckUtils]: 41: Hoare triple {1946#(<= |id_#in~x| 6)} assume true; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:40,483 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1946#(<= |id_#in~x| 6)} {2039#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1869#false} is VALID [2022-02-20 18:16:40,483 INFO L290 TraceCheckUtils]: 43: Hoare triple {1869#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1869#false} is VALID [2022-02-20 18:16:40,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {1869#false} assume 15 != main_~result~0#1; {1869#false} is VALID [2022-02-20 18:16:40,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {1869#false} assume !false; {1869#false} is VALID [2022-02-20 18:16:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2022-02-20 18:16:40,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:16:45,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {1869#false} assume !false; {1869#false} is VALID [2022-02-20 18:16:45,099 INFO L290 TraceCheckUtils]: 44: Hoare triple {1869#false} assume 15 != main_~result~0#1; {1869#false} is VALID [2022-02-20 18:16:45,099 INFO L290 TraceCheckUtils]: 43: Hoare triple {1869#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {1869#false} is VALID [2022-02-20 18:16:45,100 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {1946#(<= |id_#in~x| 6)} {2183#(< 6 |ULTIMATE.start_main_~input~0#1|)} #25#return; {1869#false} is VALID [2022-02-20 18:16:45,100 INFO L290 TraceCheckUtils]: 41: Hoare triple {1946#(<= |id_#in~x| 6)} assume true; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:45,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {1946#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:45,101 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {1975#(<= |id_#in~x| 5)} {2196#(or (< 6 id_~x) (<= |id_#in~x| 6))} #27#return; {1946#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:16:45,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {1975#(<= |id_#in~x| 5)} assume true; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:45,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {1975#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:45,102 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {1998#(<= |id_#in~x| 4)} {2209#(or (< 5 id_~x) (<= |id_#in~x| 5))} #27#return; {1975#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:16:45,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {1998#(<= |id_#in~x| 4)} assume true; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:45,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {1998#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:45,103 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2015#(<= |id_#in~x| 3)} {2222#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {1998#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:16:45,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {2015#(<= |id_#in~x| 3)} assume true; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:45,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {2015#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:45,104 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2026#(<= |id_#in~x| 2)} {2235#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {2015#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:16:45,105 INFO L290 TraceCheckUtils]: 29: Hoare triple {2026#(<= |id_#in~x| 2)} assume true; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:45,105 INFO L290 TraceCheckUtils]: 28: Hoare triple {2026#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:45,106 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2031#(<= |id_#in~x| 1)} {2248#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {2026#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:16:45,106 INFO L290 TraceCheckUtils]: 26: Hoare triple {2031#(<= |id_#in~x| 1)} assume true; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:45,106 INFO L290 TraceCheckUtils]: 25: Hoare triple {2031#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:45,107 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2104#(<= |id_#in~x| 0)} {2261#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {2031#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:16:45,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {2104#(<= |id_#in~x| 0)} assume true; {2104#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:45,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {2271#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {2104#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:16:45,108 INFO L290 TraceCheckUtils]: 21: Hoare triple {1868#true} ~x := #in~x; {2271#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:16:45,108 INFO L272 TraceCheckUtils]: 20: Hoare triple {2261#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {2261#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {2261#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:45,108 INFO L290 TraceCheckUtils]: 18: Hoare triple {1868#true} ~x := #in~x; {2261#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:16:45,108 INFO L272 TraceCheckUtils]: 17: Hoare triple {2248#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {2248#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {2248#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:45,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1868#true} ~x := #in~x; {2248#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:16:45,109 INFO L272 TraceCheckUtils]: 14: Hoare triple {2235#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,109 INFO L290 TraceCheckUtils]: 13: Hoare triple {2235#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {2235#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:45,110 INFO L290 TraceCheckUtils]: 12: Hoare triple {1868#true} ~x := #in~x; {2235#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:16:45,110 INFO L272 TraceCheckUtils]: 11: Hoare triple {2222#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,110 INFO L290 TraceCheckUtils]: 10: Hoare triple {2222#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {2222#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:45,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {1868#true} ~x := #in~x; {2222#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:16:45,110 INFO L272 TraceCheckUtils]: 8: Hoare triple {2209#(or (< 5 id_~x) (<= |id_#in~x| 5))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {2209#(or (< 5 id_~x) (<= |id_#in~x| 5))} assume !(0 == ~x); {2209#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:45,111 INFO L290 TraceCheckUtils]: 6: Hoare triple {1868#true} ~x := #in~x; {2209#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:16:45,111 INFO L272 TraceCheckUtils]: 5: Hoare triple {2196#(or (< 6 id_~x) (<= |id_#in~x| 6))} call #t~ret4 := id(~x - 1); {1868#true} is VALID [2022-02-20 18:16:45,111 INFO L290 TraceCheckUtils]: 4: Hoare triple {2196#(or (< 6 id_~x) (<= |id_#in~x| 6))} assume !(0 == ~x); {2196#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:45,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {1868#true} ~x := #in~x; {2196#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:16:45,112 INFO L272 TraceCheckUtils]: 2: Hoare triple {2183#(< 6 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {1868#true} is VALID [2022-02-20 18:16:45,112 INFO L290 TraceCheckUtils]: 1: Hoare triple {1868#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {2183#(< 6 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:16:45,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {1868#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {1868#true} is VALID [2022-02-20 18:16:45,123 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 18:16:45,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248675365] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:16:45,123 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:16:45,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 22 [2022-02-20 18:16:45,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80243674] [2022-02-20 18:16:45,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:16:45,125 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) Word has length 46 [2022-02-20 18:17:14,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:17:14,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-02-20 18:17:14,228 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:14,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 18:17:14,228 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:17:14,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 18:17:14,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2022-02-20 18:17:14,229 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-02-20 18:17:14,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:14,478 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-02-20 18:17:14,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 18:17:14,479 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) Word has length 46 [2022-02-20 18:17:14,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:17:14,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-02-20 18:17:14,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-02-20 18:17:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-02-20 18:17:14,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2022-02-20 18:17:14,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2022-02-20 18:17:14,510 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:17:14,512 INFO L225 Difference]: With dead ends: 37 [2022-02-20 18:17:14,512 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 18:17:14,513 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=249, Invalid=563, Unknown=0, NotChecked=0, Total=812 [2022-02-20 18:17:14,514 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:17:14,514 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 89 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:17:14,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 18:17:14,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-02-20 18:17:14,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:17:14,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:17:14,525 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:17:14,526 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:17:14,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:14,527 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:17:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:17:14,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:14,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:14,529 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) Second operand 33 states. [2022-02-20 18:17:14,529 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) Second operand 33 states. [2022-02-20 18:17:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:17:14,534 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-02-20 18:17:14,534 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:17:14,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:17:14,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:17:14,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:17:14,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:17:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-02-20 18:17:14,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-02-20 18:17:14,536 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 46 [2022-02-20 18:17:14,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:17:14,537 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-02-20 18:17:14,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 22 states have internal predecessors, (41), 11 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (21), 7 states have call predecessors, (21), 11 states have call successors, (21) [2022-02-20 18:17:14,537 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-02-20 18:17:14,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-02-20 18:17:14,538 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:17:14,538 INFO L514 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:17:14,558 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-02-20 18:17:14,751 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:14,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:17:14,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:17:14,752 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 7 times [2022-02-20 18:17:14,752 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:17:14,752 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469581325] [2022-02-20 18:17:14,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:17:14,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:17:14,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:14,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 18:17:14,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:15,008 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,008 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,009 INFO L290 TraceCheckUtils]: 2: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,010 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,012 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,013 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,014 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,015 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,015 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,017 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,017 INFO L290 TraceCheckUtils]: 10: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,018 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,020 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,021 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,021 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,022 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,022 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,022 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,023 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,023 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,023 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,023 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,024 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,026 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,026 INFO L290 TraceCheckUtils]: 16: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,026 INFO L290 TraceCheckUtils]: 17: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,027 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,027 INFO L290 TraceCheckUtils]: 19: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,028 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,029 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,030 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,030 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,031 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,031 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,032 INFO L272 TraceCheckUtils]: 11: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,032 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,032 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,033 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,034 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,034 INFO L290 TraceCheckUtils]: 17: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,035 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,035 INFO L290 TraceCheckUtils]: 19: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,035 INFO L290 TraceCheckUtils]: 20: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,036 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,036 INFO L290 TraceCheckUtils]: 22: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,037 INFO L290 TraceCheckUtils]: 23: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,037 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,038 INFO L290 TraceCheckUtils]: 25: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,038 INFO L290 TraceCheckUtils]: 26: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,039 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2521#(= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,039 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,039 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,040 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,040 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,040 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,041 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,043 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,043 INFO L272 TraceCheckUtils]: 14: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,044 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,046 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,047 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,048 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,050 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2521#(= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,051 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2521#(= |id_#in~x| id_~x)} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,051 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,052 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,053 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,053 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,055 INFO L272 TraceCheckUtils]: 14: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,056 INFO L272 TraceCheckUtils]: 17: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,056 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,056 INFO L290 TraceCheckUtils]: 19: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,058 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,058 INFO L290 TraceCheckUtils]: 23: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,059 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,059 INFO L290 TraceCheckUtils]: 25: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,059 INFO L290 TraceCheckUtils]: 26: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,060 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,060 INFO L290 TraceCheckUtils]: 28: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,061 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,062 INFO L290 TraceCheckUtils]: 31: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,063 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2521#(= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,064 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2521#(= |id_#in~x| id_~x)} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {2597#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {2597#(<= |id_#in~x| 6)} assume true; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,065 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2597#(<= |id_#in~x| 6)} {2521#(= |id_#in~x| id_~x)} #27#return; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,066 INFO L272 TraceCheckUtils]: 2: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,067 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,067 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,067 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,068 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,068 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,069 INFO L272 TraceCheckUtils]: 11: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,069 INFO L272 TraceCheckUtils]: 14: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,070 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,070 INFO L290 TraceCheckUtils]: 16: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,070 INFO L272 TraceCheckUtils]: 17: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,071 INFO L290 TraceCheckUtils]: 19: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,071 INFO L272 TraceCheckUtils]: 20: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,071 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,072 INFO L290 TraceCheckUtils]: 23: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,072 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,074 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,075 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,075 INFO L290 TraceCheckUtils]: 31: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,076 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,078 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2521#(= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,078 INFO L290 TraceCheckUtils]: 37: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,078 INFO L290 TraceCheckUtils]: 38: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,079 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2521#(= |id_#in~x| id_~x)} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,079 INFO L290 TraceCheckUtils]: 40: Hoare triple {2597#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,080 INFO L290 TraceCheckUtils]: 41: Hoare triple {2597#(<= |id_#in~x| 6)} assume true; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,080 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2597#(<= |id_#in~x| 6)} {2521#(= |id_#in~x| id_~x)} #27#return; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,081 INFO L290 TraceCheckUtils]: 43: Hoare triple {2562#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,081 INFO L290 TraceCheckUtils]: 44: Hoare triple {2562#(<= |id_#in~x| 7)} assume true; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,081 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2562#(<= |id_#in~x| 7)} {2474#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {2473#false} is VALID [2022-02-20 18:17:15,082 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2472#true} is VALID [2022-02-20 18:17:15,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {2472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {2474#(= |ULTIMATE.start_main_~input~0#1| 15)} is VALID [2022-02-20 18:17:15,082 INFO L272 TraceCheckUtils]: 2: Hoare triple {2474#(= |ULTIMATE.start_main_~input~0#1| 15)} call main_#t~ret5#1 := id(main_~input~0#1); {2472#true} is VALID [2022-02-20 18:17:15,082 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,083 INFO L290 TraceCheckUtils]: 4: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,083 INFO L272 TraceCheckUtils]: 5: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,083 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,084 INFO L272 TraceCheckUtils]: 8: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,084 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,084 INFO L290 TraceCheckUtils]: 10: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,084 INFO L272 TraceCheckUtils]: 11: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,085 INFO L290 TraceCheckUtils]: 13: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,085 INFO L272 TraceCheckUtils]: 14: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,086 INFO L290 TraceCheckUtils]: 16: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,086 INFO L272 TraceCheckUtils]: 17: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,087 INFO L272 TraceCheckUtils]: 20: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,087 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {2521#(= |id_#in~x| id_~x)} assume !(0 == ~x); {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,087 INFO L272 TraceCheckUtils]: 23: Hoare triple {2521#(= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {2472#true} ~x := #in~x; {2521#(= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {2521#(= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,088 INFO L290 TraceCheckUtils]: 26: Hoare triple {2683#(= |id_#in~x| 0)} assume true; {2683#(= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,089 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2683#(= |id_#in~x| 0)} {2521#(= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,091 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2521#(= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,091 INFO L290 TraceCheckUtils]: 32: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,092 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2521#(= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,093 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2521#(= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,094 INFO L290 TraceCheckUtils]: 38: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,094 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2521#(= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,095 INFO L290 TraceCheckUtils]: 40: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,095 INFO L290 TraceCheckUtils]: 41: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,096 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2521#(= |id_#in~x| id_~x)} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {2597#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,096 INFO L290 TraceCheckUtils]: 44: Hoare triple {2597#(<= |id_#in~x| 6)} assume true; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,097 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2597#(<= |id_#in~x| 6)} {2521#(= |id_#in~x| id_~x)} #27#return; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {2562#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {2562#(<= |id_#in~x| 7)} assume true; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,098 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2562#(<= |id_#in~x| 7)} {2474#(= |ULTIMATE.start_main_~input~0#1| 15)} #25#return; {2473#false} is VALID [2022-02-20 18:17:15,098 INFO L290 TraceCheckUtils]: 49: Hoare triple {2473#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {2473#false} is VALID [2022-02-20 18:17:15,098 INFO L290 TraceCheckUtils]: 50: Hoare triple {2473#false} assume 15 != main_~result~0#1; {2473#false} is VALID [2022-02-20 18:17:15,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {2473#false} assume !false; {2473#false} is VALID [2022-02-20 18:17:15,099 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-02-20 18:17:15,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:17:15,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469581325] [2022-02-20 18:17:15,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469581325] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 18:17:15,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318568016] [2022-02-20 18:17:15,100 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-02-20 18:17:15,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 18:17:15,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:17:15,101 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 18:17:15,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 18:17:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:15,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 18:17:15,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:17:15,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 18:17:15,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2472#true} is VALID [2022-02-20 18:17:15,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {2472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {2690#(<= 15 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:17:15,512 INFO L272 TraceCheckUtils]: 2: Hoare triple {2690#(<= 15 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {2472#true} is VALID [2022-02-20 18:17:15,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,513 INFO L290 TraceCheckUtils]: 4: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,513 INFO L272 TraceCheckUtils]: 5: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,514 INFO L272 TraceCheckUtils]: 8: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,514 INFO L290 TraceCheckUtils]: 10: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,514 INFO L272 TraceCheckUtils]: 11: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,515 INFO L290 TraceCheckUtils]: 13: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,515 INFO L272 TraceCheckUtils]: 14: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,516 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,516 INFO L290 TraceCheckUtils]: 16: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,517 INFO L272 TraceCheckUtils]: 17: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,517 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,517 INFO L290 TraceCheckUtils]: 19: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,517 INFO L272 TraceCheckUtils]: 20: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,518 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,518 INFO L290 TraceCheckUtils]: 22: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume !(0 == ~x); {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,518 INFO L272 TraceCheckUtils]: 23: Hoare triple {2697#(<= |id_#in~x| id_~x)} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:15,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {2472#true} ~x := #in~x; {2697#(<= |id_#in~x| id_~x)} is VALID [2022-02-20 18:17:15,519 INFO L290 TraceCheckUtils]: 25: Hoare triple {2697#(<= |id_#in~x| id_~x)} assume 0 == ~x;#res := 0; {2764#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#(<= |id_#in~x| 0)} assume true; {2764#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:17:15,520 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2764#(<= |id_#in~x| 0)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,520 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:15,521 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,522 INFO L290 TraceCheckUtils]: 32: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:15,523 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:15,524 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:15,525 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,526 INFO L290 TraceCheckUtils]: 40: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,526 INFO L290 TraceCheckUtils]: 41: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:15,527 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,527 INFO L290 TraceCheckUtils]: 43: Hoare triple {2597#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {2597#(<= |id_#in~x| 6)} assume true; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:15,529 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2597#(<= |id_#in~x| 6)} {2697#(<= |id_#in~x| id_~x)} #27#return; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {2562#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,530 INFO L290 TraceCheckUtils]: 47: Hoare triple {2562#(<= |id_#in~x| 7)} assume true; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:15,530 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2562#(<= |id_#in~x| 7)} {2690#(<= 15 |ULTIMATE.start_main_~input~0#1|)} #25#return; {2473#false} is VALID [2022-02-20 18:17:15,530 INFO L290 TraceCheckUtils]: 49: Hoare triple {2473#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {2473#false} is VALID [2022-02-20 18:17:15,531 INFO L290 TraceCheckUtils]: 50: Hoare triple {2473#false} assume 15 != main_~result~0#1; {2473#false} is VALID [2022-02-20 18:17:15,531 INFO L290 TraceCheckUtils]: 51: Hoare triple {2473#false} assume !false; {2473#false} is VALID [2022-02-20 18:17:15,531 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-02-20 18:17:15,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 18:17:21,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {2473#false} assume !false; {2473#false} is VALID [2022-02-20 18:17:21,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {2473#false} assume 15 != main_~result~0#1; {2473#false} is VALID [2022-02-20 18:17:21,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {2473#false} assume -2147483648 <= main_#t~ret5#1 && main_#t~ret5#1 <= 2147483647;main_~result~0#1 := main_#t~ret5#1;havoc main_#t~ret5#1; {2473#false} is VALID [2022-02-20 18:17:21,093 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {2562#(<= |id_#in~x| 7)} {2852#(< 7 |ULTIMATE.start_main_~input~0#1|)} #25#return; {2473#false} is VALID [2022-02-20 18:17:21,093 INFO L290 TraceCheckUtils]: 47: Hoare triple {2562#(<= |id_#in~x| 7)} assume true; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:21,095 INFO L290 TraceCheckUtils]: 46: Hoare triple {2562#(<= |id_#in~x| 7)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:21,095 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2597#(<= |id_#in~x| 6)} {2865#(or (< 7 id_~x) (<= |id_#in~x| 7))} #27#return; {2562#(<= |id_#in~x| 7)} is VALID [2022-02-20 18:17:21,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {2597#(<= |id_#in~x| 6)} assume true; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:21,096 INFO L290 TraceCheckUtils]: 43: Hoare triple {2597#(<= |id_#in~x| 6)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:21,096 INFO L284 TraceCheckUtils]: 42: Hoare quadruple {2626#(<= |id_#in~x| 5)} {2878#(or (< 6 id_~x) (<= |id_#in~x| 6))} #27#return; {2597#(<= |id_#in~x| 6)} is VALID [2022-02-20 18:17:21,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {2626#(<= |id_#in~x| 5)} assume true; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:21,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {2626#(<= |id_#in~x| 5)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:21,097 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {2649#(<= |id_#in~x| 4)} {2891#(or (< 5 id_~x) (<= |id_#in~x| 5))} #27#return; {2626#(<= |id_#in~x| 5)} is VALID [2022-02-20 18:17:21,098 INFO L290 TraceCheckUtils]: 38: Hoare triple {2649#(<= |id_#in~x| 4)} assume true; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:21,098 INFO L290 TraceCheckUtils]: 37: Hoare triple {2649#(<= |id_#in~x| 4)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:21,098 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {2666#(<= |id_#in~x| 3)} {2904#(or (<= |id_#in~x| 4) (< 4 id_~x))} #27#return; {2649#(<= |id_#in~x| 4)} is VALID [2022-02-20 18:17:21,099 INFO L290 TraceCheckUtils]: 35: Hoare triple {2666#(<= |id_#in~x| 3)} assume true; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:21,099 INFO L290 TraceCheckUtils]: 34: Hoare triple {2666#(<= |id_#in~x| 3)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:21,117 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2677#(<= |id_#in~x| 2)} {2917#(or (< 3 id_~x) (<= |id_#in~x| 3))} #27#return; {2666#(<= |id_#in~x| 3)} is VALID [2022-02-20 18:17:21,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {2677#(<= |id_#in~x| 2)} assume true; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:21,118 INFO L290 TraceCheckUtils]: 31: Hoare triple {2677#(<= |id_#in~x| 2)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:21,118 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {2682#(<= |id_#in~x| 1)} {2930#(or (<= |id_#in~x| 2) (< 2 id_~x))} #27#return; {2677#(<= |id_#in~x| 2)} is VALID [2022-02-20 18:17:21,119 INFO L290 TraceCheckUtils]: 29: Hoare triple {2682#(<= |id_#in~x| 1)} assume true; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:21,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {2682#(<= |id_#in~x| 1)} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;#res := 1 + #t~ret4;havoc #t~ret4; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:21,119 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {2764#(<= |id_#in~x| 0)} {2943#(or (< 1 id_~x) (<= |id_#in~x| 1))} #27#return; {2682#(<= |id_#in~x| 1)} is VALID [2022-02-20 18:17:21,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {2764#(<= |id_#in~x| 0)} assume true; {2764#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:17:21,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {2953#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} assume 0 == ~x;#res := 0; {2764#(<= |id_#in~x| 0)} is VALID [2022-02-20 18:17:21,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {2472#true} ~x := #in~x; {2953#(or (not (<= id_~x 0)) (<= |id_#in~x| 0))} is VALID [2022-02-20 18:17:21,120 INFO L272 TraceCheckUtils]: 23: Hoare triple {2943#(or (< 1 id_~x) (<= |id_#in~x| 1))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {2943#(or (< 1 id_~x) (<= |id_#in~x| 1))} assume !(0 == ~x); {2943#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:17:21,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {2472#true} ~x := #in~x; {2943#(or (< 1 id_~x) (<= |id_#in~x| 1))} is VALID [2022-02-20 18:17:21,121 INFO L272 TraceCheckUtils]: 20: Hoare triple {2930#(or (<= |id_#in~x| 2) (< 2 id_~x))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {2930#(or (<= |id_#in~x| 2) (< 2 id_~x))} assume !(0 == ~x); {2930#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:17:21,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {2472#true} ~x := #in~x; {2930#(or (<= |id_#in~x| 2) (< 2 id_~x))} is VALID [2022-02-20 18:17:21,122 INFO L272 TraceCheckUtils]: 17: Hoare triple {2917#(or (< 3 id_~x) (<= |id_#in~x| 3))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {2917#(or (< 3 id_~x) (<= |id_#in~x| 3))} assume !(0 == ~x); {2917#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:17:21,122 INFO L290 TraceCheckUtils]: 15: Hoare triple {2472#true} ~x := #in~x; {2917#(or (< 3 id_~x) (<= |id_#in~x| 3))} is VALID [2022-02-20 18:17:21,122 INFO L272 TraceCheckUtils]: 14: Hoare triple {2904#(or (<= |id_#in~x| 4) (< 4 id_~x))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {2904#(or (<= |id_#in~x| 4) (< 4 id_~x))} assume !(0 == ~x); {2904#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:17:21,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {2472#true} ~x := #in~x; {2904#(or (<= |id_#in~x| 4) (< 4 id_~x))} is VALID [2022-02-20 18:17:21,123 INFO L272 TraceCheckUtils]: 11: Hoare triple {2891#(or (< 5 id_~x) (<= |id_#in~x| 5))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {2891#(or (< 5 id_~x) (<= |id_#in~x| 5))} assume !(0 == ~x); {2891#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:17:21,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {2472#true} ~x := #in~x; {2891#(or (< 5 id_~x) (<= |id_#in~x| 5))} is VALID [2022-02-20 18:17:21,124 INFO L272 TraceCheckUtils]: 8: Hoare triple {2878#(or (< 6 id_~x) (<= |id_#in~x| 6))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {2878#(or (< 6 id_~x) (<= |id_#in~x| 6))} assume !(0 == ~x); {2878#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:17:21,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {2472#true} ~x := #in~x; {2878#(or (< 6 id_~x) (<= |id_#in~x| 6))} is VALID [2022-02-20 18:17:21,125 INFO L272 TraceCheckUtils]: 5: Hoare triple {2865#(or (< 7 id_~x) (<= |id_#in~x| 7))} call #t~ret4 := id(~x - 1); {2472#true} is VALID [2022-02-20 18:17:21,125 INFO L290 TraceCheckUtils]: 4: Hoare triple {2865#(or (< 7 id_~x) (<= |id_#in~x| 7))} assume !(0 == ~x); {2865#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:17:21,125 INFO L290 TraceCheckUtils]: 3: Hoare triple {2472#true} ~x := #in~x; {2865#(or (< 7 id_~x) (<= |id_#in~x| 7))} is VALID [2022-02-20 18:17:21,126 INFO L272 TraceCheckUtils]: 2: Hoare triple {2852#(< 7 |ULTIMATE.start_main_~input~0#1|)} call main_#t~ret5#1 := id(main_~input~0#1); {2472#true} is VALID [2022-02-20 18:17:21,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {2472#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret5#1, main_~input~0#1, main_~result~0#1;main_~input~0#1 := 15; {2852#(< 7 |ULTIMATE.start_main_~input~0#1|)} is VALID [2022-02-20 18:17:21,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {2472#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {2472#true} is VALID [2022-02-20 18:17:21,126 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-02-20 18:17:21,127 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1318568016] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 18:17:21,127 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 18:17:21,127 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 24 [2022-02-20 18:17:21,127 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008424186] [2022-02-20 18:17:21,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 18:17:21,128 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 2.142857142857143) internal successors, (45), 24 states have internal predecessors, (45), 12 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (24), 8 states have call predecessors, (24), 12 states have call successors, (24) Word has length 52