/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/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/lu.cmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:01:47,211 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:01:47,213 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:01:47,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:01:47,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:01:47,246 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:01:47,249 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:01:47,250 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:01:47,252 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:01:47,253 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:01:47,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:01:47,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:01:47,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:01:47,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:01:47,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:01:47,258 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:01:47,258 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:01:47,263 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:01:47,268 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:01:47,273 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:01:47,275 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:01:47,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:01:47,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:01:47,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:01:47,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:01:47,286 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:01:47,287 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:01:47,287 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:01:47,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:01:47,288 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:01:47,288 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:01:47,288 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:01:47,289 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:01:47,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:01:47,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:01:47,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:01:47,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:01:47,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:01:47,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:01:47,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:01:47,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:01:47,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:01:47,293 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:01:47,298 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:01:47,299 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:01:47,301 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:01:47,301 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:01:47,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:01:47,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:01:47,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:01:47,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:01:47,302 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:01:47,302 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:01:47,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:01:47,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:47,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:01:47,303 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:01:47,304 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 12:01:47,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:01:47,498 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:01:47,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:01:47,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:01:47,501 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:01:47,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/lu.cmp.c [2022-04-15 12:01:47,549 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8d4389a/f7df913fa09048c39997227464e1caee/FLAG6aabfe824 [2022-04-15 12:01:47,836 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:01:47,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c [2022-04-15 12:01:47,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8d4389a/f7df913fa09048c39997227464e1caee/FLAG6aabfe824 [2022-04-15 12:01:48,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3f8d4389a/f7df913fa09048c39997227464e1caee [2022-04-15 12:01:48,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:01:48,267 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:01:48,270 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:48,270 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:01:48,272 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:01:48,273 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e1cf7ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48, skipping insertion in model container [2022-04-15 12:01:48,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:01:48,299 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:01:48,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-15 12:01:48,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:48,443 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:01:48,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/lu.cmp.c[318,331] [2022-04-15 12:01:48,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:01:48,478 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:01:48,478 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48 WrapperNode [2022-04-15 12:01:48,478 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:01:48,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:01:48,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:01:48,479 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:01:48,501 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,511 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,511 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,535 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:01:48,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:01:48,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:01:48,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:01:48,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (1/1) ... [2022-04-15 12:01:48,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:01:48,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:48,586 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-15 12:01:48,605 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-15 12:01:48,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:01:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:01:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:01:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:01:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-15 12:01:48,625 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:01:48,626 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-15 12:01:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:01:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:01:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:01:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:01:48,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:01:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-15 12:01:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-15 12:01:48,627 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:01:48,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:01:48,719 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:01:48,720 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:01:49,050 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:01:49,055 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:01:49,055 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-15 12:01:49,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:49 BoogieIcfgContainer [2022-04-15 12:01:49,057 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:01:49,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:01:49,058 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:01:49,060 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:01:49,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:01:48" (1/3) ... [2022-04-15 12:01:49,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d51d54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:49, skipping insertion in model container [2022-04-15 12:01:49,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:01:48" (2/3) ... [2022-04-15 12:01:49,061 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d51d54c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:01:49, skipping insertion in model container [2022-04-15 12:01:49,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:01:49" (3/3) ... [2022-04-15 12:01:49,062 INFO L111 eAbstractionObserver]: Analyzing ICFG lu.cmp.c [2022-04-15 12:01:49,065 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:01:49,065 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:01:49,102 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:01:49,106 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, 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 [2022-04-15 12:01:49,106 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:01:49,119 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-15 12:01:49,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:49,124 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:49,124 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:49,125 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:49,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:49,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-15 12:01:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1691708270] [2022-04-15 12:01:49,140 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:49,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 2 times [2022-04-15 12:01:49,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:49,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064041747] [2022-04-15 12:01:49,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:49,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:49,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:49,358 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-15 12:01:49,358 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 12:01:49,359 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-15 12:01:49,361 INFO L272 TraceCheckUtils]: 0: Hoare triple {67#true} call ULTIMATE.init(); {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-15 12:01:49,361 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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {67#true} is VALID [2022-04-15 12:01:49,361 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-15 12:01:49,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-15 12:01:49,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-15 12:01:49,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {67#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {67#true} is VALID [2022-04-15 12:01:49,362 INFO L290 TraceCheckUtils]: 6: Hoare triple {67#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {67#true} is VALID [2022-04-15 12:01:49,363 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-15 12:01:49,364 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {68#false} is VALID [2022-04-15 12:01:49,364 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-15 12:01:49,364 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-15 12:01:49,364 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-15 12:01:49,365 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-15 12:01:49,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:49,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064041747] [2022-04-15 12:01:49,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064041747] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:49,369 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:49,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1691708270] [2022-04-15 12:01:49,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1691708270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:49,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:49,369 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:01:49,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533747279] [2022-04-15 12:01:49,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:49,373 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-15 12:01:49,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:49,378 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-15 12:01:49,397 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-15 12:01:49,397 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:01:49,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:49,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:01:49,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:01:49,427 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-15 12:01:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:49,793 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-15 12:01:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:01:49,793 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-15 12:01:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:49,794 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-15 12:01:49,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-15 12:01:49,808 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-15 12:01:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-15 12:01:49,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-15 12:01:50,031 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,038 INFO L225 Difference]: With dead ends: 147 [2022-04-15 12:01:50,038 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 12:01:50,042 INFO L912 BasicCegarLoop]: 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-15 12:01:50,046 INFO L913 BasicCegarLoop]: 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-15 12:01:50,047 INFO L914 BasicCegarLoop]: 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-15 12:01:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 12:01:50,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-15 12:01:50,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,076 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-15 12:01:50,076 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-15 12:01:50,077 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-15 12:01:50,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,080 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 12:01:50,080 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 12:01:50,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,082 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-15 12:01:50,082 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-15 12:01:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,084 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 12:01:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-15 12:01:50,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,086 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-15 12:01:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 12:01:50,088 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-15 12:01:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,089 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 12:01:50,092 INFO L479 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-15 12:01:50,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 12:01:50,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 12:01:50,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:01:50,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,121 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:01:50,121 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:50,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:50,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-15 12:01:50,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [215396825] [2022-04-15 12:01:50,125 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:01:50,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 2 times [2022-04-15 12:01:50,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:50,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482314503] [2022-04-15 12:01:50,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:50,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-15 12:01:50,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:01:50,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-15 12:01:50,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {464#(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-15 12:01:50,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {457#true} is VALID [2022-04-15 12:01:50,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2022-04-15 12:01:50,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #214#return; {457#true} is VALID [2022-04-15 12:01:50,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret37 := main(); {457#true} is VALID [2022-04-15 12:01:50,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {457#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {462#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:50,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {462#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:50,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {458#false} is VALID [2022-04-15 12:01:50,257 INFO L272 TraceCheckUtils]: 8: Hoare triple {458#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {458#false} is VALID [2022-04-15 12:01:50,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {458#false} ~cond := #in~cond; {458#false} is VALID [2022-04-15 12:01:50,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {458#false} assume 0 == ~cond; {458#false} is VALID [2022-04-15 12:01:50,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {458#false} assume !false; {458#false} is VALID [2022-04-15 12:01:50,257 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-15 12:01:50,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:50,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482314503] [2022-04-15 12:01:50,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482314503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:50,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:50,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:50,259 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:50,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [215396825] [2022-04-15 12:01:50,259 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [215396825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:50,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:50,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 12:01:50,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797612314] [2022-04-15 12:01:50,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:50,260 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-15 12:01:50,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:50,261 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-15 12:01:50,270 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-15 12:01:50,271 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 12:01:50,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 12:01:50,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 12:01:50,272 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-15 12:01:50,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,431 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 12:01:50,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:01:50,432 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-15 12:01:50,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:50,432 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-15 12:01:50,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:01:50,434 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-15 12:01:50,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-15 12:01:50,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-15 12:01:50,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,476 INFO L225 Difference]: With dead ends: 40 [2022-04-15 12:01:50,476 INFO L226 Difference]: Without dead ends: 26 [2022-04-15 12:01:50,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 12:01:50,480 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 24 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:50,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 25 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:50,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-15 12:01:50,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-15 12:01:50,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,491 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-15 12:01:50,492 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-15 12:01:50,492 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-15 12:01:50,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,495 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 12:01:50,495 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 12:01:50,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,495 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-15 12:01:50,496 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-15 12:01:50,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,498 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-15 12:01:50,498 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-15 12:01:50,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,498 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-15 12:01:50,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-15 12:01:50,501 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-15 12:01:50,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,501 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-15 12:01:50,502 INFO L479 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-15 12:01:50,502 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 23 transitions. [2022-04-15 12:01:50,520 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-15 12:01:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-15 12:01:50,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-15 12:01:50,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,522 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,522 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:01:50,522 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:50,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:50,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-15 12:01:50,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872233178] [2022-04-15 12:01:50,533 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:50,533 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:50,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 2 times [2022-04-15 12:01:50,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:50,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355515945] [2022-04-15 12:01:50,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:50,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:50,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:50,611 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-15 12:01:50,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 12:01:50,612 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 12:01:50,612 INFO L272 TraceCheckUtils]: 0: Hoare triple {645#true} call ULTIMATE.init(); {653#(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-15 12:01:50,613 INFO L290 TraceCheckUtils]: 1: Hoare triple {653#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {645#true} is VALID [2022-04-15 12:01:50,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {645#true} assume true; {645#true} is VALID [2022-04-15 12:01:50,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {645#true} {645#true} #214#return; {645#true} is VALID [2022-04-15 12:01:50,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {645#true} call #t~ret37 := main(); {645#true} is VALID [2022-04-15 12:01:50,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,614 INFO L290 TraceCheckUtils]: 6: Hoare triple {650#(< main_~i~0 50)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,614 INFO L290 TraceCheckUtils]: 7: Hoare triple {650#(< main_~i~0 50)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,615 INFO L290 TraceCheckUtils]: 8: Hoare triple {650#(< main_~i~0 50)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,615 INFO L290 TraceCheckUtils]: 9: Hoare triple {650#(< main_~i~0 50)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {650#(< main_~i~0 50)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,616 INFO L290 TraceCheckUtils]: 11: Hoare triple {650#(< main_~i~0 50)} assume !(~j~0 <= ~n~0); {650#(< main_~i~0 50)} is VALID [2022-04-15 12:01:50,616 INFO L272 TraceCheckUtils]: 12: Hoare triple {650#(< main_~i~0 50)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {651#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:50,617 INFO L290 TraceCheckUtils]: 13: Hoare triple {651#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {652#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:50,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {652#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {646#false} is VALID [2022-04-15 12:01:50,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {646#false} assume !false; {646#false} is VALID [2022-04-15 12:01:50,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 12:01:50,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355515945] [2022-04-15 12:01:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355515945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:01:50,618 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:50,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872233178] [2022-04-15 12:01:50,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872233178] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:50,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:50,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 12:01:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525627385] [2022-04-15 12:01:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:50,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:01:50,619 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:50,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,630 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 12:01:50,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 12:01:50,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-15 12:01:50,630 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,869 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-15 12:01:50,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:01:50,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-15 12:01:50,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:50,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 12:01:50,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 39 transitions. [2022-04-15 12:01:50,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 39 transitions. [2022-04-15 12:01:50,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,920 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:01:50,920 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 12:01:50,920 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:01:50,921 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:50,921 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:50,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 12:01:50,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-04-15 12:01:50,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:50,930 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:50,930 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:50,930 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:50,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,931 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:01:50,931 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 12:01:50,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,932 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 12:01:50,932 INFO L87 Difference]: Start difference. First operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 34 states. [2022-04-15 12:01:50,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:50,933 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-15 12:01:50,933 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 12:01:50,933 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:50,933 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:50,933 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:50,933 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:50,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-15 12:01:50,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 12:01:50,934 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 16 [2022-04-15 12:01:50,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:50,935 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 12:01:50,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 12:01:50,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 12:01:50,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:50,965 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 12:01:50,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 12:01:50,966 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:50,966 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:50,966 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:01:50,966 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:50,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:50,967 INFO L85 PathProgramCache]: Analyzing trace with hash 419710194, now seen corresponding path program 1 times [2022-04-15 12:01:50,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:50,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [487575602] [2022-04-15 12:01:51,043 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:51,043 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:51,044 INFO L85 PathProgramCache]: Analyzing trace with hash 419710194, now seen corresponding path program 2 times [2022-04-15 12:01:51,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:51,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339906063] [2022-04-15 12:01:51,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:51,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {868#true} is VALID [2022-04-15 12:01:51,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {868#true} {868#true} #214#return; {868#true} is VALID [2022-04-15 12:01:51,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,142 INFO L290 TraceCheckUtils]: 0: Hoare triple {868#true} ~cond := #in~cond; {868#true} is VALID [2022-04-15 12:01:51,142 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} assume !(0 == ~cond); {868#true} is VALID [2022-04-15 12:01:51,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {873#(= main_~i~0 0)} #210#return; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,143 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {881#(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-15 12:01:51,144 INFO L290 TraceCheckUtils]: 1: Hoare triple {881#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {868#true} is VALID [2022-04-15 12:01:51,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #214#return; {868#true} is VALID [2022-04-15 12:01:51,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret37 := main(); {868#true} is VALID [2022-04-15 12:01:51,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#(= main_~i~0 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(= main_~i~0 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {873#(= main_~i~0 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {873#(= main_~i~0 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {873#(= main_~i~0 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {873#(= main_~i~0 0)} assume !(~j~0 <= ~n~0); {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,148 INFO L272 TraceCheckUtils]: 12: Hoare triple {873#(= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {868#true} is VALID [2022-04-15 12:01:51,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {868#true} ~cond := #in~cond; {868#true} is VALID [2022-04-15 12:01:51,149 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#true} assume !(0 == ~cond); {868#true} is VALID [2022-04-15 12:01:51,149 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,149 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {868#true} {873#(= main_~i~0 0)} #210#return; {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,150 INFO L290 TraceCheckUtils]: 17: Hoare triple {873#(= main_~i~0 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {873#(= main_~i~0 0)} is VALID [2022-04-15 12:01:51,150 INFO L290 TraceCheckUtils]: 18: Hoare triple {873#(= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {878#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {878#(<= main_~i~0 1)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {878#(<= main_~i~0 1)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {878#(<= main_~i~0 1)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {878#(<= main_~i~0 1)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {878#(<= main_~i~0 1)} assume !(~j~0 <= ~n~0); {878#(<= main_~i~0 1)} is VALID [2022-04-15 12:01:51,154 INFO L272 TraceCheckUtils]: 25: Hoare triple {878#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {879#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:51,154 INFO L290 TraceCheckUtils]: 26: Hoare triple {879#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {880#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:51,154 INFO L290 TraceCheckUtils]: 27: Hoare triple {880#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {869#false} is VALID [2022-04-15 12:01:51,154 INFO L290 TraceCheckUtils]: 28: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-15 12:01:51,155 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-15 12:01:51,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339906063] [2022-04-15 12:01:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339906063] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494821249] [2022-04-15 12:01:51,155 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 12:01:51,156 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:51,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:51,157 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-15 12:01:51,157 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-15 12:01:51,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 12:01:51,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:51,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 12:01:51,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:51,256 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:51,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2022-04-15 12:01:51,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {868#true} is VALID [2022-04-15 12:01:51,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #214#return; {868#true} is VALID [2022-04-15 12:01:51,404 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret37 := main(); {868#true} is VALID [2022-04-15 12:01:51,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {900#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {900#(<= main_~n~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {900#(<= main_~n~0 5)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {900#(<= main_~n~0 5)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {900#(<= main_~n~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {900#(<= main_~n~0 5)} assume !(~j~0 <= ~n~0); {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,407 INFO L272 TraceCheckUtils]: 12: Hoare triple {900#(<= main_~n~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {868#true} is VALID [2022-04-15 12:01:51,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {868#true} ~cond := #in~cond; {868#true} is VALID [2022-04-15 12:01:51,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#true} assume !(0 == ~cond); {868#true} is VALID [2022-04-15 12:01:51,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,408 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {868#true} {900#(<= main_~n~0 5)} #210#return; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {900#(<= main_~n~0 5)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {900#(<= main_~n~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {900#(<= main_~n~0 5)} is VALID [2022-04-15 12:01:51,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {900#(<= main_~n~0 5)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {943#(<= main_~i~0 5)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {943#(<= main_~i~0 5)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {943#(<= main_~i~0 5)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,410 INFO L290 TraceCheckUtils]: 23: Hoare triple {943#(<= main_~i~0 5)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {943#(<= main_~i~0 5)} assume !(~j~0 <= ~n~0); {943#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:51,411 INFO L272 TraceCheckUtils]: 25: Hoare triple {943#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:51,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {962#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:51,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {966#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {869#false} is VALID [2022-04-15 12:01:51,411 INFO L290 TraceCheckUtils]: 28: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-15 12:01:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:01:51,412 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:51,578 INFO L290 TraceCheckUtils]: 28: Hoare triple {869#false} assume !false; {869#false} is VALID [2022-04-15 12:01:51,579 INFO L290 TraceCheckUtils]: 27: Hoare triple {966#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {869#false} is VALID [2022-04-15 12:01:51,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {962#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {966#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 12:01:51,587 INFO L272 TraceCheckUtils]: 25: Hoare triple {982#(< main_~i~0 50)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {962#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 12:01:51,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {982#(< main_~i~0 50)} assume !(~j~0 <= ~n~0); {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,588 INFO L290 TraceCheckUtils]: 23: Hoare triple {982#(< main_~i~0 50)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,588 INFO L290 TraceCheckUtils]: 22: Hoare triple {982#(< main_~i~0 50)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,588 INFO L290 TraceCheckUtils]: 21: Hoare triple {982#(< main_~i~0 50)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,589 INFO L290 TraceCheckUtils]: 20: Hoare triple {982#(< main_~i~0 50)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,589 INFO L290 TraceCheckUtils]: 19: Hoare triple {1001#(< main_~n~0 50)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {982#(< main_~i~0 50)} is VALID [2022-04-15 12:01:51,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {1001#(< main_~n~0 50)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {1001#(< main_~n~0 50)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,590 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {868#true} {1001#(< main_~n~0 50)} #210#return; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#true} assume !(0 == ~cond); {868#true} is VALID [2022-04-15 12:01:51,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {868#true} ~cond := #in~cond; {868#true} is VALID [2022-04-15 12:01:51,591 INFO L272 TraceCheckUtils]: 12: Hoare triple {1001#(< main_~n~0 50)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {868#true} is VALID [2022-04-15 12:01:51,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {1001#(< main_~n~0 50)} assume !(~j~0 <= ~n~0); {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {1001#(< main_~n~0 50)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {1001#(< main_~n~0 50)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {1001#(< main_~n~0 50)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {1001#(< main_~n~0 50)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,593 INFO L290 TraceCheckUtils]: 6: Hoare triple {1001#(< main_~n~0 50)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,593 INFO L290 TraceCheckUtils]: 5: Hoare triple {868#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1001#(< main_~n~0 50)} is VALID [2022-04-15 12:01:51,593 INFO L272 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret37 := main(); {868#true} is VALID [2022-04-15 12:01:51,593 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #214#return; {868#true} is VALID [2022-04-15 12:01:51,594 INFO L290 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2022-04-15 12:01:51,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {868#true} is VALID [2022-04-15 12:01:51,594 INFO L272 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2022-04-15 12:01:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 12:01:51,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494821249] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:51,594 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-04-15 12:01:51,595 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:51,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [487575602] [2022-04-15 12:01:51,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [487575602] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:51,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:51,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 12:01:51,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247577571] [2022-04-15 12:01:51,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:51,596 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 12:01:51,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:51,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:51,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:51,614 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 12:01:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 12:01:51,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:01:51,615 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,860 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2022-04-15 12:01:51,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 12:01:51,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2022-04-15 12:01:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:51,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:51,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 12:01:51,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:51,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 12:01:51,864 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 12:01:51,896 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:51,898 INFO L225 Difference]: With dead ends: 49 [2022-04-15 12:01:51,898 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 12:01:51,898 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:51,899 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 21 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:51,899 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 39 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:01:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 12:01:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-04-15 12:01:51,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:51,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:01:51,916 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:01:51,916 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:01:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,917 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-15 12:01:51,917 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-15 12:01:51,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:51,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:51,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-15 12:01:51,918 INFO L87 Difference]: Start difference. First operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 47 states. [2022-04-15 12:01:51,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:51,919 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-04-15 12:01:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-04-15 12:01:51,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:51,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:51,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:51,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:51,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 35 states have (on average 1.2) internal successors, (42), 36 states have internal predecessors, (42), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-15 12:01:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-04-15 12:01:51,921 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 29 [2022-04-15 12:01:51,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:51,921 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-04-15 12:01:51,921 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 5 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:51,921 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 51 transitions. [2022-04-15 12:01:51,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-04-15 12:01:51,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 12:01:51,964 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:01:51,965 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:01:51,997 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-15 12:01:52,181 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:52,181 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:01:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:01:52,182 INFO L85 PathProgramCache]: Analyzing trace with hash 681721336, now seen corresponding path program 3 times [2022-04-15 12:01:52,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2076941588] [2022-04-15 12:01:52,269 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-04-15 12:01:52,269 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 12:01:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash 681721336, now seen corresponding path program 4 times [2022-04-15 12:01:52,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:01:52,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327085390] [2022-04-15 12:01:52,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:01:52,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:01:52,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:01:52,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,388 INFO L290 TraceCheckUtils]: 0: Hoare triple {1370#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1352#true} is VALID [2022-04-15 12:01:52,390 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,390 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1352#true} {1352#true} #214#return; {1352#true} is VALID [2022-04-15 12:01:52,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 12:01:52,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1357#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-04-15 12:01:52,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,410 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1357#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1370#(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-15 12:01:52,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {1370#(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|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1352#true} is VALID [2022-04-15 12:01:52,411 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,411 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #214#return; {1352#true} is VALID [2022-04-15 12:01:52,411 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret37 := main(); {1352#true} is VALID [2022-04-15 12:01:52,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,412 INFO L290 TraceCheckUtils]: 6: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !(~j~0 <= ~n~0); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,414 INFO L272 TraceCheckUtils]: 12: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1352#true} is VALID [2022-04-15 12:01:52,414 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,414 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,414 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,415 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1352#true} {1357#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,415 INFO L290 TraceCheckUtils]: 17: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,415 INFO L290 TraceCheckUtils]: 18: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,425 INFO L290 TraceCheckUtils]: 23: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !(~j~0 <= ~n~0); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,425 INFO L272 TraceCheckUtils]: 25: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1352#true} is VALID [2022-04-15 12:01:52,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,427 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1352#true} {1357#(= (+ main_~n~0 (- 5)) 0)} #210#return; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,428 INFO L290 TraceCheckUtils]: 30: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1357#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-15 12:01:52,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {1357#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:52,431 INFO L290 TraceCheckUtils]: 33: Hoare triple {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:52,432 INFO L290 TraceCheckUtils]: 34: Hoare triple {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:52,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:52,433 INFO L290 TraceCheckUtils]: 36: Hoare triple {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-15 12:01:52,433 INFO L290 TraceCheckUtils]: 37: Hoare triple {1366#(and (<= main_~i~0 main_~n~0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {1367#(<= main_~i~0 5)} is VALID [2022-04-15 12:01:52,434 INFO L272 TraceCheckUtils]: 38: Hoare triple {1367#(<= main_~i~0 5)} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:01:52,434 INFO L290 TraceCheckUtils]: 39: Hoare triple {1368#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1369#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:01:52,434 INFO L290 TraceCheckUtils]: 40: Hoare triple {1369#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 12:01:52,435 INFO L290 TraceCheckUtils]: 41: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 12:01:52,435 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-04-15 12:01:52,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:01:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327085390] [2022-04-15 12:01:52,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327085390] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 12:01:52,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [238188363] [2022-04-15 12:01:52,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 12:01:52,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 12:01:52,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:01:52,440 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-15 12:01:52,442 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-15 12:01:52,519 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 12:01:52,520 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 12:01:52,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 12:01:52,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:01:52,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 12:01:52,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-15 12:01:52,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1352#true} is VALID [2022-04-15 12:01:52,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #214#return; {1352#true} is VALID [2022-04-15 12:01:52,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret37 := main(); {1352#true} is VALID [2022-04-15 12:01:52,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1389#(<= 5 main_~n~0)} is VALID [2022-04-15 12:01:52,683 INFO L290 TraceCheckUtils]: 6: Hoare triple {1389#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-15 12:01:52,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-15 12:01:52,684 INFO L290 TraceCheckUtils]: 8: Hoare triple {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-15 12:01:52,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-15 12:01:52,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {1393#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1406#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {1406#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L272 TraceCheckUtils]: 12: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {1353#false} ~cond := #in~cond; {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {1353#false} assume !(0 == ~cond); {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {1353#false} assume true; {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1353#false} {1353#false} #210#return; {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {1353#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {1353#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {1353#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {1353#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 22: Hoare triple {1353#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {1353#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {1353#false} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L272 TraceCheckUtils]: 25: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 26: Hoare triple {1353#false} ~cond := #in~cond; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {1353#false} assume !(0 == ~cond); {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L290 TraceCheckUtils]: 28: Hoare triple {1353#false} assume true; {1353#false} is VALID [2022-04-15 12:01:52,686 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1353#false} {1353#false} #210#return; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {1353#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {1353#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {1353#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {1353#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {1353#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 35: Hoare triple {1353#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 36: Hoare triple {1353#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {1353#false} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L272 TraceCheckUtils]: 38: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1353#false} is VALID [2022-04-15 12:01:52,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {1353#false} ~cond := #in~cond; {1353#false} is VALID [2022-04-15 12:01:52,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {1353#false} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 12:01:52,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 12:01:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2022-04-15 12:01:52,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 41: Hoare triple {1353#false} assume !false; {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 40: Hoare triple {1353#false} assume 0 == ~cond; {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 39: Hoare triple {1353#false} ~cond := #in~cond; {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L272 TraceCheckUtils]: 38: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 37: Hoare triple {1353#false} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 36: Hoare triple {1353#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1353#false} is VALID [2022-04-15 12:01:52,829 INFO L290 TraceCheckUtils]: 35: Hoare triple {1353#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 34: Hoare triple {1353#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 33: Hoare triple {1353#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 32: Hoare triple {1353#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 31: Hoare triple {1353#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 30: Hoare triple {1353#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {1352#true} {1353#false} #210#return; {1353#false} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 28: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,830 INFO L272 TraceCheckUtils]: 25: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1352#true} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {1353#false} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 23: Hoare triple {1353#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {1353#false} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {1353#false} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {1353#false} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {1353#false} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {1353#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {1353#false} call write~real(~w~0, ~#b~0.base, ~#b~0.offset + 8 * ~i~0, 8); {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1352#true} {1353#false} #210#return; {1353#false} is VALID [2022-04-15 12:01:52,831 INFO L290 TraceCheckUtils]: 15: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {1352#true} assume !(0 == ~cond); {1352#true} is VALID [2022-04-15 12:01:52,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {1352#true} ~cond := #in~cond; {1352#true} is VALID [2022-04-15 12:01:52,832 INFO L272 TraceCheckUtils]: 12: Hoare triple {1353#false} call __VERIFIER_assert((if ~i~0 < 50 then 1 else 0)); {1352#true} is VALID [2022-04-15 12:01:52,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {1590#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1353#false} is VALID [2022-04-15 12:01:52,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {1594#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1590#(<= main_~j~0 main_~n~0)} is VALID [2022-04-15 12:01:52,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {1594#(<= (+ main_~j~0 1) main_~n~0)} call #t~mem7 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);~w~0 := ~someBinaryArithmeticDOUBLEoperation(~w~0, #t~mem7);havoc #t~mem7; {1594#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:01:52,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {1594#(<= (+ main_~j~0 1) main_~n~0)} assume ~i~0 == ~j~0;call #t~mem6 := read~real(~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);call write~real(~someBinaryArithmeticDOUBLEoperation(#t~mem6, 10.0), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8);havoc #t~mem6; {1594#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:01:52,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {1594#(<= (+ main_~j~0 1) main_~n~0)} assume !!(~j~0 <= ~n~0);call write~real(~convertINTToDOUBLE(1 + ~i~0 + (1 + ~j~0)), ~#a~0.base, ~#a~0.offset + 400 * ~i~0 + 8 * ~j~0, 8); {1594#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:01:52,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {1607#(<= 1 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1594#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-15 12:01:52,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {1352#true} havoc ~i~0;havoc ~j~0;~nmax~0 := 50;~n~0 := 5;havoc ~chkerr~0;havoc ~eps~0;havoc ~w~0;~eps~0 := 1.0E-6;~i~0 := 0; {1607#(<= 1 main_~n~0)} is VALID [2022-04-15 12:01:52,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {1352#true} call #t~ret37 := main(); {1352#true} is VALID [2022-04-15 12:01:52,835 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1352#true} {1352#true} #214#return; {1352#true} is VALID [2022-04-15 12:01:52,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {1352#true} assume true; {1352#true} is VALID [2022-04-15 12:01:52,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {1352#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~#a~0.base, ~#a~0.offset := 4, 0;call #Ultimate.allocInit(20000, 4);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#a~0.base);~#b~0.base, ~#b~0.offset := 5, 0;call #Ultimate.allocInit(400, 5);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#b~0.base);~#x~0.base, ~#x~0.offset := 6, 0;call #Ultimate.allocInit(400, 6);#memory_real := ~initToZeroAtPointerBaseAddress~real(#memory_real, ~#x~0.base); {1352#true} is VALID [2022-04-15 12:01:52,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {1352#true} call ULTIMATE.init(); {1352#true} is VALID [2022-04-15 12:01:52,835 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 20 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-04-15 12:01:52,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [238188363] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 12:01:52,835 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 12:01:52,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 14 [2022-04-15 12:01:52,836 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:01:52,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2076941588] [2022-04-15 12:01:52,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2076941588] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:01:52,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:01:52,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:01:52,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751319548] [2022-04-15 12:01:52,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:01:52,837 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-04-15 12:01:52,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:01:52,837 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:52,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:52,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:01:52,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:01:52,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:01:52,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:01:52,861 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,050 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-04-15 12:01:53,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:01:53,051 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 42 [2022-04-15 12:01:53,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:01:53,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:53,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-15 12:01:53,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2022-04-15 12:01:53,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 24 transitions. [2022-04-15 12:01:53,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,088 INFO L225 Difference]: With dead ends: 45 [2022-04-15 12:01:53,088 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 12:01:53,088 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-04-15 12:01:53,089 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:01:53,089 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:01:53,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 12:01:53,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 12:01:53,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:01:53,090 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:53,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:53,090 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:53,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:53,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:53,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:01:53,091 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 12:01:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:01:53,091 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 12:01:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:53,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:01:53,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:01:53,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:01:53,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 12:01:53,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 12:01:53,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2022-04-15 12:01:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:01:53,092 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 12:01:53,092 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 12:01:53,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 12:01:53,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:01:53,092 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 12:01:53,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:01:53,094 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 12:01:53,120 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-15 12:01:53,303 WARN L460 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-15 12:01:53,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 12:01:53,526 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-04-15 12:01:53,526 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-04-15 12:01:53,526 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-04-15 12:01:53,526 INFO L885 garLoopResultBuilder]: At program point L118-2(lines 118 136) the Hoare annotation is: true [2022-04-15 12:01:53,526 INFO L885 garLoopResultBuilder]: At program point L118-3(lines 118 136) the Hoare annotation is: true [2022-04-15 12:01:53,526 INFO L885 garLoopResultBuilder]: At program point L118-4(lines 118 136) the Hoare annotation is: true [2022-04-15 12:01:53,526 INFO L885 garLoopResultBuilder]: At program point L120(line 120) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L120-1(line 120) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point ludcmpEXIT(lines 111 155) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L878 garLoopResultBuilder]: At program point ludcmpENTRY(lines 111 155) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L129-2(lines 129 135) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L129-3(lines 129 135) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L121-2(lines 121 128) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L121-3(lines 121 128) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L121-4(lines 121 128) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L146-2(lines 146 152) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L146-3(lines 146 152) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L146-4(lines 146 152) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point ludcmpFINAL(lines 111 155) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L138-2(lines 138 144) the Hoare annotation is: true [2022-04-15 12:01:53,527 INFO L885 garLoopResultBuilder]: At program point L138-3(lines 138 144) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L138-4(lines 138 144) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L132-2(lines 132 133) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L132-3(lines 132 133) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L132-4(lines 132 133) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L124(lines 124 126) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L124-1(lines 124 126) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L149-2(lines 149 150) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L149-3(lines 149 150) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L149-4(lines 149 150) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L141-2(lines 141 142) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L141-3(lines 141 142) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L141-4(lines 141 142) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L125-2(lines 125 126) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L125-3(lines 125 126) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L878 garLoopResultBuilder]: At program point L117(line 117) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L80(lines 80 81) the Hoare annotation is: true [2022-04-15 12:01:53,528 INFO L885 garLoopResultBuilder]: At program point L80-2(lines 80 81) the Hoare annotation is: true [2022-04-15 12:01:53,546 INFO L885 garLoopResultBuilder]: At program point fabsEXIT(lines 76 83) the Hoare annotation is: true [2022-04-15 12:01:53,546 INFO L885 garLoopResultBuilder]: At program point fabsENTRY(lines 76 83) the Hoare annotation is: true [2022-04-15 12:01:53,546 INFO L885 garLoopResultBuilder]: At program point fabsFINAL(lines 76 83) the Hoare annotation is: true [2022-04-15 12:01:53,547 INFO L878 garLoopResultBuilder]: At program point L99-2(line 99) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,547 INFO L878 garLoopResultBuilder]: At program point L93-2(lines 93 104) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,547 INFO L878 garLoopResultBuilder]: At program point L93-3(lines 93 104) the Hoare annotation is: (= 5 main_~n~0) [2022-04-15 12:01:53,547 INFO L885 garLoopResultBuilder]: At program point L93-4(lines 93 104) the Hoare annotation is: true [2022-04-15 12:01:53,547 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 85 109) the Hoare annotation is: true [2022-04-15 12:01:53,547 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 85 109) the Hoare annotation is: true [2022-04-15 12:01:53,547 INFO L885 garLoopResultBuilder]: At program point L106(line 106) the Hoare annotation is: true [2022-04-15 12:01:53,547 INFO L878 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,547 INFO L878 garLoopResultBuilder]: At program point L96-2(lines 96 101) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point mainENTRY(lines 85 109) the Hoare annotation is: (= |old(#memory_real)| |#memory_real|) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point L96-3(lines 96 101) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point L96-4(lines 96 101) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: (and (<= main_~i~0 main_~n~0) (= 5 main_~n~0)) [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (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|)) [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:01:53,548 INFO L878 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:01:53,549 INFO L878 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-04-15 12:01:53,549 INFO L878 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-04-15 12:01:53,551 INFO L719 BasicCegarLoop]: Path program histogram: [4, 2, 2, 2] [2022-04-15 12:01:53,552 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 12:01:53,555 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 12:01:53,557 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 12:01:53,566 INFO L163 areAnnotationChecker]: CFG has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 12:01:53,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 12:01:53 BoogieIcfgContainer [2022-04-15 12:01:53,575 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 12:01:53,576 INFO L158 Benchmark]: Toolchain (without parser) took 5308.07ms. Allocated memory was 168.8MB in the beginning and 215.0MB in the end (delta: 46.1MB). Free memory was 120.1MB in the beginning and 188.0MB in the end (delta: -67.9MB). Peak memory consumption was 97.9MB. Max. memory is 8.0GB. [2022-04-15 12:01:53,576 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 168.8MB. Free memory was 136.0MB in the beginning and 135.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:01:53,576 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.28ms. Allocated memory is still 168.8MB. Free memory was 119.8MB in the beginning and 141.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 12:01:53,576 INFO L158 Benchmark]: Boogie Preprocessor took 60.17ms. Allocated memory is still 168.8MB. Free memory was 141.7MB in the beginning and 139.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 12:01:53,576 INFO L158 Benchmark]: RCFGBuilder took 517.20ms. Allocated memory is still 168.8MB. Free memory was 139.0MB in the beginning and 119.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-15 12:01:53,577 INFO L158 Benchmark]: TraceAbstraction took 4516.91ms. Allocated memory was 168.8MB in the beginning and 215.0MB in the end (delta: 46.1MB). Free memory was 118.1MB in the beginning and 188.0MB in the end (delta: -69.8MB). Peak memory consumption was 96.2MB. Max. memory is 8.0GB. [2022-04-15 12:01:53,578 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.11ms. Allocated memory is still 168.8MB. Free memory was 136.0MB in the beginning and 135.9MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 208.28ms. Allocated memory is still 168.8MB. Free memory was 119.8MB in the beginning and 141.7MB in the end (delta: -21.8MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 60.17ms. Allocated memory is still 168.8MB. Free memory was 141.7MB in the beginning and 139.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 517.20ms. Allocated memory is still 168.8MB. Free memory was 139.0MB in the beginning and 119.0MB in the end (delta: 19.9MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4516.91ms. Allocated memory was 168.8MB in the beginning and 215.0MB in the end (delta: 46.1MB). Free memory was 118.1MB in the beginning and 188.0MB in the end (delta: -69.8MB). Peak memory consumption was 96.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 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.5s, OverallIterations: 5, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 127 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 204 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 84 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 298 IncrementalHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 120 mSDtfsCounter, 298 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 195 GetRequests, 150 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 64 LocationsWithAnnotation, 164 PreInvPairs, 301 NumberOfFragments, 166 HoareAnnotationTreeSize, 164 FomulaSimplifications, 479 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 64 FomulaSimplificationsInter, 226 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 5 == n - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 146]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: i <= n && 5 == n - InvariantResult [Line: 121]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 129]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 132]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 141]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 111]: Procedure Contract for ludcmp Derived contract for procedure ludcmp: 1 - ProcedureContractResult [Line: 76]: Procedure Contract for fabs Derived contract for procedure fabs: 1 - ProcedureContractResult [Line: 85]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-04-15 12:01:53,615 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...