./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/ludcmp.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/loops/ludcmp.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 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:31,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:31,121 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:31,156 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:31,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:31,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:31,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:31,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:31,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:31,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:31,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:31,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:31,173 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:31,174 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:31,174 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:31,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:31,175 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:31,176 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:31,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:31,182 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:31,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:31,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:31,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:31,186 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:31,191 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:31,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:31,192 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:31,193 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:31,193 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:31,194 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:31,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:31,195 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:31,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:31,197 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:31,198 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:31,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:31,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:31,199 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:31,199 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:31,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:31,200 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:31,201 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:59:31,224 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:31,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:31,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:31,225 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:31,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:31,226 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:31,226 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:31,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:31,227 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:31,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:31,228 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:31,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:31,229 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:31,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:31,229 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:31,229 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:31,229 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:31,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:31,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:31,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:31,230 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:31,230 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:31,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:31,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:59:31,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:59:31,232 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:31,232 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:31,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:31,232 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 -> 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 [2022-02-20 16:59:31,434 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:31,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:31,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:31,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:31,466 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:31,467 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/ludcmp.c [2022-02-20 16:59:31,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4970f1157/e55a7513ddc6467d805b325f39f57fe3/FLAGe8062e234 [2022-02-20 16:59:31,865 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:31,866 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c [2022-02-20 16:59:31,873 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4970f1157/e55a7513ddc6467d805b325f39f57fe3/FLAGe8062e234 [2022-02-20 16:59:31,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4970f1157/e55a7513ddc6467d805b325f39f57fe3 [2022-02-20 16:59:31,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:31,885 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:31,886 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:31,886 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:31,891 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:31,892 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:31" (1/1) ... [2022-02-20 16:59:31,892 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@495d0287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:31, skipping insertion in model container [2022-02-20 16:59:31,893 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:31" (1/1) ... [2022-02-20 16:59:31,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:31,919 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:32,035 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c[318,331] [2022-02-20 16:59:32,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:32,074 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:32,083 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c[318,331] [2022-02-20 16:59:32,114 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:32,124 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:32,124 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32 WrapperNode [2022-02-20 16:59:32,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:32,125 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:32,126 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:32,126 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:32,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,137 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,175 INFO L137 Inliner]: procedures = 17, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 224 [2022-02-20 16:59:32,181 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:32,181 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:32,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:32,182 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:32,187 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,201 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,224 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,226 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,232 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:32,236 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:32,237 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:32,237 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:32,238 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (1/1) ... [2022-02-20 16:59:32,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:32,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:32,263 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 16:59:32,292 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 16:59:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:59:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:59:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:59:32,309 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:59:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:32,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:32,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:59:32,393 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:32,394 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:32,658 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:32,662 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:32,662 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 16:59:32,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:32 BoogieIcfgContainer [2022-02-20 16:59:32,664 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:32,665 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:32,665 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:32,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:32,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:31" (1/3) ... [2022-02-20 16:59:32,667 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56947a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:32, skipping insertion in model container [2022-02-20 16:59:32,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:32" (2/3) ... [2022-02-20 16:59:32,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56947a42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:32, skipping insertion in model container [2022-02-20 16:59:32,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:32" (3/3) ... [2022-02-20 16:59:32,669 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-02-20 16:59:32,672 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:32,672 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:32,699 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:32,703 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 16:59:32,704 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:32,715 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:59:32,718 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:32,718 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:32,719 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:32,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:32,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2022-02-20 16:59:32,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:32,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21419958] [2022-02-20 16:59:32,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:32,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:32,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {53#true} is VALID [2022-02-20 16:59:32,886 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {55#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:32,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {55#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {56#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:32,888 INFO L290 TraceCheckUtils]: 3: Hoare triple {56#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !(main_~j~0#1 <= main_~n~0#1); {54#false} is VALID [2022-02-20 16:59:32,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {54#false} is VALID [2022-02-20 16:59:32,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#false} assume 0 == __VERIFIER_assert_~cond#1; {54#false} is VALID [2022-02-20 16:59:32,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#false} assume !false; {54#false} is VALID [2022-02-20 16:59:32,890 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 16:59:32,891 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:32,892 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21419958] [2022-02-20 16:59:32,893 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21419958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:32,893 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:32,893 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:32,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637192134] [2022-02-20 16:59:32,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:32,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:59:32,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:32,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:32,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:32,914 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:32,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:32,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:32,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:32,957 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:33,162 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2022-02-20 16:59:33,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:59:33,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:59:33,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:33,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 16:59:33,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 16:59:33,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-02-20 16:59:33,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:33,353 INFO L225 Difference]: With dead ends: 102 [2022-02-20 16:59:33,353 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 16:59:33,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:33,360 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 67 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:33,361 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 114 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:33,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 16:59:33,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-02-20 16:59:33,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:33,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,384 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,385 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:33,386 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:59:33,386 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:59:33,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:33,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:33,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:59:33,387 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 16:59:33,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:33,388 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 16:59:33,388 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 16:59:33,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:33,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:33,389 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:33,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 16:59:33,390 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-02-20 16:59:33,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:33,391 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 16:59:33,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,391 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 16:59:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:59:33,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:33,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:33,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:59:33,392 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:33,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:33,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2022-02-20 16:59:33,393 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:33,393 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773259024] [2022-02-20 16:59:33,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:33,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {244#true} is VALID [2022-02-20 16:59:33,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {246#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:33,472 INFO L290 TraceCheckUtils]: 2: Hoare triple {246#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {247#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {248#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:33,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !(main_~j~0#1 <= main_~n~0#1); {245#false} is VALID [2022-02-20 16:59:33,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {245#false} is VALID [2022-02-20 16:59:33,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} assume 0 == __VERIFIER_assert_~cond#1; {245#false} is VALID [2022-02-20 16:59:33,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 16:59:33,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:33,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:33,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773259024] [2022-02-20 16:59:33,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773259024] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:33,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607071134] [2022-02-20 16:59:33,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:33,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:33,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:33,478 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 16:59:33,490 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 16:59:33,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:59:33,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:33,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:33,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {244#true} is VALID [2022-02-20 16:59:33,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {255#(<= 5 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#(<= 5 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,724 INFO L290 TraceCheckUtils]: 5: Hoare triple {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:33,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {259#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {272#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:33,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~n~0#1); {245#false} is VALID [2022-02-20 16:59:33,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {245#false} is VALID [2022-02-20 16:59:33,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} assume 0 == __VERIFIER_assert_~cond#1; {245#false} is VALID [2022-02-20 16:59:33,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 16:59:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:33,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:33,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {245#false} assume !false; {245#false} is VALID [2022-02-20 16:59:33,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {245#false} assume 0 == __VERIFIER_assert_~cond#1; {245#false} is VALID [2022-02-20 16:59:33,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {245#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {245#false} is VALID [2022-02-20 16:59:33,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {294#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1); {245#false} is VALID [2022-02-20 16:59:33,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {294#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {311#(<= 1 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {298#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {244#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {311#(<= 1 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:33,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {244#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {244#true} is VALID [2022-02-20 16:59:33,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:33,832 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607071134] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:33,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:33,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2022-02-20 16:59:33,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619240939] [2022-02-20 16:59:33,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:33,835 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:33,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:33,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:33,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 16:59:33,855 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:33,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 16:59:33,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:59:33,856 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:33,994 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 16:59:33,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:59:33,995 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:59:33,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:33,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:59:33,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 16:59:34,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-02-20 16:59:34,039 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:34,041 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:59:34,041 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:59:34,042 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=92, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:59:34,044 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 49 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:34,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 37 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:34,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:59:34,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:59:34,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:34,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,053 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,053 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:34,057 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:59:34,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:59:34,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:34,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:34,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:59:34,059 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:59:34,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:34,063 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:59:34,063 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:59:34,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:34,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:34,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:34,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:34,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 16:59:34,065 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2022-02-20 16:59:34,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:34,065 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 16:59:34,066 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,066 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:59:34,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:59:34,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:34,067 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:34,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 16:59:34,271 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 16:59:34,272 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:34,273 INFO L85 PathProgramCache]: Analyzing trace with hash -439332020, now seen corresponding path program 2 times [2022-02-20 16:59:34,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:34,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181311182] [2022-02-20 16:59:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:34,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:34,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:34,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {455#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {455#true} is VALID [2022-02-20 16:59:34,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {455#true} is VALID [2022-02-20 16:59:34,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {455#true} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {455#true} is VALID [2022-02-20 16:59:34,333 INFO L290 TraceCheckUtils]: 3: Hoare triple {455#true} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {455#true} is VALID [2022-02-20 16:59:34,333 INFO L290 TraceCheckUtils]: 4: Hoare triple {455#true} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {455#true} is VALID [2022-02-20 16:59:34,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {455#true} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {455#true} is VALID [2022-02-20 16:59:34,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {455#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {455#true} is VALID [2022-02-20 16:59:34,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {455#true} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {455#true} is VALID [2022-02-20 16:59:34,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {455#true} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {455#true} is VALID [2022-02-20 16:59:34,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {455#true} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {455#true} is VALID [2022-02-20 16:59:34,334 INFO L290 TraceCheckUtils]: 10: Hoare triple {455#true} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {455#true} is VALID [2022-02-20 16:59:34,334 INFO L290 TraceCheckUtils]: 11: Hoare triple {455#true} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {455#true} is VALID [2022-02-20 16:59:34,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {455#true} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {457#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 16:59:34,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {457#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 16:59:34,336 INFO L290 TraceCheckUtils]: 14: Hoare triple {457#(<= |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~j~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {458#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 16:59:34,336 INFO L290 TraceCheckUtils]: 15: Hoare triple {458#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {458#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} is VALID [2022-02-20 16:59:34,337 INFO L290 TraceCheckUtils]: 16: Hoare triple {458#(<= (+ |ULTIMATE.start_main_~i~0#1| 1) |ULTIMATE.start_main_~j~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {456#false} is VALID [2022-02-20 16:59:34,337 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#false} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {456#false} is VALID [2022-02-20 16:59:34,337 INFO L290 TraceCheckUtils]: 18: Hoare triple {456#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {456#false} is VALID [2022-02-20 16:59:34,337 INFO L290 TraceCheckUtils]: 19: Hoare triple {456#false} assume !(main_~j~0#1 <= main_~n~0#1); {456#false} is VALID [2022-02-20 16:59:34,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {456#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {456#false} is VALID [2022-02-20 16:59:34,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {456#false} assume 0 == __VERIFIER_assert_~cond#1; {456#false} is VALID [2022-02-20 16:59:34,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {456#false} assume !false; {456#false} is VALID [2022-02-20 16:59:34,338 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 16:59:34,338 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:34,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181311182] [2022-02-20 16:59:34,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181311182] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:34,339 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:34,339 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:34,339 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198385771] [2022-02-20 16:59:34,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:34,340 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:59:34,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:34,340 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:34,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:34,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:34,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:34,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:34,353 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:34,416 INFO L93 Difference]: Finished difference Result 78 states and 92 transitions. [2022-02-20 16:59:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:59:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:59:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 16:59:34,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 43 transitions. [2022-02-20 16:59:34,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 43 transitions. [2022-02-20 16:59:34,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:34,450 INFO L225 Difference]: With dead ends: 78 [2022-02-20 16:59:34,450 INFO L226 Difference]: Without dead ends: 54 [2022-02-20 16:59:34,451 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:34,454 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:34,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:34,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-02-20 16:59:34,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 41. [2022-02-20 16:59:34,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:34,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,473 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,473 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:34,475 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-20 16:59:34,475 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 16:59:34,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:34,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:34,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 16:59:34,476 INFO L87 Difference]: Start difference. First operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 54 states. [2022-02-20 16:59:34,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:34,480 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-02-20 16:59:34,480 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-02-20 16:59:34,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:34,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:34,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:34,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.175) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-02-20 16:59:34,483 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 23 [2022-02-20 16:59:34,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:34,483 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-02-20 16:59:34,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:34,484 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-02-20 16:59:34,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:59:34,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:34,486 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:34,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:59:34,487 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:34,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:34,490 INFO L85 PathProgramCache]: Analyzing trace with hash 756876242, now seen corresponding path program 1 times [2022-02-20 16:59:34,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:34,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947570910] [2022-02-20 16:59:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:34,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:34,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:34,595 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {719#true} is VALID [2022-02-20 16:59:34,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {721#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} is VALID [2022-02-20 16:59:34,597 INFO L290 TraceCheckUtils]: 2: Hoare triple {721#(= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,597 INFO L290 TraceCheckUtils]: 3: Hoare triple {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,598 INFO L290 TraceCheckUtils]: 4: Hoare triple {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,598 INFO L290 TraceCheckUtils]: 5: Hoare triple {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {722#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !(main_~i~0#1 == main_~j~0#1); {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,600 INFO L290 TraceCheckUtils]: 9: Hoare triple {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {723#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,601 INFO L290 TraceCheckUtils]: 11: Hoare triple {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~i~0#1 == main_~j~0#1); {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {724#(and (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0) (<= |ULTIMATE.start_main_~j~0#1| 2))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !(main_~i~0#1 == main_~j~0#1); {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {725#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {726#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} is VALID [2022-02-20 16:59:34,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {726#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (= (+ |ULTIMATE.start_main_~n~0#1| (- 5)) 0))} assume !(main_~j~0#1 <= main_~n~0#1); {720#false} is VALID [2022-02-20 16:59:34,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {720#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {720#false} is VALID [2022-02-20 16:59:34,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {720#false} assume 0 == __VERIFIER_assert_~cond#1; {720#false} is VALID [2022-02-20 16:59:34,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:59:34,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:34,626 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:59:34,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947570910] [2022-02-20 16:59:34,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947570910] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:59:34,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959108472] [2022-02-20 16:59:34,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:34,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:59:34,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:34,628 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 16:59:34,654 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 16:59:34,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:34,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:59:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:34,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:34,919 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {719#true} is VALID [2022-02-20 16:59:34,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {733#(<= 5 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:34,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#(<= 5 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,923 INFO L290 TraceCheckUtils]: 3: Hoare triple {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,924 INFO L290 TraceCheckUtils]: 5: Hoare triple {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} is VALID [2022-02-20 16:59:34,925 INFO L290 TraceCheckUtils]: 6: Hoare triple {737#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 0))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,925 INFO L290 TraceCheckUtils]: 7: Hoare triple {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,926 INFO L290 TraceCheckUtils]: 8: Hoare triple {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {750#(and (<= |ULTIMATE.start_main_~j~0#1| 1) (<= 5 |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,932 INFO L290 TraceCheckUtils]: 12: Hoare triple {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} assume !(main_~i~0#1 == main_~j~0#1); {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} is VALID [2022-02-20 16:59:34,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {763#(and (<= 5 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_main_~j~0#1| 2))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~i~0#1 == main_~j~0#1); {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {776#(and (<= |ULTIMATE.start_main_~j~0#1| 3) (<= 5 |ULTIMATE.start_main_~n~0#1|))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {789#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 5 |ULTIMATE.start_main_~n~0#1|))} is VALID [2022-02-20 16:59:34,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {789#(and (<= |ULTIMATE.start_main_~j~0#1| 4) (<= 5 |ULTIMATE.start_main_~n~0#1|))} assume !(main_~j~0#1 <= main_~n~0#1); {720#false} is VALID [2022-02-20 16:59:34,937 INFO L290 TraceCheckUtils]: 20: Hoare triple {720#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {720#false} is VALID [2022-02-20 16:59:34,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {720#false} assume 0 == __VERIFIER_assert_~cond#1; {720#false} is VALID [2022-02-20 16:59:34,938 INFO L290 TraceCheckUtils]: 22: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:59:34,938 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:34,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:59:35,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:59:35,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {720#false} assume 0 == __VERIFIER_assert_~cond#1; {720#false} is VALID [2022-02-20 16:59:35,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {720#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2 == main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {720#false} is VALID [2022-02-20 16:59:35,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {811#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !(main_~j~0#1 <= main_~n~0#1); {720#false} is VALID [2022-02-20 16:59:35,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {811#(<= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {815#(<= (+ |ULTIMATE.start_main_~j~0#1| 1) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,091 INFO L290 TraceCheckUtils]: 11: Hoare triple {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {828#(<= (+ 2 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !(main_~i~0#1 == main_~j~0#1); {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {841#(<= (+ 3 |ULTIMATE.start_main_~j~0#1|) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);main_~w~0#1 := ~someBinaryArithmeticDOUBLEoperation(main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~real(~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(main_#t~mem6#1, 10.0), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8);havoc main_#t~mem6#1; {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~j~0#1 <= main_~n~0#1);call write~real(~convertINTToDOUBLE(1 + main_~i~0#1 + (1 + main_~j~0#1)), ~#a~0.base, ~#a~0.offset + 400 * main_~i~0#1 + 8 * main_~j~0#1, 8); {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {867#(<= 4 |ULTIMATE.start_main_~n~0#1|)} assume !!(main_~i~0#1 <= main_~n~0#1);main_~w~0#1 := 0.0;main_~j~0#1 := 0; {854#(<= (+ |ULTIMATE.start_main_~j~0#1| 4) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50;main_~n~0#1 := 5;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := 1.0E-6;main_~i~0#1 := 0; {867#(<= 4 |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 16:59:35,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#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(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {719#true} is VALID [2022-02-20 16:59:35,100 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:59:35,100 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959108472] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:59:35,100 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:59:35,100 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-02-20 16:59:35,100 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851679506] [2022-02-20 16:59:35,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:59:35,101 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:59:35,101 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:35,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:35,153 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 16:59:35,153 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:59:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 16:59:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=232, Unknown=0, NotChecked=0, Total=380 [2022-02-20 16:59:35,154 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:35,324 INFO L93 Difference]: Finished difference Result 96 states and 114 transitions. [2022-02-20 16:59:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:59:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 16:59:35,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:59:35,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-02-20 16:59:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 56 transitions. [2022-02-20 16:59:35,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 56 transitions. [2022-02-20 16:59:35,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:35,359 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:59:35,359 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 16:59:35,360 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-02-20 16:59:35,362 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 78 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:59:35,363 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 50 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:59:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 16:59:35,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 16:59:35,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:59:35,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,379 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,379 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:35,381 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-20 16:59:35,381 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-20 16:59:35,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:35,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:35,382 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 16:59:35,382 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 16:59:35,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:59:35,384 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2022-02-20 16:59:35,384 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-20 16:59:35,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:59:35,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:59:35,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:59:35,386 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:59:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 56 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-02-20 16:59:35,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 23 [2022-02-20 16:59:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:59:35,388 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-02-20 16:59:35,388 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.05) internal successors, (61), 20 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-20 16:59:35,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 16:59:35,389 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:35,389 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:35,410 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 16:59:35,606 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,SelfDestructingSolverStorable3 [2022-02-20 16:59:35,606 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:35,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:35,606 INFO L85 PathProgramCache]: Analyzing trace with hash 58704032, now seen corresponding path program 2 times [2022-02-20 16:59:35,606 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:59:35,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453117269] [2022-02-20 16:59:35,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:35,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:59:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:35,665 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:59:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:59:35,706 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:59:35,706 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:59:35,707 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:59:35,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:59:35,710 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1] [2022-02-20 16:59:35,712 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:59:35,746 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:59:35,747 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L153 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:59:35,748 WARN L170 areAnnotationChecker]: L108 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-02-20 16:59:35,749 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L82 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-02-20 16:59:35,750 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-02-20 16:59:35,751 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-02-20 16:59:35,752 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-02-20 16:59:35,753 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-02-20 16:59:35,754 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-02-20 16:59:35,754 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:59:35,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:59:35 BoogieIcfgContainer [2022-02-20 16:59:35,754 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:59:35,755 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:59:35,755 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:59:35,755 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:59:35,756 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:32" (3/4) ... [2022-02-20 16:59:35,757 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:59:35,758 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:59:35,758 INFO L158 Benchmark]: Toolchain (without parser) took 3873.64ms. Allocated memory was 75.5MB in the beginning and 125.8MB in the end (delta: 50.3MB). Free memory was 40.1MB in the beginning and 58.1MB in the end (delta: -18.0MB). Peak memory consumption was 31.4MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,759 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:35,759 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.16ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 39.9MB in the beginning and 65.4MB in the end (delta: -25.5MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,759 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.58ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 62.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,759 INFO L158 Benchmark]: Boogie Preprocessor took 53.98ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,760 INFO L158 Benchmark]: RCFGBuilder took 427.58ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 63.4MB in the end (delta: -3.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,760 INFO L158 Benchmark]: TraceAbstraction took 3089.87ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 59.1MB in the end (delta: 3.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. [2022-02-20 16:59:35,760 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 58.1MB in the end (delta: 998.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:59:35,761 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 75.5MB. Free memory was 56.7MB in the beginning and 56.7MB in the end (delta: 43.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.16ms. Allocated memory was 75.5MB in the beginning and 94.4MB in the end (delta: 18.9MB). Free memory was 39.9MB in the beginning and 65.4MB in the end (delta: -25.5MB). Peak memory consumption was 3.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.58ms. Allocated memory is still 94.4MB. Free memory was 65.3MB in the beginning and 62.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.98ms. Allocated memory is still 94.4MB. Free memory was 62.3MB in the beginning and 60.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 427.58ms. Allocated memory is still 94.4MB. Free memory was 60.2MB in the beginning and 63.4MB in the end (delta: -3.2MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3089.87ms. Allocated memory was 94.4MB in the beginning and 125.8MB in the end (delta: 31.5MB). Free memory was 62.8MB in the beginning and 59.1MB in the end (delta: 3.6MB). Peak memory consumption was 35.8MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 125.8MB. Free memory was 59.1MB in the beginning and 58.1MB in the end (delta: 998.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; VAL [a={4:0}, b={5:0}, x={6:0}] [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, n=5, nmax=50, x={6:0}] [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L96] COND FALSE !(j <= n) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L102] CALL __VERIFIER_assert(i==2) [L6] COND TRUE !(cond) VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] [L7] reach_error() VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 5, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 222 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 134 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 86 mSDtfsCounter, 134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57occurred in iteration=4, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 16 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 124 ConstructedInterpolants, 0 QuantifiedInterpolants, 556 SizeOfPredicates, 4 NumberOfNonLiveVariables, 231 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 28/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:59:35,786 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/ludcmp.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.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 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:59:37,464 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:59:37,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:59:37,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:59:37,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:59:37,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:59:37,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:59:37,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:59:37,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:59:37,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:59:37,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:59:37,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:59:37,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:59:37,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:59:37,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:59:37,522 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:59:37,522 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:59:37,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:59:37,526 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:59:37,528 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:59:37,531 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:59:37,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:59:37,533 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:59:37,533 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:59:37,536 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:59:37,536 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:59:37,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:59:37,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:59:37,538 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:59:37,539 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:59:37,539 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:59:37,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:59:37,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:59:37,541 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:59:37,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:59:37,542 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:59:37,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:59:37,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:59:37,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:59:37,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:59:37,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:59:37,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:59:37,575 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:59:37,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:59:37,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:59:37,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:59:37,577 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:59:37,577 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:59:37,578 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:59:37,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:59:37,578 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:59:37,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:59:37,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:59:37,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:59:37,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:59:37,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:59:37,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:59:37,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:37,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:59:37,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:59:37,582 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:59:37,583 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 45bf8892eb23096ca55c36a274511a87f80900e96066e62793920cbba0252ec0 [2022-02-20 16:59:37,822 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:59:37,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:59:37,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:59:37,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:59:37,848 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:59:37,850 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/ludcmp.c [2022-02-20 16:59:37,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d7e754/7e2820863b854901bb33a008dc438632/FLAGb200ee6d8 [2022-02-20 16:59:38,265 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:59:38,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c [2022-02-20 16:59:38,272 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d7e754/7e2820863b854901bb33a008dc438632/FLAGb200ee6d8 [2022-02-20 16:59:38,723 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d80d7e754/7e2820863b854901bb33a008dc438632 [2022-02-20 16:59:38,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:59:38,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:59:38,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:38,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:59:38,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:59:38,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:38" (1/1) ... [2022-02-20 16:59:38,742 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68ffd700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:38, skipping insertion in model container [2022-02-20 16:59:38,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:59:38" (1/1) ... [2022-02-20 16:59:38,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:59:38,774 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:59:38,904 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c[318,331] [2022-02-20 16:59:38,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:39,008 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:59:39,017 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/ludcmp.c[318,331] [2022-02-20 16:59:39,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:59:39,070 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:59:39,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39 WrapperNode [2022-02-20 16:59:39,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:59:39,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:39,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:59:39,072 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:59:39,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,097 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,135 INFO L137 Inliner]: procedures = 18, calls = 47, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 224 [2022-02-20 16:59:39,136 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:59:39,137 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:59:39,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:59:39,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:59:39,142 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,175 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:59:39,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:59:39,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:59:39,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:59:39,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (1/1) ... [2022-02-20 16:59:39,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:59:39,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:59:39,237 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 16:59:39,256 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 16:59:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:59:39,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:59:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:59:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:59:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:59:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:59:39,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:59:39,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:59:39,359 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:59:39,360 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:59:55,345 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:59:55,350 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:59:55,351 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 16:59:55,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:55 BoogieIcfgContainer [2022-02-20 16:59:55,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:59:55,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:59:55,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:59:55,358 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:59:55,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:59:38" (1/3) ... [2022-02-20 16:59:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f345313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:55, skipping insertion in model container [2022-02-20 16:59:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:59:39" (2/3) ... [2022-02-20 16:59:55,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f345313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:59:55, skipping insertion in model container [2022-02-20 16:59:55,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:59:55" (3/3) ... [2022-02-20 16:59:55,360 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-02-20 16:59:55,364 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:59:55,364 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:59:55,392 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:59:55,397 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 16:59:55,398 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:59:55,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:59:55,411 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:59:55,412 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:59:55,412 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:59:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:59:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1809811384, now seen corresponding path program 1 times [2022-02-20 16:59:55,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:59:55,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1992460830] [2022-02-20 16:59:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:59:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:59:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:59:55,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:59:55,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:59:55,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:55,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:59:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:59:55,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:59:55,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {53#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#a~0.base, ~#a~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(20000bv32, 4bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(400bv32, 5bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(400bv32, 6bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {53#true} is VALID [2022-02-20 16:59:55,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {53#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50bv32;main_~n~0#1 := 5bv32;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6);main_~i~0#1 := 0bv32; {61#(= |ULTIMATE.start_main_~n~0#1| (_ bv5 32))} is VALID [2022-02-20 16:59:55,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {61#(= |ULTIMATE.start_main_~n~0#1| (_ bv5 32))} assume !!~bvsle32(main_~i~0#1, main_~n~0#1);main_~w~0#1 := ~Pluszero~DOUBLE();main_~j~0#1 := 0bv32; {65#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 16:59:55,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {65#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} assume !~bvsle32(main_~j~0#1, main_~n~0#1); {54#false} is VALID [2022-02-20 16:59:55,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {54#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_~i~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {54#false} is VALID [2022-02-20 16:59:55,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {54#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {54#false} is VALID [2022-02-20 16:59:55,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {54#false} assume !false; {54#false} is VALID [2022-02-20 16:59:55,687 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 16:59:55,687 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:59:55,688 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:59:55,688 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1992460830] [2022-02-20 16:59:55,688 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1992460830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:59:55,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:59:55,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:59:55,690 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237384638] [2022-02-20 16:59:55,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:59:55,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:59:55,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:59:55,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:59:55,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:59:55,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:59:55,708 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:59:55,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:59:55,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:59:55,723 INFO L87 Difference]: Start difference. First operand has 50 states, 48 states have (on average 1.6041666666666667) internal successors, (77), 49 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:29,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:29,124 INFO L93 Difference]: Finished difference Result 102 states and 159 transitions. [2022-02-20 17:00:29,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 17:00:29,124 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 17:00:29,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:29,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:29,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 17:00:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:29,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 159 transitions. [2022-02-20 17:00:29,144 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 159 transitions. [2022-02-20 17:00:35,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:35,074 INFO L225 Difference]: With dead ends: 102 [2022-02-20 17:00:35,074 INFO L226 Difference]: Without dead ends: 17 [2022-02-20 17:00:35,077 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 17:00:35,081 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 67 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:35,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 112 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-02-20 17:00:35,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-02-20 17:00:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-02-20 17:00:35,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:35,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:35,102 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:35,103 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:35,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:35,105 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:00:35,105 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:00:35,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:35,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:35,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 17:00:35,107 INFO L87 Difference]: Start difference. First operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 17 states. [2022-02-20 17:00:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:35,115 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2022-02-20 17:00:35,116 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-02-20 17:00:35,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:35,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:35,116 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:35,117 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:35,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:35,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2022-02-20 17:00:35,118 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 7 [2022-02-20 17:00:35,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:35,119 INFO L470 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2022-02-20 17:00:35,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:35,121 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2022-02-20 17:00:35,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:00:35,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:35,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:35,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:00:35,330 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:00:35,330 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1948892579, now seen corresponding path program 1 times [2022-02-20 17:00:35,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:00:35,332 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370747984] [2022-02-20 17:00:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:35,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:00:35,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:00:35,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:00:35,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:00:35,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:35,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:00:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:35,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:35,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#a~0.base, ~#a~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(20000bv32, 4bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(400bv32, 5bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(400bv32, 6bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {262#true} is VALID [2022-02-20 17:00:35,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50bv32;main_~n~0#1 := 5bv32;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6);main_~i~0#1 := 0bv32; {270#(= |ULTIMATE.start_main_~n~0#1| (_ bv5 32))} is VALID [2022-02-20 17:00:35,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {270#(= |ULTIMATE.start_main_~n~0#1| (_ bv5 32))} assume !!~bvsle32(main_~i~0#1, main_~n~0#1);main_~w~0#1 := ~Pluszero~DOUBLE();main_~j~0#1 := 0bv32; {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:35,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:35,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:35,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:35,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {274#(and (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {287#(and (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|)) (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)))} is VALID [2022-02-20 17:00:35,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {287#(and (= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~j~0#1|)) (= |ULTIMATE.start_main_~n~0#1| (_ bv5 32)))} assume !~bvsle32(main_~j~0#1, main_~n~0#1); {263#false} is VALID [2022-02-20 17:00:35,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_~i~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {263#false} is VALID [2022-02-20 17:00:35,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {263#false} is VALID [2022-02-20 17:00:35,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 17:00:35,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:35,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:36,194 INFO L290 TraceCheckUtils]: 10: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 17:00:36,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {263#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {263#false} is VALID [2022-02-20 17:00:36,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {263#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_~i~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {263#false} is VALID [2022-02-20 17:00:36,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {309#(bvsle |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} assume !~bvsle32(main_~j~0#1, main_~n~0#1); {263#false} is VALID [2022-02-20 17:00:36,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {309#(bvsle |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#(bvsle (_ bv1 32) |ULTIMATE.start_main_~n~0#1|)} assume !!~bvsle32(main_~i~0#1, main_~n~0#1);main_~w~0#1 := ~Pluszero~DOUBLE();main_~j~0#1 := 0bv32; {313#(bvsle (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32)) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50bv32;main_~n~0#1 := 5bv32;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6);main_~i~0#1 := 0bv32; {326#(bvsle (_ bv1 32) |ULTIMATE.start_main_~n~0#1|)} is VALID [2022-02-20 17:00:36,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#a~0.base, ~#a~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(20000bv32, 4bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(400bv32, 5bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(400bv32, 6bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {262#true} is VALID [2022-02-20 17:00:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:36,246 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:00:36,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370747984] [2022-02-20 17:00:36,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370747984] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:36,246 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:00:36,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 17:00:36,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893327138] [2022-02-20 17:00:36,247 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:36,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:00:36,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:36,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:36,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:36,472 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:00:36,472 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:00:36,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:00:36,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:00:36,473 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:43,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:43,580 INFO L93 Difference]: Finished difference Result 38 states and 48 transitions. [2022-02-20 17:00:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:00:43,580 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:00:43,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 17:00:43,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:43,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-02-20 17:00:43,583 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-02-20 17:00:44,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:44,089 INFO L225 Difference]: With dead ends: 38 [2022-02-20 17:00:44,090 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 17:00:44,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:00:44,094 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 72 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:44,099 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 23 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-02-20 17:00:44,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 17:00:44,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 17:00:44,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:44,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:44,105 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:44,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:44,120 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:00:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 17:00:44,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:44,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:44,120 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 17:00:44,121 INFO L87 Difference]: Start difference. First operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 17:00:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:44,122 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 17:00:44,122 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 17:00:44,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:44,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:44,123 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:44,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:44,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 17:00:44,126 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 11 [2022-02-20 17:00:44,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:44,126 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 17:00:44,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 17:00:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 17:00:44,127 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:44,127 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:44,142 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 17:00:44,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:00:44,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:44,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:44,336 INFO L85 PathProgramCache]: Analyzing trace with hash -439332020, now seen corresponding path program 2 times [2022-02-20 17:00:44,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:00:44,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [8919609] [2022-02-20 17:00:44,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:00:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:00:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:00:44,338 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:00:44,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:00:44,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:00:44,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:44,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 17:00:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:44,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:45,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#a~0.base, ~#a~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(20000bv32, 4bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(400bv32, 5bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(400bv32, 6bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {470#true} is VALID [2022-02-20 17:00:45,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50bv32;main_~n~0#1 := 5bv32;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6);main_~i~0#1 := 0bv32; {478#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} is VALID [2022-02-20 17:00:45,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {478#(= |ULTIMATE.start_main_~i~0#1| (_ bv0 32))} assume !!~bvsle32(main_~i~0#1, main_~n~0#1);main_~w~0#1 := ~Pluszero~DOUBLE();main_~j~0#1 := 0bv32; {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:45,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:45,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:45,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} is VALID [2022-02-20 17:00:45,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {482#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv0 32)))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {495#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:00:45,368 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)))} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {495#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:00:45,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {495#(and (= |ULTIMATE.start_main_~i~0#1| (_ bv0 32)) (= |ULTIMATE.start_main_~j~0#1| (_ bv1 32)))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#false} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {471#false} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {471#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {471#false} assume !~bvsle32(main_~j~0#1, main_~n~0#1); {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {471#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_~i~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {471#false} is VALID [2022-02-20 17:00:45,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {471#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {471#false} is VALID [2022-02-20 17:00:45,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-02-20 17:00:45,371 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:00:45,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:45,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {471#false} assume !false; {471#false} is VALID [2022-02-20 17:00:45,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {471#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {471#false} is VALID [2022-02-20 17:00:45,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {471#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 2bv32 == main_~i~0#1 then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {471#false} is VALID [2022-02-20 17:00:45,717 INFO L290 TraceCheckUtils]: 19: Hoare triple {471#false} assume !~bvsle32(main_~j~0#1, main_~n~0#1); {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {471#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {471#false} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#false} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#false} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {471#false} is VALID [2022-02-20 17:00:45,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#false} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {471#false} is VALID [2022-02-20 17:00:45,719 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#false} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {471#false} is VALID [2022-02-20 17:00:45,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {586#(not (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {471#false} is VALID [2022-02-20 17:00:45,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {586#(not (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {586#(not (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:00:45,720 INFO L290 TraceCheckUtils]: 6: Hoare triple {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} main_#t~post5#1 := main_~j~0#1;main_~j~0#1 := ~bvadd32(1bv32, main_#t~post5#1);havoc main_#t~post5#1; {586#(not (= |ULTIMATE.start_main_~j~0#1| |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 17:00:45,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} call main_#t~mem7#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);main_~w~0#1 := ~fp.add~DOUBLE(currentRoundingMode, main_~w~0#1, main_#t~mem7#1);havoc main_#t~mem7#1; {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:00:45,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} assume main_~i~0#1 == main_~j~0#1;call main_#t~mem6#1 := read~intFLOATTYPE8(~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);call write~intFLOATTYPE8(~fp.mul~DOUBLE(currentRoundingMode, main_#t~mem6#1, ~to_fp~DOUBLE(currentRoundingMode, 10.0)), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32);havoc main_#t~mem6#1; {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:00:46,109 INFO L290 TraceCheckUtils]: 3: Hoare triple {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} assume !!~bvsle32(main_~j~0#1, main_~n~0#1);call write~intFLOATTYPE8(~convertINTToDOUBLE(currentRoundingMode, ~bvadd32(~bvadd32(1bv32, main_~i~0#1), ~bvadd32(1bv32, main_~j~0#1))), ~#a~0.base, ~bvadd32(~bvadd32(~#a~0.offset, ~bvmul32(400bv32, main_~i~0#1)), ~bvmul32(8bv32, main_~j~0#1)), 8bv32); {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:00:46,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {606#(not (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} assume !!~bvsle32(main_~i~0#1, main_~n~0#1);main_~w~0#1 := ~Pluszero~DOUBLE();main_~j~0#1 := 0bv32; {593#(not (= |ULTIMATE.start_main_~i~0#1| (bvadd |ULTIMATE.start_main_~j~0#1| (_ bv1 32))))} is VALID [2022-02-20 17:00:46,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {470#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem6#1, main_#t~mem7#1, main_#t~post5#1, main_#t~post4#1, main_#t~ret8#1, main_~i~0#1, main_~j~0#1, main_~nmax~0#1, main_~n~0#1, main_~chkerr~0#1, main_~eps~0#1, main_~w~0#1;havoc main_~i~0#1;havoc main_~j~0#1;main_~nmax~0#1 := 50bv32;main_~n~0#1 := 5bv32;havoc main_~chkerr~0#1;havoc main_~eps~0#1;havoc main_~w~0#1;main_~eps~0#1 := ~to_fp~DOUBLE(currentRoundingMode, 1.0E-6);main_~i~0#1 := 0bv32; {606#(not (= |ULTIMATE.start_main_~i~0#1| (_ bv1 32)))} is VALID [2022-02-20 17:00:46,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {470#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~#a~0.base, ~#a~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(20000bv32, 4bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5bv32, 0bv32;call #Ultimate.allocInit(400bv32, 5bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6bv32, 0bv32;call #Ultimate.allocInit(400bv32, 6bv32);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#x~0.base); {470#true} is VALID [2022-02-20 17:00:46,152 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-02-20 17:00:46,152 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:00:46,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [8919609] [2022-02-20 17:00:46,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [8919609] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:46,152 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:00:46,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-02-20 17:00:46,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481016004] [2022-02-20 17:00:46,153 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:46,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 17:00:46,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:46,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:00:46,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:46,724 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 17:00:46,725 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:00:46,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 17:00:46,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-02-20 17:00:46,725 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)