/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/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 15:56:11,288 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 15:56:11,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 15:56:11,352 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 15:56:11,352 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 15:56:11,353 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 15:56:11,355 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 15:56:11,359 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 15:56:11,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 15:56:11,363 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 15:56:11,364 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 15:56:11,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 15:56:11,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 15:56:11,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 15:56:11,367 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 15:56:11,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 15:56:11,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 15:56:11,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 15:56:11,372 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 15:56:11,376 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 15:56:11,377 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 15:56:11,378 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 15:56:11,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 15:56:11,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 15:56:11,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 15:56:11,385 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 15:56:11,385 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 15:56:11,385 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 15:56:11,386 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 15:56:11,386 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 15:56:11,387 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 15:56:11,387 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 15:56:11,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 15:56:11,388 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 15:56:11,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 15:56:11,389 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 15:56:11,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 15:56:11,390 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 15:56:11,390 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 15:56:11,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 15:56:11,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 15:56:11,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 15:56:11,393 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:11,401 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 15:56:11,401 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 15:56:11,402 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 15:56:11,402 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 15:56:11,402 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 15:56:11,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 15:56:11,403 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 15:56:11,404 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:11,404 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 15:56:11,404 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 15:56:11,405 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-27 15:56:11,405 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:11,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 15:56:11,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 15:56:11,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 15:56:11,617 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 15:56:11,618 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 15:56:11,619 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-27 15:56:11,669 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375e557c/a5e36f73e7ab4cba897008d3c0369a3b/FLAG508750a1a [2022-04-27 15:56:11,984 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 15:56:11,985 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-27 15:56:11,990 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375e557c/a5e36f73e7ab4cba897008d3c0369a3b/FLAG508750a1a [2022-04-27 15:56:12,399 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7375e557c/a5e36f73e7ab4cba897008d3c0369a3b [2022-04-27 15:56:12,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 15:56:12,401 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-27 15:56:12,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:12,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 15:56:12,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 15:56:12,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:12" (1/1) ... [2022-04-27 15:56:12,406 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6235b3d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:12, skipping insertion in model container [2022-04-27 15:56:12,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 03:56:12" (1/1) ... [2022-04-27 15:56:12,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 15:56:12,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 15:56:12,572 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/ludcmp.c[318,331] [2022-04-27 15:56:12,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:12,634 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 15:56:12,643 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/ludcmp.c[318,331] [2022-04-27 15:56:12,669 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 15:56:12,685 INFO L208 MainTranslator]: Completed translation [2022-04-27 15:56:12,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:12 WrapperNode [2022-04-27 15:56:12,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 15:56:12,686 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 15:56:12,686 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 15:56:12,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 15:56:12,695 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:12" (1/1) ... [2022-04-27 15:56:12,695 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:12" (1/1) ... [2022-04-27 15:56:12,713 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:12" (1/1) ... [2022-04-27 15:56:12,713 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:12" (1/1) ... [2022-04-27 15:56:12,738 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:12" (1/1) ... [2022-04-27 15:56:12,744 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:12" (1/1) ... [2022-04-27 15:56:12,747 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:12" (1/1) ... [2022-04-27 15:56:12,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 15:56:12,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 15:56:12,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 15:56:12,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 15:56:12,755 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:12" (1/1) ... [2022-04-27 15:56:12,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 15:56:12,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:12,796 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:12,814 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:12,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 15:56:12,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 15:56:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 15:56:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 15:56:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-27 15:56:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 15:56:12,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-27 15:56:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 15:56:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 15:56:12,832 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 15:56:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 15:56:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 15:56:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-27 15:56:12,833 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-27 15:56:12,834 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 15:56:12,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 15:56:12,934 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 15:56:12,935 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 15:56:13,175 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 15:56:13,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 15:56:13,180 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-27 15:56:13,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:13 BoogieIcfgContainer [2022-04-27 15:56:13,181 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 15:56:13,182 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-27 15:56:13,182 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-27 15:56:13,185 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-27 15:56:13,187 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:13" (1/1) ... [2022-04-27 15:56:13,188 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_JORDAN [2022-04-27 15:56:13,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:13 BasicIcfg [2022-04-27 15:56:13,239 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-27 15:56:13,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 15:56:13,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 15:56:13,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 15:56:13,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 03:56:12" (1/4) ... [2022-04-27 15:56:13,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f340de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:13, skipping insertion in model container [2022-04-27 15:56:13,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 03:56:12" (2/4) ... [2022-04-27 15:56:13,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f340de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 03:56:13, skipping insertion in model container [2022-04-27 15:56:13,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 03:56:13" (3/4) ... [2022-04-27 15:56:13,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f340de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:13, skipping insertion in model container [2022-04-27 15:56:13,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 27.04 03:56:13" (4/4) ... [2022-04-27 15:56:13,249 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.cJordan [2022-04-27 15:56:13,259 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2022-04-27 15:56:13,259 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 15:56:13,294 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 15:56:13,298 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@10bf7b53, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@45b924b9 [2022-04-27 15:56:13,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 15:56:13,304 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:13,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:13,309 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:13,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:13,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:13,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -708032411, now seen corresponding path program 1 times [2022-04-27 15:56:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:13,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448620098] [2022-04-27 15:56:13,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:13,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:13,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:13,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:13,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:13,510 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:13,510 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:13,510 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:13,513 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:13,514 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:13,514 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:13,515 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:13,515 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:13,515 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:13,515 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:13,518 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:13,518 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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:13,518 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:13,518 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:13,519 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:13,519 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:13,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:13,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448620098] [2022-04-27 15:56:13,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448620098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:13,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:13,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 15:56:13,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12002366] [2022-04-27 15:56:13,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:13,529 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:13,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:13,532 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:13,550 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:13,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 15:56:13,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:13,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 15:56:13,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 15:56:13,574 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:13,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:13,887 INFO L93 Difference]: Finished difference Result 89 states and 117 transitions. [2022-04-27 15:56:13,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 15:56:13,888 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:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:13,889 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:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-04-27 15:56:13,902 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:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-04-27 15:56:13,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-04-27 15:56:14,030 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:14,037 INFO L225 Difference]: With dead ends: 89 [2022-04-27 15:56:14,037 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 15:56:14,039 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:14,044 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:14,045 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:14,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 15:56:14,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 15:56:14,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:14,065 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:14,066 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:14,067 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:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,069 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:14,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:14,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,070 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:14,070 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:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,072 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 15:56:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 15:56:14,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,072 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:14,072 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:14,073 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:14,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 15:56:14,074 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 15:56:14,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:14,074 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 15:56:14,075 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:14,075 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 15:56:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 15:56:14,075 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:14,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:14,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 15:56:14,076 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:14,077 INFO L85 PathProgramCache]: Analyzing trace with hash -707108890, now seen corresponding path program 1 times [2022-04-27 15:56:14,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:14,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296435691] [2022-04-27 15:56:14,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:14,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,195 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:14,196 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:14,196 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:14,197 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:14,197 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:14,197 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:14,198 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:14,198 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:14,198 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:14,199 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:14,200 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:14,200 INFO L272 TraceCheckUtils]: 8: Hoare triple {233#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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:14,200 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:14,201 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:14,201 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:14,201 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:14,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:14,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296435691] [2022-04-27 15:56:14,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296435691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:14,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:14,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:14,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370969528] [2022-04-27 15:56:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:14,214 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:14,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:14,215 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:14,225 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:14,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:14,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:14,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:14,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:14,227 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:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,369 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:14,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 15:56:14,369 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:14,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:14,369 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:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 15:56:14,371 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:14,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2022-04-27 15:56:14,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 31 transitions. [2022-04-27 15:56:14,408 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:14,409 INFO L225 Difference]: With dead ends: 26 [2022-04-27 15:56:14,409 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 15:56:14,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 15:56:14,410 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.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:14,410 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.0s Time] [2022-04-27 15:56:14,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 15:56:14,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 15:56:14,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:14,413 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:14,413 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:14,413 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:14,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,414 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:14,414 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 15:56:14,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,415 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:14,415 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:14,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:14,416 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 15:56:14,416 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 15:56:14,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:14,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:14,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:14,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:14,417 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:14,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 15:56:14,418 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 15:56:14,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:14,418 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 15:56:14,418 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:14,418 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 15:56:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 15:56:14,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:14,419 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:14,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 15:56:14,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:14,420 INFO L85 PathProgramCache]: Analyzing trace with hash -740655430, now seen corresponding path program 1 times [2022-04-27 15:56:14,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:14,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392624494] [2022-04-27 15:56:14,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:14,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:14,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,507 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:14,507 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:14,507 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:14,511 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:14,512 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:14,512 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:14,512 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:14,512 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:14,513 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_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:14,514 INFO L290 TraceCheckUtils]: 6: Hoare triple {350#(= (+ 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] {351#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {351#(and (= main_~j~0 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] {351#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {351#(and (= main_~j~0 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] {351#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {351#(and (= main_~j~0 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] {351#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {351#(and (= main_~j~0 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] {352#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:14,517 INFO L290 TraceCheckUtils]: 11: Hoare triple {352#(and (<= main_~j~0 1) (= (+ 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[] {346#false} is VALID [2022-04-27 15:56:14,518 INFO L272 TraceCheckUtils]: 12: Hoare triple {346#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {346#false} is VALID [2022-04-27 15:56:14,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#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] {346#false} is VALID [2022-04-27 15:56:14,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#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[] {346#false} is VALID [2022-04-27 15:56:14,518 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:14,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:14,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:14,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392624494] [2022-04-27 15:56:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392624494] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095241851] [2022-04-27 15:56:14,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:14,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:14,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:14,525 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:14,526 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:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 15:56:14,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:14,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:14,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:14,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#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] {345#true} is VALID [2022-04-27 15:56:14,775 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:14,775 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:14,776 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:14,777 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] {372#(<= 5 main_~n~0)} is VALID [2022-04-27 15:56:14,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {372#(<= 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] {376#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:14,778 INFO L290 TraceCheckUtils]: 7: Hoare triple {376#(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] {376#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:14,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {376#(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] {376#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:14,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {376#(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] {376#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:14,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {376#(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] {389#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:14,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {389#(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[] {346#false} is VALID [2022-04-27 15:56:14,782 INFO L272 TraceCheckUtils]: 12: Hoare triple {346#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {346#false} is VALID [2022-04-27 15:56:14,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#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] {346#false} is VALID [2022-04-27 15:56:14,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#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[] {346#false} is VALID [2022-04-27 15:56:14,782 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:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:14,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:14,872 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:14,872 INFO L290 TraceCheckUtils]: 14: Hoare triple {346#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[] {346#false} is VALID [2022-04-27 15:56:14,872 INFO L290 TraceCheckUtils]: 13: Hoare triple {346#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] {346#false} is VALID [2022-04-27 15:56:14,872 INFO L272 TraceCheckUtils]: 12: Hoare triple {346#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {346#false} is VALID [2022-04-27 15:56:14,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {417#(<= 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[] {346#false} is VALID [2022-04-27 15:56:14,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {421#(<= (+ 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] {417#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 15:56:14,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {421#(<= (+ 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] {421#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:14,877 INFO L290 TraceCheckUtils]: 8: Hoare triple {421#(<= (+ 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] {421#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:14,877 INFO L290 TraceCheckUtils]: 7: Hoare triple {421#(<= (+ 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] {421#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:14,878 INFO L290 TraceCheckUtils]: 6: Hoare triple {434#(<= 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] {421#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:14,878 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] {434#(<= 1 main_~n~0)} is VALID [2022-04-27 15:56:14,878 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:14,879 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:14,879 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:14,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {345#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] {345#true} is VALID [2022-04-27 15:56:14,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {345#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {345#true} is VALID [2022-04-27 15:56:14,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:14,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095241851] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:14,880 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:14,880 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-27 15:56:14,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684209241] [2022-04-27 15:56:14,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:14,881 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:14,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:14,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:14,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:14,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 15:56:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 15:56:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-27 15:56:14,903 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,094 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 15:56:15,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 15:56:15,094 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 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:15,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:15,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2022-04-27 15:56:15,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 43 transitions. [2022-04-27 15:56:15,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 43 transitions. [2022-04-27 15:56:15,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:15,133 INFO L225 Difference]: With dead ends: 35 [2022-04-27 15:56:15,134 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 15:56:15,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-04-27 15:56:15,135 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 58 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:15,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 42 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:15,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 15:56:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 15:56:15,137 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:15,138 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:15,138 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:15,138 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:15,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,139 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 15:56:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 15:56:15,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:15,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:15,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2022-04-27 15:56:15,140 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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 35 states. [2022-04-27 15:56:15,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,141 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 15:56:15,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 15:56:15,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:15,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:15,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:15,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-27 15:56:15,143 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2022-04-27 15:56:15,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:15,143 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-27 15:56:15,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:15,143 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 15:56:15,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:56:15,144 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:15,144 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:15,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 15:56:15,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:15,360 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:15,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:15,360 INFO L85 PathProgramCache]: Analyzing trace with hash 758751030, now seen corresponding path program 2 times [2022-04-27 15:56:15,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:15,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035601301] [2022-04-27 15:56:15,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:15,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:15,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {608#(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] {601#true} is VALID [2022-04-27 15:56:15,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {601#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-27 15:56:15,460 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {601#true} {601#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-27 15:56:15,461 INFO L272 TraceCheckUtils]: 0: Hoare triple {601#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {608#(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:15,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#(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] {601#true} is VALID [2022-04-27 15:56:15,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {601#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-27 15:56:15,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {601#true} {601#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-27 15:56:15,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {601#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {601#true} is VALID [2022-04-27 15:56:15,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {601#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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 6: Hoare triple {601#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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,463 INFO L290 TraceCheckUtils]: 14: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,463 INFO L290 TraceCheckUtils]: 15: Hoare triple {601#true} [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] {601#true} is VALID [2022-04-27 15:56:15,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {601#true} [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] {606#(<= main_~i~0 main_~j~0)} is VALID [2022-04-27 15:56:15,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {606#(<= main_~i~0 main_~j~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] {606#(<= main_~i~0 main_~j~0)} is VALID [2022-04-27 15:56:15,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {606#(<= main_~i~0 main_~j~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] {607#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2022-04-27 15:56:15,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {607#(<= (+ main_~i~0 1) main_~j~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] {607#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2022-04-27 15:56:15,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {607#(<= (+ main_~i~0 1) main_~j~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] {602#false} is VALID [2022-04-27 15:56:15,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {602#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] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L290 TraceCheckUtils]: 22: Hoare triple {602#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] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L290 TraceCheckUtils]: 23: Hoare triple {602#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[] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L272 TraceCheckUtils]: 24: Hoare triple {602#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {602#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] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {602#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[] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {602#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {602#false} is VALID [2022-04-27 15:56:15,466 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 15:56:15,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:15,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035601301] [2022-04-27 15:56:15,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035601301] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 15:56:15,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 15:56:15,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 15:56:15,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017242835] [2022-04-27 15:56:15,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 15:56:15,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2022-04-27 15:56:15,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:15,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:15,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:15,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 15:56:15,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:15,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 15:56:15,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:15,481 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:15,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,572 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 15:56:15,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 15:56:15,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 28 [2022-04-27 15:56:15,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 15:56:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-27 15:56:15,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-27 15:56:15,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:15,600 INFO L225 Difference]: With dead ends: 60 [2022-04-27 15:56:15,600 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 15:56:15,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 15:56:15,601 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:15,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 15:56:15,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 15:56:15,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-04-27 15:56:15,613 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:15,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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:15,614 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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:15,614 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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:15,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,617 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 15:56:15,617 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 15:56:15,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:15,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:15,620 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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 60 states. [2022-04-27 15:56:15,620 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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 60 states. [2022-04-27 15:56:15,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:15,623 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 15:56:15,624 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 15:56:15,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:15,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:15,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:15,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:15,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 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:15,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-27 15:56:15,627 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2022-04-27 15:56:15,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:15,628 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-27 15:56:15,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:15,628 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-27 15:56:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 15:56:15,630 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:15,630 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:15,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 15:56:15,630 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:15,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2120109907, now seen corresponding path program 1 times [2022-04-27 15:56:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174005411] [2022-04-27 15:56:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:15,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 15:56:15,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,744 INFO L290 TraceCheckUtils]: 0: Hoare triple {850#(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] {839#true} is VALID [2022-04-27 15:56:15,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:15,745 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {839#true} {839#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:15,746 INFO L272 TraceCheckUtils]: 0: Hoare triple {839#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {850#(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:15,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {850#(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] {839#true} is VALID [2022-04-27 15:56:15,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:15,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {839#true} {839#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:15,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {839#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:15,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {839#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] {844#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 15:56:15,749 INFO L290 TraceCheckUtils]: 6: Hoare triple {844#(= (+ 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] {845#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {845#(and (= main_~j~0 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] {845#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {845#(and (= main_~j~0 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] {845#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {845#(and (= main_~j~0 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] {845#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,763 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#(and (= main_~j~0 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] {846#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,764 INFO L290 TraceCheckUtils]: 11: Hoare triple {846#(and (<= main_~j~0 1) (= (+ 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] {846#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,764 INFO L290 TraceCheckUtils]: 12: Hoare triple {846#(and (<= main_~j~0 1) (= (+ 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[] {846#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {846#(and (<= main_~j~0 1) (= (+ 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] {846#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,765 INFO L290 TraceCheckUtils]: 14: Hoare triple {846#(and (<= main_~j~0 1) (= (+ 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] {847#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {847#(and (<= main_~j~0 2) (= (+ 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] {847#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {847#(and (<= main_~j~0 2) (= (+ 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[] {847#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,766 INFO L290 TraceCheckUtils]: 17: Hoare triple {847#(and (<= main_~j~0 2) (= (+ 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] {847#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {847#(and (<= main_~j~0 2) (= (+ 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] {848#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,767 INFO L290 TraceCheckUtils]: 19: Hoare triple {848#(and (= (+ main_~n~0 (- 5)) 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] {848#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,768 INFO L290 TraceCheckUtils]: 20: Hoare triple {848#(and (= (+ main_~n~0 (- 5)) 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[] {848#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,768 INFO L290 TraceCheckUtils]: 21: Hoare triple {848#(and (= (+ main_~n~0 (- 5)) 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] {848#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:15,769 INFO L290 TraceCheckUtils]: 22: Hoare triple {848#(and (= (+ main_~n~0 (- 5)) 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] {849#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 15:56:15,769 INFO L290 TraceCheckUtils]: 23: Hoare triple {849#(and (<= main_~j~0 4) (= (+ 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[] {840#false} is VALID [2022-04-27 15:56:15,769 INFO L272 TraceCheckUtils]: 24: Hoare triple {840#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {840#false} is VALID [2022-04-27 15:56:15,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {840#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] {840#false} is VALID [2022-04-27 15:56:15,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {840#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[] {840#false} is VALID [2022-04-27 15:56:15,770 INFO L290 TraceCheckUtils]: 27: Hoare triple {840#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#false} is VALID [2022-04-27 15:56:15,770 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:15,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 15:56:15,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174005411] [2022-04-27 15:56:15,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174005411] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 15:56:15,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852296540] [2022-04-27 15:56:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:15,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 15:56:15,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 15:56:15,780 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:15,784 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:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 15:56:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 15:56:15,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 15:56:16,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {839#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#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] {839#true} is VALID [2022-04-27 15:56:16,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,120 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {839#true} {839#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,120 INFO L272 TraceCheckUtils]: 4: Hoare triple {839#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {839#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] {869#(<= 5 main_~n~0)} is VALID [2022-04-27 15:56:16,121 INFO L290 TraceCheckUtils]: 6: Hoare triple {869#(<= 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] {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:16,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(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] {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:16,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(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] {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:16,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(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] {873#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 15:56:16,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(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] {886#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:16,123 INFO L290 TraceCheckUtils]: 11: Hoare triple {886#(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] {886#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:16,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {886#(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[] {886#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:16,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {886#(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] {886#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 15:56:16,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {886#(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] {899#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:16,125 INFO L290 TraceCheckUtils]: 15: Hoare triple {899#(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] {899#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:16,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {899#(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[] {899#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:16,126 INFO L290 TraceCheckUtils]: 17: Hoare triple {899#(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] {899#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 15:56:16,126 INFO L290 TraceCheckUtils]: 18: Hoare triple {899#(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] {912#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:16,126 INFO L290 TraceCheckUtils]: 19: Hoare triple {912#(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] {912#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:16,127 INFO L290 TraceCheckUtils]: 20: Hoare triple {912#(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[] {912#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:16,127 INFO L290 TraceCheckUtils]: 21: Hoare triple {912#(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] {912#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 15:56:16,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {912#(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] {925#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-27 15:56:16,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {925#(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[] {840#false} is VALID [2022-04-27 15:56:16,128 INFO L272 TraceCheckUtils]: 24: Hoare triple {840#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {840#false} is VALID [2022-04-27 15:56:16,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {840#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] {840#false} is VALID [2022-04-27 15:56:16,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {840#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[] {840#false} is VALID [2022-04-27 15:56:16,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {840#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#false} is VALID [2022-04-27 15:56:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:16,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 15:56:16,281 INFO L290 TraceCheckUtils]: 27: Hoare triple {840#false} [251] L7-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {840#false} is VALID [2022-04-27 15:56:16,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {840#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[] {840#false} is VALID [2022-04-27 15:56:16,283 INFO L290 TraceCheckUtils]: 25: Hoare triple {840#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] {840#false} is VALID [2022-04-27 15:56:16,283 INFO L272 TraceCheckUtils]: 24: Hoare triple {840#false} [232] L96-4-->__VERIFIER_assertENTRY: Formula: (= (ite (= v_main_~i~0_14 2) 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] {840#false} is VALID [2022-04-27 15:56:16,283 INFO L290 TraceCheckUtils]: 23: Hoare triple {953#(<= 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[] {840#false} is VALID [2022-04-27 15:56:16,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {957#(<= (+ 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] {953#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 15:56:16,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {957#(<= (+ 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] {957#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:16,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {957#(<= (+ 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[] {957#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:16,285 INFO L290 TraceCheckUtils]: 19: Hoare triple {957#(<= (+ 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] {957#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:16,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {970#(<= (+ 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] {957#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 15:56:16,286 INFO L290 TraceCheckUtils]: 17: Hoare triple {970#(<= (+ 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] {970#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:16,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {970#(<= (+ 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[] {970#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:16,287 INFO L290 TraceCheckUtils]: 15: Hoare triple {970#(<= (+ 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] {970#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:16,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {983#(<= (+ 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] {970#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 15:56:16,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {983#(<= (+ 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] {983#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:16,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {983#(<= (+ 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[] {983#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:16,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {983#(<= (+ 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] {983#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:16,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {996#(<= (+ 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] {983#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 15:56:16,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {996#(<= (+ 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] {996#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:16,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {996#(<= (+ 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] {996#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:16,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {996#(<= (+ 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] {996#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:16,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {1009#(<= 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] {996#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 15:56:16,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {839#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] {1009#(<= 4 main_~n~0)} is VALID [2022-04-27 15:56:16,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {839#true} [218] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {839#true} {839#true} [303] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {839#true} [222] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#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] {839#true} is VALID [2022-04-27 15:56:16,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {839#true} [217] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {839#true} is VALID [2022-04-27 15:56:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 15:56:16,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852296540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 15:56:16,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 15:56:16,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-27 15:56:16,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980433367] [2022-04-27 15:56:16,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 15:56:16,293 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:56:16,296 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 15:56:16,296 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:16,341 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:16,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 15:56:16,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 15:56:16,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 15:56:16,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-27 15:56:16,342 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:16,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,666 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 15:56:16,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 15:56:16,667 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 15:56:16,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 15:56:16,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:16,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-27 15:56:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 52 transitions. [2022-04-27 15:56:16,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 52 transitions. [2022-04-27 15:56:16,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 15:56:16,711 INFO L225 Difference]: With dead ends: 66 [2022-04-27 15:56:16,711 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 15:56:16,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2022-04-27 15:56:16,712 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 70 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 15:56:16,712 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 72 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 15:56:16,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 15:56:16,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 15:56:16,715 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 15:56:16,715 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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:16,715 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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:16,716 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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:16,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,717 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 15:56:16,717 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 15:56:16,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:16,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:16,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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 66 states. [2022-04-27 15:56:16,718 INFO L87 Difference]: Start difference. First operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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 66 states. [2022-04-27 15:56:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 15:56:16,719 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 15:56:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 15:56:16,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 15:56:16,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 15:56:16,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 15:56:16,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 15:56:16,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 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:16,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-04-27 15:56:16,721 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2022-04-27 15:56:16,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 15:56:16,721 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-04-27 15:56:16,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 15:56:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-27 15:56:16,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 15:56:16,724 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 15:56:16,724 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 15:56:16,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 15:56:16,934 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,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 15:56:16,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 15:56:16,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1847728185, now seen corresponding path program 2 times [2022-04-27 15:56:16,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 15:56:16,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456762469] [2022-04-27 15:56:16,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 15:56:16,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 15:56:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:16,983 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 15:56:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 15:56:17,030 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 15:56:17,031 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 15:56:17,031 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 15:56:17,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 15:56:17,042 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-27 15:56:17,044 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 15:56:17,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 03:56:17 BasicIcfg [2022-04-27 15:56:17,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 15:56:17,082 INFO L158 Benchmark]: Toolchain (without parser) took 4678.82ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 141.4MB in the beginning and 201.4MB in the end (delta: -60.0MB). Peak memory consumption was 104.6MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,082 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 15:56:17,082 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.75ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 164.2MB in the end (delta: -23.1MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,082 INFO L158 Benchmark]: Boogie Preprocessor took 62.89ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 161.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,082 INFO L158 Benchmark]: RCFGBuilder took 431.92ms. Allocated memory is still 189.8MB. Free memory was 161.6MB in the beginning and 141.1MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,082 INFO L158 Benchmark]: IcfgTransformer took 56.69ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 138.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,083 INFO L158 Benchmark]: TraceAbstraction took 3839.38ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 138.0MB in the beginning and 201.4MB in the end (delta: -63.4MB). Peak memory consumption was 100.2MB. Max. memory is 8.0GB. [2022-04-27 15:56:17,084 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.10ms. Allocated memory is still 189.8MB. Free memory was 157.7MB in the beginning and 157.5MB in the end (delta: 151.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 282.75ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 164.2MB in the end (delta: -23.1MB). Peak memory consumption was 9.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 62.89ms. Allocated memory is still 189.8MB. Free memory was 164.2MB in the beginning and 161.6MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 431.92ms. Allocated memory is still 189.8MB. Free memory was 161.6MB in the beginning and 141.1MB in the end (delta: 20.4MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * IcfgTransformer took 56.69ms. Allocated memory is still 189.8MB. Free memory was 141.1MB in the beginning and 138.5MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3839.38ms. Allocated memory was 189.8MB in the beginning and 228.6MB in the end (delta: 38.8MB). Free memory was 138.0MB in the beginning and 201.4MB in the end (delta: -63.4MB). Peak memory consumption was 100.2MB. 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 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; VAL [\old(a)=20020, \old(a)=20006, \old(b)=20013, \old(b)=20003, \old(x)=20017, \old(x)=20011, a={4:0}, b={5:0}, x={6:0}] [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, n=5, nmax=50, x={6:0}] [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L96] COND FALSE !(j <= n) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L102] CALL __VERIFIER_assert(i==2) VAL [\old(cond)=0, a={4:0}, b={5:0}, x={6:0}] [L6] COND TRUE !(cond) VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] [L7] reach_error() VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 208 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 202 mSDsluCounter, 243 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 110 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 321 IncrementalHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 133 mSDtfsCounter, 321 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 37, 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, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 4 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 28/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 15:56:17,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...