/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf -i ../../../trunk/examples/svcomp/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:08,008 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:08,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:08,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:08,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:08,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:08,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:08,063 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:08,065 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:08,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:08,066 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:08,067 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:08,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:08,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:08,069 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:08,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:08,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:08,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:08,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:08,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:08,091 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:08,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:08,095 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:08,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:08,100 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:08,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:08,105 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:08,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:08,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:08,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:08,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:08,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:08,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:08,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:08,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:08,111 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:08,111 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:08,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:08,112 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:08,112 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:08,113 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:08,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:08,115 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/LoopAccelerationJordanC.epf [2022-04-27 15:56:08,128 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:08,128 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:08,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:08,131 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:08,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:08,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:08,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:08,131 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:08,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:08,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:08,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:08,133 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:08,134 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:08,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:08,134 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:08,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:08,136 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:08,137 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_JORDAN 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 15:56:08,385 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:08,406 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:08,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:08,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:08,409 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:08,410 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp.c [2022-04-27 15:56:08,471 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccf3b88f/a7ca32efd7aa402ea4f53647bcd12cb5/FLAGf62d849a9 [2022-04-27 15:56:08,902 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:08,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2022-04-27 15:56:08,915 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccf3b88f/a7ca32efd7aa402ea4f53647bcd12cb5/FLAGf62d849a9 [2022-04-27 15:56:09,280 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ccf3b88f/a7ca32efd7aa402ea4f53647bcd12cb5 [2022-04-27 15:56:09,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:09,284 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:09,286 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:09,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:09,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:09,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f85dceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09, skipping insertion in model container [2022-04-27 15:56:09,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:09,322 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:09,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-27 15:56:09,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:09,553 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:09,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-27 15:56:09,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:09,637 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:09,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09 WrapperNode [2022-04-27 15:56:09,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:09,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:09,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:09,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:09,650 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,670 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,671 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,710 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,722 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:09,723 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:09,723 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:09,723 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:09,727 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (1/1) ... [2022-04-27 15:56:09,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:09,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:09,761 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-04-27 15:56:09,786 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-04-27 15:56:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:09,803 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-27 15:56:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:09,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:09,805 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-27 15:56:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-27 15:56:09,806 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:09,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:09,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:09,931 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:09,932 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:10,260 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:10,266 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:10,266 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-27 15:56:10,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:10 BoogieIcfgContainer [2022-04-27 15:56:10,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:10,269 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:10,269 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:10,270 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:10,273 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:10" (1/1) ... [2022-04-27 15:56:10,275 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:10,310 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:10 BasicIcfg [2022-04-27 15:56:10,311 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:10,312 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:10,312 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:10,315 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:10,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:09" (1/4) ... [2022-04-27 15:56:10,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e6ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:10, skipping insertion in model container [2022-04-27 15:56:10,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:09" (2/4) ... [2022-04-27 15:56:10,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e6ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:10, skipping insertion in model container [2022-04-27 15:56:10,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:10" (3/4) ... [2022-04-27 15:56:10,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30e6ee78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:10, skipping insertion in model container [2022-04-27 15:56:10,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:10" (4/4) ... [2022-04-27 15:56:10,318 INFO L111 eAbstractionObserver]: Analyzing ICFG lu.cmp.cJordan [2022-04-27 15:56:10,329 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:10,329 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:10,367 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:10,373 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=ForwardPredicates, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3ce7e918, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@c34054e [2022-04-27 15:56:10,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 15:56:10,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:10,388 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:10,388 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:10,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:10,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:10,394 INFO L85 PathProgramCache]: Analyzing trace with hash -708032411, now seen corresponding path program 1 times [2022-04-27 15:56:10,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:10,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577419018] [2022-04-27 15:56:10,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:10,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:10,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:10,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:10,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {67#true} is VALID [2022-04-27 15:56:10,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 15:56:10,689 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 15:56:10,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:10,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {67#true} is VALID [2022-04-27 15:56:10,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 15:56:10,693 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 15:56:10,693 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {67#true} is VALID [2022-04-27 15:56:10,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {67#true} is VALID [2022-04-27 15:56:10,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {67#true} is VALID [2022-04-27 15:56:10,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} [227] L96-3-->L96-4: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {68#false} is VALID [2022-04-27 15:56:10,695 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {68#false} is VALID [2022-04-27 15:56:10,696 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {68#false} is VALID [2022-04-27 15:56:10,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {68#false} is VALID [2022-04-27 15:56:10,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {68#false} is VALID [2022-04-27 15:56:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:10,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:10,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577419018] [2022-04-27 15:56:10,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577419018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:10,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:10,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:10,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523091937] [2022-04-27 15:56:10,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:10,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:10,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:10,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:10,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:10,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:10,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:10,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:10,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:10,758 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,174 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 15:56:11,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:11,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:11,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:11,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-04-27 15:56:11,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-04-27 15:56:11,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-04-27 15:56:11,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:11,364 INFO L225 Difference]: With dead ends: 89 [2022-04-27 15:56:11,365 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 15:56:11,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:11,369 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:11,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:11,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 15:56:11,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 15:56:11,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:11,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,395 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,396 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,399 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:11,399 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:11,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:11,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:11,405 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 15:56:11,406 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 15:56:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,409 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:11,409 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:11,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:11,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:11,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:11,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 15:56:11,413 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 15:56:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:11,414 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 15:56:11,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,418 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 15:56:11,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:11,423 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:11,424 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:11,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:11,424 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:11,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash -707108890, now seen corresponding path program 1 times [2022-04-27 15:56:11,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:11,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71263821] [2022-04-27 15:56:11,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:11,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:11,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:11,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:11,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:11,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {239#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {232#true} is VALID [2022-04-27 15:56:11,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {232#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#true} is VALID [2022-04-27 15:56:11,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {232#true} {232#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#true} is VALID [2022-04-27 15:56:11,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {232#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {239#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:11,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {239#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {232#true} is VALID [2022-04-27 15:56:11,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {232#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#true} is VALID [2022-04-27 15:56:11,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#true} is VALID [2022-04-27 15:56:11,577 INFO L272 TraceCheckUtils]: 4: Hoare triple {232#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#true} is VALID [2022-04-27 15:56:11,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {232#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {237#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:11,579 INFO L290 TraceCheckUtils]: 6: Hoare triple {237#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {238#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:11,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {238#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {233#false} is VALID [2022-04-27 15:56:11,580 INFO L272 TraceCheckUtils]: 8: Hoare triple {233#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {233#false} is VALID [2022-04-27 15:56:11,580 INFO L290 TraceCheckUtils]: 9: Hoare triple {233#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {233#false} is VALID [2022-04-27 15:56:11,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {233#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {233#false} is VALID [2022-04-27 15:56:11,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {233#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {233#false} is VALID [2022-04-27 15:56:11,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:11,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71263821] [2022-04-27 15:56:11,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71263821] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:11,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:11,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:11,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763899917] [2022-04-27 15:56:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:11,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:11,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:11,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:11,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:11,602 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,784 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:11,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:56:11,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 15:56:11,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:11,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 15:56:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 15:56:11,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 15:56:11,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:11,832 INFO L225 Difference]: With dead ends: 26 [2022-04-27 15:56:11,832 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 15:56:11,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:11,835 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:11,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:11,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 15:56:11,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 15:56:11,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:11,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,844 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,844 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,846 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:11,847 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 15:56:11,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:11,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:11,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 15:56:11,848 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 15:56:11,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:11,851 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:11,851 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 15:56:11,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:11,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:11,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:11,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:11,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 15:56:11,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 15:56:11,860 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 15:56:11,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:11,860 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 15:56:11,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 15:56:11,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 15:56:11,861 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:11,861 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:11,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:11,862 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:11,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -740655430, now seen corresponding path program 1 times [2022-04-27 15:56:11,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:11,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93689847] [2022-04-27 15:56:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:11,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {345#true} is VALID [2022-04-27 15:56:12,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:12,029 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {345#true} {345#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:12,031 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:12,031 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {345#true} is VALID [2022-04-27 15:56:12,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {345#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:12,032 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {345#true} {345#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:12,032 INFO L272 TraceCheckUtils]: 4: Hoare triple {345#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:12,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#(< main_~i~0 50)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {350#(< main_~i~0 50)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {350#(< main_~i~0 50)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {350#(< main_~i~0 50)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,036 INFO L290 TraceCheckUtils]: 10: Hoare triple {350#(< main_~i~0 50)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,037 INFO L290 TraceCheckUtils]: 11: Hoare triple {350#(< main_~i~0 50)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {350#(< main_~i~0 50)} is VALID [2022-04-27 15:56:12,039 INFO L272 TraceCheckUtils]: 12: Hoare triple {350#(< main_~i~0 50)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {351#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:12,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {351#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {352#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:12,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {352#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {346#false} is VALID [2022-04-27 15:56:12,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {346#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {346#false} is VALID [2022-04-27 15:56:12,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-27 15:56:12,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:12,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93689847] [2022-04-27 15:56:12,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93689847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:12,041 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:12,041 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-27 15:56:12,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700765548] [2022-04-27 15:56:12,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:12,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 15:56:12,042 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:12,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:12,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:12,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-27 15:56:12,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:12,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-27 15:56:12,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-27 15:56:12,062 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:12,376 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 15:56:12,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-27 15:56:12,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 15:56:12,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 15:56:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 38 transitions. [2022-04-27 15:56:12,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 38 transitions. [2022-04-27 15:56:12,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:12,426 INFO L225 Difference]: With dead ends: 34 [2022-04-27 15:56:12,427 INFO L226 Difference]: Without dead ends: 34 [2022-04-27 15:56:12,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-27 15:56:12,428 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:12,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-27 15:56:12,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-27 15:56:12,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:12,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:12,432 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:12,432 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:12,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:12,434 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 15:56:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 15:56:12,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:12,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:12,435 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 15:56:12,435 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-27 15:56:12,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:12,436 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-27 15:56:12,436 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-27 15:56:12,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:12,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:12,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:12,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:12,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 15:56:12,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-27 15:56:12,439 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2022-04-27 15:56:12,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:12,439 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-27 15:56:12,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:12,439 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-27 15:56:12,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-27 15:56:12,440 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:12,440 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:12,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-27 15:56:12,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:12,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:12,441 INFO L85 PathProgramCache]: Analyzing trace with hash 213602113, now seen corresponding path program 1 times [2022-04-27 15:56:12,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:12,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424935753] [2022-04-27 15:56:12,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:12,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:12,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {498#true} is VALID [2022-04-27 15:56:12,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {498#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {498#true} {498#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-27 15:56:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {498#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#true} is VALID [2022-04-27 15:56:12,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {498#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {498#true} {503#(= main_~i~0 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {498#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {511#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:12,540 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {498#true} is VALID [2022-04-27 15:56:12,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,540 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,540 INFO L272 TraceCheckUtils]: 4: Hoare triple {498#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,541 INFO L290 TraceCheckUtils]: 6: Hoare triple {503#(= main_~i~0 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,542 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(= main_~i~0 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(= main_~i~0 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(= main_~i~0 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,543 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(= main_~i~0 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,543 INFO L290 TraceCheckUtils]: 11: Hoare triple {503#(= main_~i~0 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,544 INFO L272 TraceCheckUtils]: 12: Hoare triple {503#(= main_~i~0 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {498#true} is VALID [2022-04-27 15:56:12,544 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#true} is VALID [2022-04-27 15:56:12,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,545 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {498#true} {503#(= main_~i~0 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {503#(= main_~i~0 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {503#(= main_~i~0 0)} is VALID [2022-04-27 15:56:12,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {503#(= main_~i~0 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,546 INFO L290 TraceCheckUtils]: 19: Hoare triple {508#(<= main_~i~0 1)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {508#(<= main_~i~0 1)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {508#(<= main_~i~0 1)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {508#(<= main_~i~0 1)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {508#(<= main_~i~0 1)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {508#(<= main_~i~0 1)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {508#(<= main_~i~0 1)} is VALID [2022-04-27 15:56:12,549 INFO L272 TraceCheckUtils]: 25: Hoare triple {508#(<= main_~i~0 1)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {509#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:12,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {509#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {510#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:12,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {510#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {499#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,551 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 15:56:12,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:12,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424935753] [2022-04-27 15:56:12,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424935753] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:12,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837244717] [2022-04-27 15:56:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:12,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:12,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:12,554 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-04-27 15:56:12,571 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-04-27 15:56:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 15:56:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:12,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:12,842 INFO L272 TraceCheckUtils]: 0: Hoare triple {498#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,842 INFO L290 TraceCheckUtils]: 1: Hoare triple {498#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {498#true} is VALID [2022-04-27 15:56:12,842 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,843 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {498#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:12,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {530#(<= 5 main_~n~0)} is VALID [2022-04-27 15:56:12,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {530#(<= 5 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:12,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:12,848 INFO L290 TraceCheckUtils]: 8: Hoare triple {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:12,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:12,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {534#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {547#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:12,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {547#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,854 INFO L272 TraceCheckUtils]: 12: Hoare triple {499#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {499#false} is VALID [2022-04-27 15:56:12,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {499#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#false} is VALID [2022-04-27 15:56:12,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {499#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {499#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,854 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {499#false} {499#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {499#false} is VALID [2022-04-27 15:56:12,857 INFO L290 TraceCheckUtils]: 17: Hoare triple {499#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {499#false} is VALID [2022-04-27 15:56:12,857 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {499#false} is VALID [2022-04-27 15:56:12,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {499#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {499#false} is VALID [2022-04-27 15:56:12,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {499#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {499#false} is VALID [2022-04-27 15:56:12,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {499#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {499#false} is VALID [2022-04-27 15:56:12,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {499#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {499#false} is VALID [2022-04-27 15:56:12,859 INFO L290 TraceCheckUtils]: 23: Hoare triple {499#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {499#false} is VALID [2022-04-27 15:56:12,860 INFO L290 TraceCheckUtils]: 24: Hoare triple {499#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,860 INFO L272 TraceCheckUtils]: 25: Hoare triple {499#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {499#false} is VALID [2022-04-27 15:56:12,861 INFO L290 TraceCheckUtils]: 26: Hoare triple {499#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#false} is VALID [2022-04-27 15:56:12,861 INFO L290 TraceCheckUtils]: 27: Hoare triple {499#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,861 INFO L290 TraceCheckUtils]: 28: Hoare triple {499#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:12,861 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-27 15:56:12,861 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:13,046 INFO L290 TraceCheckUtils]: 28: Hoare triple {499#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:13,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {499#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:13,047 INFO L290 TraceCheckUtils]: 26: Hoare triple {499#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {499#false} is VALID [2022-04-27 15:56:13,048 INFO L272 TraceCheckUtils]: 25: Hoare triple {499#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {499#false} is VALID [2022-04-27 15:56:13,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {499#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:13,057 INFO L290 TraceCheckUtils]: 23: Hoare triple {499#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {499#false} is VALID [2022-04-27 15:56:13,057 INFO L290 TraceCheckUtils]: 22: Hoare triple {499#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {499#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {499#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L290 TraceCheckUtils]: 19: Hoare triple {499#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L290 TraceCheckUtils]: 18: Hoare triple {499#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {499#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {499#false} is VALID [2022-04-27 15:56:13,058 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {498#true} {499#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {499#false} is VALID [2022-04-27 15:56:13,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {498#true} is VALID [2022-04-27 15:56:13,059 INFO L272 TraceCheckUtils]: 12: Hoare triple {499#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {498#true} is VALID [2022-04-27 15:56:13,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {653#(<= main_~j~0 main_~n~0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {499#false} is VALID [2022-04-27 15:56:13,060 INFO L290 TraceCheckUtils]: 10: Hoare triple {657#(<= (+ main_~j~0 1) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {653#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 15:56:13,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {657#(<= (+ main_~j~0 1) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {657#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:13,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {657#(<= (+ main_~j~0 1) main_~n~0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {657#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:13,062 INFO L290 TraceCheckUtils]: 7: Hoare triple {657#(<= (+ main_~j~0 1) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {657#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:13,062 INFO L290 TraceCheckUtils]: 6: Hoare triple {670#(<= 1 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {657#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:13,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {498#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {670#(<= 1 main_~n~0)} is VALID [2022-04-27 15:56:13,063 INFO L272 TraceCheckUtils]: 4: Hoare triple {498#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,063 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {498#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,063 INFO L290 TraceCheckUtils]: 1: Hoare triple {498#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {498#true} is VALID [2022-04-27 15:56:13,064 INFO L272 TraceCheckUtils]: 0: Hoare triple {498#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {498#true} is VALID [2022-04-27 15:56:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-27 15:56:13,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837244717] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:13,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:13,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2022-04-27 15:56:13,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476806546] [2022-04-27 15:56:13,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:13,069 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-27 15:56:13,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:13,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:13,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-27 15:56:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-27 15:56:13,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2022-04-27 15:56:13,131 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:13,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:13,919 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 15:56:13,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-27 15:56:13,919 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-27 15:56:13,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:13,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:13,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2022-04-27 15:56:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:13,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 105 transitions. [2022-04-27 15:56:13,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 105 transitions. [2022-04-27 15:56:14,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:14,027 INFO L225 Difference]: With dead ends: 83 [2022-04-27 15:56:14,027 INFO L226 Difference]: Without dead ends: 83 [2022-04-27 15:56:14,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=223, Invalid=647, Unknown=0, NotChecked=0, Total=870 [2022-04-27 15:56:14,028 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 158 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:14,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 48 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:56:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-27 15:56:14,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2022-04-27 15:56:14,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:14,035 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:14,035 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:14,036 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:14,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,039 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 15:56:14,039 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 15:56:14,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 83 states. [2022-04-27 15:56:14,040 INFO L87 Difference]: Start difference. First operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 83 states. [2022-04-27 15:56:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,043 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-04-27 15:56:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 98 transitions. [2022-04-27 15:56:14,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:14,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:14,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 71 states have (on average 1.2253521126760563) internal successors, (87), 72 states have internal predecessors, (87), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-27 15:56:14,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 96 transitions. [2022-04-27 15:56:14,046 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 96 transitions. Word has length 29 [2022-04-27 15:56:14,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:14,047 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 96 transitions. [2022-04-27 15:56:14,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 11 states have internal predecessors, (50), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:14,047 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 96 transitions. [2022-04-27 15:56:14,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-27 15:56:14,049 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:14,049 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:14,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 15:56:14,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:14,264 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:14,264 INFO L85 PathProgramCache]: Analyzing trace with hash 1801298995, now seen corresponding path program 1 times [2022-04-27 15:56:14,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:14,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265143707] [2022-04-27 15:56:14,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:14,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:14,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:14,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {1074#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1056#true} is VALID [2022-04-27 15:56:14,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1056#true} {1056#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-04-27 15:56:14,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,439 INFO L290 TraceCheckUtils]: 0: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:14,439 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1061#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-04-27 15:56:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:14,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1061#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,447 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1074#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 15:56:14,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {1074#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1056#true} is VALID [2022-04-27 15:56:14,447 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,448 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,448 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,448 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,449 INFO L290 TraceCheckUtils]: 6: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,450 INFO L290 TraceCheckUtils]: 7: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,450 INFO L290 TraceCheckUtils]: 8: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,452 INFO L290 TraceCheckUtils]: 11: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,452 INFO L290 TraceCheckUtils]: 12: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,452 INFO L290 TraceCheckUtils]: 13: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,453 INFO L290 TraceCheckUtils]: 14: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,453 INFO L290 TraceCheckUtils]: 15: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,454 INFO L290 TraceCheckUtils]: 17: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,457 INFO L290 TraceCheckUtils]: 22: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,457 INFO L290 TraceCheckUtils]: 23: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,457 INFO L272 TraceCheckUtils]: 24: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1056#true} is VALID [2022-04-27 15:56:14,457 INFO L290 TraceCheckUtils]: 25: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:14,457 INFO L290 TraceCheckUtils]: 26: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,458 INFO L290 TraceCheckUtils]: 27: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,458 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1056#true} {1061#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,459 INFO L290 TraceCheckUtils]: 29: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,461 INFO L290 TraceCheckUtils]: 33: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,461 INFO L290 TraceCheckUtils]: 34: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,462 INFO L290 TraceCheckUtils]: 35: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,466 INFO L290 TraceCheckUtils]: 43: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,468 INFO L290 TraceCheckUtils]: 47: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,468 INFO L290 TraceCheckUtils]: 48: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,468 INFO L272 TraceCheckUtils]: 49: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1056#true} is VALID [2022-04-27 15:56:14,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:14,469 INFO L290 TraceCheckUtils]: 51: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:14,469 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1056#true} {1061#(= (+ main_~n~0 (- 5)) 0)} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,470 INFO L290 TraceCheckUtils]: 54: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,470 INFO L290 TraceCheckUtils]: 55: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1061#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,471 INFO L290 TraceCheckUtils]: 56: Hoare triple {1061#(= (+ main_~n~0 (- 5)) 0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,472 INFO L290 TraceCheckUtils]: 57: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,472 INFO L290 TraceCheckUtils]: 58: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,472 INFO L290 TraceCheckUtils]: 59: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,473 INFO L290 TraceCheckUtils]: 60: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,474 INFO L290 TraceCheckUtils]: 61: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,474 INFO L290 TraceCheckUtils]: 62: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,474 INFO L290 TraceCheckUtils]: 63: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,475 INFO L290 TraceCheckUtils]: 64: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,477 INFO L290 TraceCheckUtils]: 67: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,477 INFO L290 TraceCheckUtils]: 68: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,478 INFO L290 TraceCheckUtils]: 69: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,478 INFO L290 TraceCheckUtils]: 70: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,479 INFO L290 TraceCheckUtils]: 71: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,479 INFO L290 TraceCheckUtils]: 72: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {1070#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1071#(<= main_~i~0 5)} is VALID [2022-04-27 15:56:14,481 INFO L272 TraceCheckUtils]: 74: Hoare triple {1071#(<= main_~i~0 5)} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1072#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-27 15:56:14,481 INFO L290 TraceCheckUtils]: 75: Hoare triple {1072#(not (= |__VERIFIER_assert_#in~cond| 0))} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1073#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-27 15:56:14,481 INFO L290 TraceCheckUtils]: 76: Hoare triple {1073#(not (= __VERIFIER_assert_~cond 0))} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:14,482 INFO L290 TraceCheckUtils]: 77: Hoare triple {1057#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:14,482 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 150 proven. 2 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2022-04-27 15:56:14,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:14,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265143707] [2022-04-27 15:56:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265143707] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:14,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592219852] [2022-04-27 15:56:14,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:14,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:14,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:14,484 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-04-27 15:56:14,489 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-04-27 15:56:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 15:56:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:15,094 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,094 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1056#true} is VALID [2022-04-27 15:56:15,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,095 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,095 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1093#(<= 5 main_~n~0)} is VALID [2022-04-27 15:56:15,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#(<= 5 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:15,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:15,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:15,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:15,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {1097#(and (<= 5 main_~n~0) (<= main_~j~0 0))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:15,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:15,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:15,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:15,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {1110#(and (<= 5 main_~n~0) (<= main_~j~0 1))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:15,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:15,116 INFO L290 TraceCheckUtils]: 16: Hoare triple {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:15,117 INFO L290 TraceCheckUtils]: 17: Hoare triple {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:15,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {1123#(and (<= 5 main_~n~0) (<= main_~j~0 2))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,121 INFO L290 TraceCheckUtils]: 21: Hoare triple {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {1136#(and (<= 5 main_~n~0) (<= main_~j~0 3))} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1149#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-27 15:56:15,122 INFO L290 TraceCheckUtils]: 23: Hoare triple {1149#(and (<= 5 main_~n~0) (<= main_~j~0 4))} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,122 INFO L272 TraceCheckUtils]: 24: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,122 INFO L290 TraceCheckUtils]: 25: Hoare triple {1057#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1057#false} is VALID [2022-04-27 15:56:15,122 INFO L290 TraceCheckUtils]: 26: Hoare triple {1057#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,122 INFO L290 TraceCheckUtils]: 27: Hoare triple {1057#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1057#false} {1057#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L290 TraceCheckUtils]: 29: Hoare triple {1057#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L290 TraceCheckUtils]: 30: Hoare triple {1057#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L290 TraceCheckUtils]: 31: Hoare triple {1057#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 34: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 39: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 40: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,124 INFO L290 TraceCheckUtils]: 41: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 42: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 43: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 44: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 45: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 46: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 47: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L290 TraceCheckUtils]: 48: Hoare triple {1057#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,125 INFO L272 TraceCheckUtils]: 49: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 50: Hoare triple {1057#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 51: Hoare triple {1057#false} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 52: Hoare triple {1057#false} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1057#false} {1057#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 54: Hoare triple {1057#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 55: Hoare triple {1057#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 56: Hoare triple {1057#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1057#false} is VALID [2022-04-27 15:56:15,126 INFO L290 TraceCheckUtils]: 57: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 58: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 59: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 60: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 61: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 62: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 63: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 64: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,127 INFO L290 TraceCheckUtils]: 65: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 67: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 68: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 69: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 70: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 71: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 72: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,128 INFO L290 TraceCheckUtils]: 73: Hoare triple {1057#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,129 INFO L272 TraceCheckUtils]: 74: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {1057#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1057#false} is VALID [2022-04-27 15:56:15,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {1057#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {1057#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,129 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 148 proven. 28 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2022-04-27 15:56:15,130 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:15,487 INFO L290 TraceCheckUtils]: 77: Hoare triple {1057#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L290 TraceCheckUtils]: 76: Hoare triple {1057#false} [246] L6-->L7: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L290 TraceCheckUtils]: 75: Hoare triple {1057#false} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L272 TraceCheckUtils]: 74: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L290 TraceCheckUtils]: 73: Hoare triple {1057#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L290 TraceCheckUtils]: 72: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,488 INFO L290 TraceCheckUtils]: 71: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 70: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 69: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 68: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 67: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 66: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,489 INFO L290 TraceCheckUtils]: 65: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 64: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 63: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 59: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {1057#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1057#false} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {1057#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 54: Hoare triple {1057#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,491 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {1056#true} {1057#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:15,492 INFO L272 TraceCheckUtils]: 49: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1056#true} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {1057#false} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {1057#false} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {1057#false} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1057#false} is VALID [2022-04-27 15:56:15,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {1057#false} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 33: Hoare triple {1057#false} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 32: Hoare triple {1057#false} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {1057#false} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {1057#false} [245] L93-2-->L93-3: Formula: (= v_main_~i~0_11 (+ v_main_~i~0_12 1)) InVars {main_~i~0=v_main_~i~0_12} OutVars{main_#t~post4=|v_main_#t~post4_1|, main_~i~0=v_main_~i~0_11} AuxVars[] AssignedVars[main_#t~post4, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {1057#false} [238] L102-->L93-2: Formula: (let ((.cse0 (+ |v_~#b~0.offset_3| (* v_main_~i~0_7 8)))) (and (= (store |v_#memory_real_28| |v_~#b~0.base_3| (store (select |v_#memory_real_28| |v_~#b~0.base_3|) .cse0 v_main_~w~0_3)) |v_#memory_real_27|) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_~#b~0.base_3| (store (select |v_#memory_int_18| |v_~#b~0.base_3|) .cse0 (select (select |v_#memory_int_17| |v_~#b~0.base_3|) .cse0)))))) InVars {main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_18|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_28|, ~#b~0.base=|v_~#b~0.base_3|} OutVars{main_~w~0=v_main_~w~0_3, ~#b~0.offset=|v_~#b~0.offset_3|, #memory_int=|v_#memory_int_17|, main_~i~0=v_main_~i~0_7, #memory_real=|v_#memory_real_27|, ~#b~0.base=|v_~#b~0.base_3|} AuxVars[] AssignedVars[#memory_int, #memory_real] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1056#true} {1057#false} [306] __VERIFIER_assertEXIT-->L102: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1057#false} is VALID [2022-04-27 15:56:15,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {1056#true} [253] L6-2-->__VERIFIER_assertEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,495 INFO L290 TraceCheckUtils]: 26: Hoare triple {1056#true} [247] L6-->L6-2: Formula: (not (= v___VERIFIER_assert_~cond_3 0)) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,495 INFO L290 TraceCheckUtils]: 25: Hoare triple {1056#true} [239] __VERIFIER_assertENTRY-->L6: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {1056#true} is VALID [2022-04-27 15:56:15,495 INFO L272 TraceCheckUtils]: 24: Hoare triple {1057#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (< v_main_~i~0_14 50) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~i~0=v_main_~i~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~i~0] {1056#true} is VALID [2022-04-27 15:56:15,495 INFO L290 TraceCheckUtils]: 23: Hoare triple {1477#(<= main_~j~0 main_~n~0)} [228] L96-3-->L96-4: Formula: (not (<= v_main_~j~0_2 v_main_~n~0_2)) InVars {main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} OutVars{main_~j~0=v_main_~j~0_2, main_~n~0=v_main_~n~0_2} AuxVars[] AssignedVars[] {1057#false} is VALID [2022-04-27 15:56:15,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {1481#(<= (+ main_~j~0 1) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1477#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 15:56:15,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {1481#(<= (+ main_~j~0 1) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1481#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:15,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {1481#(<= (+ main_~j~0 1) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1481#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:15,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {1481#(<= (+ main_~j~0 1) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1481#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:15,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {1494#(<= (+ main_~j~0 2) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1481#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:15,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {1494#(<= (+ main_~j~0 2) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1494#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:15,499 INFO L290 TraceCheckUtils]: 16: Hoare triple {1494#(<= (+ main_~j~0 2) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1494#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:15,499 INFO L290 TraceCheckUtils]: 15: Hoare triple {1494#(<= (+ main_~j~0 2) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1494#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:15,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {1507#(<= (+ main_~j~0 3) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1494#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:15,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {1507#(<= (+ main_~j~0 3) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1507#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:15,503 INFO L290 TraceCheckUtils]: 12: Hoare triple {1507#(<= (+ main_~j~0 3) main_~n~0)} [234] L99-->L99-2: Formula: (not (= v_main_~i~0_4 v_main_~j~0_5)) InVars {main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} OutVars{main_~i~0=v_main_~i~0_4, main_~j~0=v_main_~j~0_5} AuxVars[] AssignedVars[] {1507#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:15,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {1507#(<= (+ main_~j~0 3) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1507#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:15,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {1520#(<= (+ main_~j~0 4) main_~n~0)} [248] L96-2-->L96-3: Formula: (= v_main_~j~0_7 (+ v_main_~j~0_8 1)) InVars {main_~j~0=v_main_~j~0_8} OutVars{main_#t~post5=|v_main_#t~post5_1|, main_~j~0=v_main_~j~0_7} AuxVars[] AssignedVars[main_~j~0, main_#t~post5] {1507#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:15,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {1520#(<= (+ main_~j~0 4) main_~n~0)} [240] L99-2-->L96-2: Formula: true InVars {} OutVars{main_#t~mem7=|v_main_#t~mem7_1|, main_~w~0=v_main_~w~0_2} AuxVars[] AssignedVars[main_~w~0, main_#t~mem7] {1520#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:15,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {1520#(<= (+ main_~j~0 4) main_~n~0)} [233] L99-->L99-2: Formula: (let ((.cse0 (+ |v_~#a~0.offset_13| (* 400 v_main_~i~0_3) (* v_main_~j~0_4 8)))) (and (= |v_#memory_real_24| (store |v_#memory_real_25| |v_~#a~0.base_13| (store (select |v_#memory_real_25| |v_~#a~0.base_13|) .cse0 v_~someBinaryArithmeticDOUBLEoperation_14))) (= v_main_~i~0_3 v_main_~j~0_4) (= |v_#memory_int_15| (store |v_#memory_int_16| |v_~#a~0.base_13| (store (select |v_#memory_int_16| |v_~#a~0.base_13|) .cse0 (select (select |v_#memory_int_15| |v_~#a~0.base_13|) .cse0)))))) InVars {main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_16|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, #memory_real=|v_#memory_real_25|} OutVars{main_~j~0=v_main_~j~0_4, #memory_int=|v_#memory_int_15|, main_~i~0=v_main_~i~0_3, ~#a~0.base=|v_~#a~0.base_13|, ~#a~0.offset=|v_~#a~0.offset_13|, main_#t~mem6=|v_main_#t~mem6_1|, #memory_real=|v_#memory_real_24|} AuxVars[v_~someBinaryArithmeticDOUBLEoperation_14] AssignedVars[#memory_int, main_#t~mem6, #memory_real] {1520#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:15,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {1520#(<= (+ main_~j~0 4) main_~n~0)} [229] L96-3-->L99: Formula: (let ((.cse0 (+ |v_~#a~0.offset_12| (* v_main_~j~0_3 8) (* 400 v_main_~i~0_2)))) (and (= |v_#memory_int_13| (store |v_#memory_int_14| |v_~#a~0.base_12| (store (select |v_#memory_int_14| |v_~#a~0.base_12|) .cse0 (select (select |v_#memory_int_13| |v_~#a~0.base_12|) .cse0)))) (<= v_main_~j~0_3 v_main_~n~0_3) (= (store |v_#memory_real_23| |v_~#a~0.base_12| (store (select |v_#memory_real_23| |v_~#a~0.base_12|) .cse0 v_~convertINTToDOUBLE_3)) |v_#memory_real_22|))) InVars {main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_14|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_23|, main_~n~0=v_main_~n~0_3} OutVars{main_~j~0=v_main_~j~0_3, #memory_int=|v_#memory_int_13|, main_~i~0=v_main_~i~0_2, ~#a~0.base=|v_~#a~0.base_12|, ~#a~0.offset=|v_~#a~0.offset_12|, #memory_real=|v_#memory_real_22|, main_~n~0=v_main_~n~0_3} AuxVars[v_~convertINTToDOUBLE_3] AssignedVars[#memory_int, #memory_real] {1520#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:15,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {1533#(<= 4 main_~n~0)} [225] L93-3-->L96-3: Formula: (and (= v_main_~w~0_1 0.0) (= v_main_~j~0_1 0) (<= v_main_~i~0_1 v_main_~n~0_1)) InVars {main_~i~0=v_main_~i~0_1, main_~n~0=v_main_~n~0_1} OutVars{main_~i~0=v_main_~i~0_1, main_~w~0=v_main_~w~0_1, main_~n~0=v_main_~n~0_1, main_~j~0=v_main_~j~0_1} AuxVars[] AssignedVars[main_~w~0, main_~j~0] {1520#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:15,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {1056#true} [221] mainENTRY-->L93-3: Formula: (and (= v_main_~i~0_8 0) (= v_main_~nmax~0_1 50) (= v_main_~n~0_4 5) (= v_main_~eps~0_1 (/ 1.0 1000000.0))) InVars {} OutVars{main_~chkerr~0=v_main_~chkerr~0_1, main_~w~0=v_main_~w~0_4, main_~eps~0=v_main_~eps~0_1, main_~j~0=v_main_~j~0_9, main_~i~0=v_main_~i~0_8, main_~n~0=v_main_~n~0_4, main_~nmax~0=v_main_~nmax~0_1} AuxVars[] AssignedVars[main_~chkerr~0, main_~w~0, main_~eps~0, main_~j~0, main_~i~0, main_~n~0, main_~nmax~0] {1533#(<= 4 main_~n~0)} is VALID [2022-04-27 15:56:15,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {1056#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1056#true} {1056#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {1056#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {1056#true} [219] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_21| 1))) (and (= |v_~#a~0.offset_15| 0) (= 5 |v_~#b~0.base_4|) (< 0 |v_#StackHeapBarrier_2|) (= (select |v_#valid_11| 5) 1) (= (select .cse0 1) 0) (= |v_~#a~0.base_15| 4) (= |v_#NULL.base_1| 0) (= (select |v_#valid_11| 3) 1) (= |v_~#x~0.offset_4| 0) (= (select |v_#valid_11| 6) 1) (= 9 (select |v_#length_5| 2)) (= |v_~#b~0.offset_4| 0) (= (select |v_#length_5| 3) 12) (= (select |v_#valid_11| 2) 1) (= (let ((.cse1 ((as const (Array Int Real)) 0.0))) (store (store (store |v_#memory_real_34| |v_~#a~0.base_15| .cse1) |v_~#b~0.base_4| .cse1) |v_~#x~0.base_4| .cse1)) |v_#memory_real_31|) (= 20000 (select |v_#length_5| 4)) (= 400 (select |v_#length_5| 5)) (= (select .cse0 0) 48) (= 1 (select |v_#valid_11| 1)) (= 2 (select |v_#length_5| 1)) (= |v_#NULL.offset_1| 0) (= (select |v_#valid_11| 0) 0) (= (select |v_#valid_11| 4) 1) (= 400 (select |v_#length_5| 6)) (= |v_~#x~0.base_4| 6))) InVars {#memory_int=|v_#memory_int_21|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_5|, #memory_real=|v_#memory_real_34|, #valid=|v_#valid_11|} OutVars{~#x~0.offset=|v_~#x~0.offset_4|, ~#a~0.base=|v_~#a~0.base_15|, #NULL.offset=|v_#NULL.offset_1|, #memory_real=|v_#memory_real_31|, ~#b~0.base=|v_~#b~0.base_4|, #NULL.base=|v_#NULL.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, #valid=|v_#valid_11|, ~#b~0.offset=|v_~#b~0.offset_4|, ~#x~0.base=|v_~#x~0.base_4|, #memory_int=|v_#memory_int_21|, #length=|v_#length_5|, ~#a~0.offset=|v_~#a~0.offset_15|} AuxVars[] AssignedVars[~#x~0.offset, ~#b~0.offset, ~#x~0.base, ~#a~0.base, #NULL.offset, ~#a~0.offset, #memory_real, ~#b~0.base, #NULL.base] {1056#true} is VALID [2022-04-27 15:56:15,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {1056#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {1056#true} is VALID [2022-04-27 15:56:15,508 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 152 proven. 28 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-27 15:56:15,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592219852] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:15,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:15,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 20 [2022-04-27 15:56:15,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973541648] [2022-04-27 15:56:15,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-04-27 15:56:15,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:15,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:15,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:15,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-27 15:56:15,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:15,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-27 15:56:15,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-04-27 15:56:15,575 INFO L87 Difference]: Start difference. First operand 81 states and 96 transitions. Second operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:16,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,137 INFO L93 Difference]: Finished difference Result 170 states and 201 transitions. [2022-04-27 15:56:16,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-27 15:56:16,137 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 78 [2022-04-27 15:56:16,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:16,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-27 15:56:16,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:16,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 51 transitions. [2022-04-27 15:56:16,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 51 transitions. [2022-04-27 15:56:16,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:16,198 INFO L225 Difference]: With dead ends: 170 [2022-04-27 15:56:16,198 INFO L226 Difference]: Without dead ends: 0 [2022-04-27 15:56:16,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=228, Invalid=642, Unknown=0, NotChecked=0, Total=870 [2022-04-27 15:56:16,202 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 89 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:16,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 51 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 15:56:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-27 15:56:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-27 15:56:16,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:16,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:16,204 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:16,204 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:16,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,204 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:16,204 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:16,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:16,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:16,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:56:16,205 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-27 15:56:16,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,205 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-27 15:56:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:16,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:16,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:16,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:16,205 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-27 15:56:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-27 15:56:16,205 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2022-04-27 15:56:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:16,206 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-27 15:56:16,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 4.052631578947368) internal successors, (77), 18 states have internal predecessors, (77), 4 states have call successors, (7), 4 states have call predecessors, (7), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-27 15:56:16,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-27 15:56:16,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:16,210 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:16,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-27 15:56:16,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:16,418 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-04-27 15:56:16,419 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:16,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:16 BasicIcfg [2022-04-27 15:56:16,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:16,423 INFO L158 Benchmark]: Toolchain (without parser) took 7138.64ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 130.1MB in the beginning and 104.8MB in the end (delta: 25.3MB). Peak memory consumption was 96.4MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,423 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:16,423 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 183.5MB. Free memory was 129.9MB in the beginning and 152.0MB in the end (delta: -22.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,424 INFO L158 Benchmark]: Boogie Preprocessor took 82.45ms. Allocated memory is still 183.5MB. Free memory was 152.0MB in the beginning and 149.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,424 INFO L158 Benchmark]: RCFGBuilder took 546.04ms. Allocated memory is still 183.5MB. Free memory was 149.3MB in the beginning and 129.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,424 INFO L158 Benchmark]: IcfgTransformer took 41.36ms. Allocated memory is still 183.5MB. Free memory was 129.4MB in the beginning and 126.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,424 INFO L158 Benchmark]: TraceAbstraction took 6109.69ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 126.2MB in the beginning and 104.8MB in the end (delta: 21.5MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. [2022-04-27 15:56:16,425 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 183.5MB. Free memory is still 146.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 353.25ms. Allocated memory is still 183.5MB. Free memory was 129.9MB in the beginning and 152.0MB in the end (delta: -22.1MB). Peak memory consumption was 12.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 82.45ms. Allocated memory is still 183.5MB. Free memory was 152.0MB in the beginning and 149.3MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 546.04ms. Allocated memory is still 183.5MB. Free memory was 149.3MB in the beginning and 129.4MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * IcfgTransformer took 41.36ms. Allocated memory is still 183.5MB. Free memory was 129.4MB in the beginning and 126.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6109.69ms. Allocated memory was 183.5MB in the beginning and 253.8MB in the end (delta: 70.3MB). Free memory was 126.2MB in the beginning and 104.8MB in the end (delta: 21.5MB). Peak memory consumption was 92.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 5, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 330 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 324 mSDsluCounter, 238 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 121 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 442 IncrementalHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 117 mSDtfsCounter, 442 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=4, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 1097 SizeOfPredicates, 4 NumberOfNonLiveVariables, 564 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 928/997 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-04-27 15:56:16,459 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...