/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/ludcmp.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:17:01,576 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:17:01,577 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:17:01,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:17:01,637 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:17:01,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:17:01,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:17:01,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:17:01,642 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:17:01,643 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:17:01,644 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:17:01,654 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:17:01,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:17:01,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:17:01,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:17:01,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:17:01,656 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:17:01,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:17:01,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:17:01,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:17:01,664 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:17:01,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:17:01,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:17:01,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:17:01,670 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:17:01,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:17:01,673 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:17:01,673 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:17:01,674 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:17:01,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:17:01,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:17:01,675 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:17:01,676 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:17:01,676 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:17:01,677 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:17:01,677 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:17:01,678 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:17:01,678 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:17:01,678 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:17:01,679 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:17:01,679 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:17:01,680 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:17:01,681 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:17:01,698 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:17:01,698 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:17:01,699 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:17:01,699 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:17:01,699 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:17:01,699 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:17:01,700 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:17:01,700 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:17:01,700 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:17:01,700 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:17:01,700 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:17:01,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:17:01,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:17:01,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:17:01,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:01,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:17:01,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:17:01,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:17:01,703 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:17:01,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:17:01,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:17:01,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:17:01,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:17:01,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:17:01,905 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:17:01,906 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:17:01,907 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:17:01,908 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/ludcmp.c [2022-04-27 10:17:01,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab75ccb/00d04448a8694c96bd447826ceb10f16/FLAG68ce33954 [2022-04-27 10:17:02,329 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:17:02,330 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c [2022-04-27 10:17:02,334 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab75ccb/00d04448a8694c96bd447826ceb10f16/FLAG68ce33954 [2022-04-27 10:17:02,342 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1ab75ccb/00d04448a8694c96bd447826ceb10f16 [2022-04-27 10:17:02,344 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:17:02,345 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:17:02,349 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:02,349 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:17:02,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:17:02,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7902424c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02, skipping insertion in model container [2022-04-27 10:17:02,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,357 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:17:02,370 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:17:02,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-27 10:17:02,554 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:02,561 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:17:02,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/ludcmp.c[318,331] [2022-04-27 10:17:02,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:17:02,594 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:17:02,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02 WrapperNode [2022-04-27 10:17:02,594 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:17:02,595 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:17:02,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:17:02,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:17:02,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,624 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,642 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,647 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,648 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,651 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:17:02,651 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:17:02,651 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:17:02,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:17:02,657 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (1/1) ... [2022-04-27 10:17:02,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:17:02,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:02,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-27 10:17:02,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-27 10:17:02,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:17:02,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:17:02,720 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:17:02,720 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:17:02,722 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs [2022-04-27 10:17:02,722 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:17:02,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ludcmp [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure ludcmp [2022-04-27 10:17:02,722 INFO L130 BoogieDeclarations]: Found specification of procedure fabs [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:17:02,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:17:02,794 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:17:02,795 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:17:03,092 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:17:03,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:17:03,098 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-04-27 10:17:03,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:03 BoogieIcfgContainer [2022-04-27 10:17:03,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:17:03,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:17:03,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:17:03,106 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:17:03,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:17:02" (1/3) ... [2022-04-27 10:17:03,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65986616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:03, skipping insertion in model container [2022-04-27 10:17:03,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:17:02" (2/3) ... [2022-04-27 10:17:03,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65986616 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:17:03, skipping insertion in model container [2022-04-27 10:17:03,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:17:03" (3/3) ... [2022-04-27 10:17:03,110 INFO L111 eAbstractionObserver]: Analyzing ICFG ludcmp.c [2022-04-27 10:17:03,119 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:17:03,119 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:17:03,161 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:17:03,165 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@418e2ee9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@74aa2c42 [2022-04-27 10:17:03,165 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:17:03,171 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-27 10:17:03,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:17:03,176 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:03,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:03,177 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:03,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:03,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1448102218, now seen corresponding path program 1 times [2022-04-27 10:17:03,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:03,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671168375] [2022-04-27 10:17:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:03,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:03,377 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-27 10:17:03,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 10:17:03,378 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-27 10:17:03,379 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-27 10:17:03,380 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-27 10:17:03,380 INFO L290 TraceCheckUtils]: 2: Hoare triple {67#true} assume true; {67#true} is VALID [2022-04-27 10:17:03,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67#true} {67#true} #214#return; {67#true} is VALID [2022-04-27 10:17:03,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {67#true} call #t~ret37 := main(); {67#true} is VALID [2022-04-27 10:17:03,380 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-27 10:17:03,381 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-27 10:17:03,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {67#true} assume !true; {68#false} is VALID [2022-04-27 10:17:03,381 INFO L272 TraceCheckUtils]: 8: Hoare triple {68#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {68#false} is VALID [2022-04-27 10:17:03,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {68#false} ~cond := #in~cond; {68#false} is VALID [2022-04-27 10:17:03,381 INFO L290 TraceCheckUtils]: 10: Hoare triple {68#false} assume 0 == ~cond; {68#false} is VALID [2022-04-27 10:17:03,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {68#false} assume !false; {68#false} is VALID [2022-04-27 10:17:03,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:03,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:03,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671168375] [2022-04-27 10:17:03,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671168375] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:03,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:03,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:17:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363624516] [2022-04-27 10:17:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:03,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:03,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:03,391 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:03,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:03,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:17:03,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:03,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:17:03,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:17:03,436 INFO L87 Difference]: Start difference. First operand has 64 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 53 states have internal predecessors, (81), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:03,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:03,778 INFO L93 Difference]: Finished difference Result 147 states and 225 transitions. [2022-04-27 10:17:03,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:17:03,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:03,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:03,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 10:17:03,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:03,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 225 transitions. [2022-04-27 10:17:03,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 225 transitions. [2022-04-27 10:17:03,974 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-27 10:17:03,981 INFO L225 Difference]: With dead ends: 147 [2022-04-27 10:17:03,981 INFO L226 Difference]: Without dead ends: 24 [2022-04-27 10:17:03,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:17:03,993 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:03,994 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 73 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:04,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-27 10:17:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 20. [2022-04-27 10:17:04,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:04,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,013 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,015 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,018 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 10:17:04,019 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 10:17:04,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,019 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 10:17:04,020 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-04-27 10:17:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,024 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-27 10:17:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-04-27 10:17:04,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:04,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:04,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-27 10:17:04,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 12 [2022-04-27 10:17:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:04,032 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-27 10:17:04,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,037 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-27 10:17:04,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:17:04,038 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:04,038 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:04,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:17:04,039 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:04,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:04,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1436096445, now seen corresponding path program 1 times [2022-04-27 10:17:04,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:04,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736350432] [2022-04-27 10:17:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:04,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #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); {346#true} is VALID [2022-04-27 10:17:04,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {346#true} assume true; {346#true} is VALID [2022-04-27 10:17:04,135 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {346#true} {346#true} #214#return; {346#true} is VALID [2022-04-27 10:17:04,137 INFO L272 TraceCheckUtils]: 0: Hoare triple {346#true} call ULTIMATE.init(); {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:04,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {353#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} #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); {346#true} is VALID [2022-04-27 10:17:04,137 INFO L290 TraceCheckUtils]: 2: Hoare triple {346#true} assume true; {346#true} is VALID [2022-04-27 10:17:04,143 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {346#true} {346#true} #214#return; {346#true} is VALID [2022-04-27 10:17:04,143 INFO L272 TraceCheckUtils]: 4: Hoare triple {346#true} call #t~ret37 := main(); {346#true} is VALID [2022-04-27 10:17:04,145 INFO L290 TraceCheckUtils]: 5: Hoare triple {346#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; {351#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {351#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {352#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {347#false} is VALID [2022-04-27 10:17:04,147 INFO L272 TraceCheckUtils]: 8: Hoare triple {347#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {347#false} is VALID [2022-04-27 10:17:04,147 INFO L290 TraceCheckUtils]: 9: Hoare triple {347#false} ~cond := #in~cond; {347#false} is VALID [2022-04-27 10:17:04,147 INFO L290 TraceCheckUtils]: 10: Hoare triple {347#false} assume 0 == ~cond; {347#false} is VALID [2022-04-27 10:17:04,147 INFO L290 TraceCheckUtils]: 11: Hoare triple {347#false} assume !false; {347#false} is VALID [2022-04-27 10:17:04,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:04,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:04,148 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736350432] [2022-04-27 10:17:04,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736350432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:04,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:04,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:17:04,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141776229] [2022-04-27 10:17:04,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:04,149 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:04,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:04,149 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:04,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:17:04,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:04,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:17:04,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:04,161 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,298 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-27 10:17:04,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:17:04,298 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:17:04,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:04,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:17:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 47 transitions. [2022-04-27 10:17:04,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 47 transitions. [2022-04-27 10:17:04,353 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-27 10:17:04,355 INFO L225 Difference]: With dead ends: 40 [2022-04-27 10:17:04,355 INFO L226 Difference]: Without dead ends: 26 [2022-04-27 10:17:04,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-27 10:17:04,359 INFO L413 NwaCegarLoop]: 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-27 10:17:04,359 INFO L414 NwaCegarLoop]: 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-27 10:17:04,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-27 10:17:04,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 21. [2022-04-27 10:17:04,365 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:04,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,367 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,368 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,370 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 10:17:04,371 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 10:17:04,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 10:17:04,371 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 26 states. [2022-04-27 10:17:04,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:04,374 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-04-27 10:17:04,374 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-04-27 10:17:04,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:04,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:04,375 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:04,375 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:04,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-04-27 10:17:04,379 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 12 [2022-04-27 10:17:04,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:04,379 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-04-27 10:17:04,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,380 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-27 10:17:04,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-27 10:17:04,381 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:04,381 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:04,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:17:04,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:04,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1858105272, now seen corresponding path program 1 times [2022-04-27 10:17:04,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:04,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907881835] [2022-04-27 10:17:04,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:04,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {505#(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); {497#true} is VALID [2022-04-27 10:17:04,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:04,465 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:04,466 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {505#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:04,466 INFO L290 TraceCheckUtils]: 1: Hoare triple {505#(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); {497#true} is VALID [2022-04-27 10:17:04,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:04,467 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:04,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} call #t~ret37 := main(); {497#true} is VALID [2022-04-27 10:17:04,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#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; {502#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:04,467 INFO L290 TraceCheckUtils]: 6: Hoare triple {502#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {503#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {503#(and (= main_~j~0 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); {503#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,469 INFO L290 TraceCheckUtils]: 8: Hoare triple {503#(and (= main_~j~0 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; {503#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,469 INFO L290 TraceCheckUtils]: 9: Hoare triple {503#(and (= main_~j~0 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; {503#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,469 INFO L290 TraceCheckUtils]: 10: Hoare triple {503#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {504#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:04,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {498#false} is VALID [2022-04-27 10:17:04,470 INFO L272 TraceCheckUtils]: 12: Hoare triple {498#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {498#false} is VALID [2022-04-27 10:17:04,470 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2022-04-27 10:17:04,470 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2022-04-27 10:17:04,470 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-04-27 10:17:04,470 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:04,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907881835] [2022-04-27 10:17:04,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907881835] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:04,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [182024987] [2022-04-27 10:17:04,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:04,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:04,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:04,480 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:04,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-27 10:17:04,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-27 10:17:04,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:04,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:04,733 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2022-04-27 10:17:04,733 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#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); {497#true} is VALID [2022-04-27 10:17:04,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:04,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:04,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} call #t~ret37 := main(); {497#true} is VALID [2022-04-27 10:17:04,735 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#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; {524#(<= 5 main_~n~0)} is VALID [2022-04-27 10:17:04,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {524#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {528#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:04,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {528#(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); {528#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:04,740 INFO L290 TraceCheckUtils]: 8: Hoare triple {528#(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; {528#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:04,740 INFO L290 TraceCheckUtils]: 9: Hoare triple {528#(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; {528#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:04,741 INFO L290 TraceCheckUtils]: 10: Hoare triple {528#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {541#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:04,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {541#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 <= ~n~0); {498#false} is VALID [2022-04-27 10:17:04,742 INFO L272 TraceCheckUtils]: 12: Hoare triple {498#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {498#false} is VALID [2022-04-27 10:17:04,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2022-04-27 10:17:04,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2022-04-27 10:17:04,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-04-27 10:17:04,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:04,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:04,878 INFO L290 TraceCheckUtils]: 15: Hoare triple {498#false} assume !false; {498#false} is VALID [2022-04-27 10:17:04,879 INFO L290 TraceCheckUtils]: 14: Hoare triple {498#false} assume 0 == ~cond; {498#false} is VALID [2022-04-27 10:17:04,879 INFO L290 TraceCheckUtils]: 13: Hoare triple {498#false} ~cond := #in~cond; {498#false} is VALID [2022-04-27 10:17:04,879 INFO L272 TraceCheckUtils]: 12: Hoare triple {498#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {498#false} is VALID [2022-04-27 10:17:04,879 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {498#false} is VALID [2022-04-27 10:17:04,880 INFO L290 TraceCheckUtils]: 10: Hoare triple {573#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {569#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:17:04,880 INFO L290 TraceCheckUtils]: 9: Hoare triple {573#(<= (+ 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; {573#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:04,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {573#(<= (+ 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; {573#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:04,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {573#(<= (+ 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); {573#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:04,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {586#(<= 1 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {573#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:04,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {497#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; {586#(<= 1 main_~n~0)} is VALID [2022-04-27 10:17:04,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {497#true} call #t~ret37 := main(); {497#true} is VALID [2022-04-27 10:17:04,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {497#true} {497#true} #214#return; {497#true} is VALID [2022-04-27 10:17:04,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {497#true} assume true; {497#true} is VALID [2022-04-27 10:17:04,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {497#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); {497#true} is VALID [2022-04-27 10:17:04,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {497#true} call ULTIMATE.init(); {497#true} is VALID [2022-04-27 10:17:04,887 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:04,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [182024987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:04,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:04,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 12 [2022-04-27 10:17:04,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042092750] [2022-04-27 10:17:04,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:04,888 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:17:04,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:04,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:04,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:04,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-27 10:17:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:04,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-27 10:17:04,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:17:04,915 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,150 INFO L93 Difference]: Finished difference Result 50 states and 60 transitions. [2022-04-27 10:17:05,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-27 10:17:05,150 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-27 10:17:05,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:05,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 10:17:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 59 transitions. [2022-04-27 10:17:05,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 59 transitions. [2022-04-27 10:17:05,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:05,198 INFO L225 Difference]: With dead ends: 50 [2022-04-27 10:17:05,199 INFO L226 Difference]: Without dead ends: 35 [2022-04-27 10:17:05,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2022-04-27 10:17:05,200 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:05,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 38 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:05,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-27 10:17:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-04-27 10:17:05,214 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:05,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,214 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,214 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,216 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 10:17:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 10:17:05,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:05,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:05,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 10:17:05,217 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 35 states. [2022-04-27 10:17:05,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,219 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-27 10:17:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-27 10:17:05,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:05,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:05,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:05,221 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:05,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-27 10:17:05,222 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 16 [2022-04-27 10:17:05,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:05,222 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-27 10:17:05,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 states have internal predecessors, (27), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,223 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-27 10:17:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:17:05,226 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:05,226 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:05,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:05,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:05,452 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:05,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:05,453 INFO L85 PathProgramCache]: Analyzing trace with hash 260224681, now seen corresponding path program 2 times [2022-04-27 10:17:05,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:05,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973949713] [2022-04-27 10:17:05,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:05,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:05,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {806#(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); {799#true} is VALID [2022-04-27 10:17:05,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:05,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {799#true} {799#true} #214#return; {799#true} is VALID [2022-04-27 10:17:05,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {799#true} call ULTIMATE.init(); {806#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:05,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {806#(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); {799#true} is VALID [2022-04-27 10:17:05,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {799#true} assume true; {799#true} is VALID [2022-04-27 10:17:05,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {799#true} {799#true} #214#return; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {799#true} call #t~ret37 := main(); {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {799#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; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {799#true} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 7: Hoare triple {799#true} 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); {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 8: Hoare triple {799#true} 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; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {799#true} 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; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {799#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {799#true} is VALID [2022-04-27 10:17:05,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {799#true} 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); {799#true} is VALID [2022-04-27 10:17:05,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {799#true} 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; {799#true} is VALID [2022-04-27 10:17:05,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {799#true} 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; {799#true} is VALID [2022-04-27 10:17:05,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {799#true} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {799#true} is VALID [2022-04-27 10:17:05,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {799#true} 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); {799#true} is VALID [2022-04-27 10:17:05,564 INFO L290 TraceCheckUtils]: 16: Hoare triple {799#true} 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; {804#(<= main_~i~0 main_~j~0)} is VALID [2022-04-27 10:17:05,564 INFO L290 TraceCheckUtils]: 17: Hoare triple {804#(<= main_~i~0 main_~j~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; {804#(<= main_~i~0 main_~j~0)} is VALID [2022-04-27 10:17:05,564 INFO L290 TraceCheckUtils]: 18: Hoare triple {804#(<= main_~i~0 main_~j~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {805#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2022-04-27 10:17:05,565 INFO L290 TraceCheckUtils]: 19: Hoare triple {805#(<= (+ main_~i~0 1) main_~j~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); {805#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2022-04-27 10:17:05,565 INFO L290 TraceCheckUtils]: 20: Hoare triple {805#(<= (+ main_~i~0 1) main_~j~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; {800#false} is VALID [2022-04-27 10:17:05,565 INFO L290 TraceCheckUtils]: 21: Hoare triple {800#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; {800#false} is VALID [2022-04-27 10:17:05,566 INFO L290 TraceCheckUtils]: 22: Hoare triple {800#false} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {800#false} is VALID [2022-04-27 10:17:05,566 INFO L290 TraceCheckUtils]: 23: Hoare triple {800#false} assume !(~j~0 <= ~n~0); {800#false} is VALID [2022-04-27 10:17:05,566 INFO L272 TraceCheckUtils]: 24: Hoare triple {800#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {800#false} is VALID [2022-04-27 10:17:05,566 INFO L290 TraceCheckUtils]: 25: Hoare triple {800#false} ~cond := #in~cond; {800#false} is VALID [2022-04-27 10:17:05,566 INFO L290 TraceCheckUtils]: 26: Hoare triple {800#false} assume 0 == ~cond; {800#false} is VALID [2022-04-27 10:17:05,566 INFO L290 TraceCheckUtils]: 27: Hoare triple {800#false} assume !false; {800#false} is VALID [2022-04-27 10:17:05,566 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-27 10:17:05,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:05,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973949713] [2022-04-27 10:17:05,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973949713] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:17:05,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:17:05,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-27 10:17:05,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201896060] [2022-04-27 10:17:05,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:17:05,567 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:17:05,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:05,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:05,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-27 10:17:05,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:05,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-27 10:17:05,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:05,582 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,684 INFO L93 Difference]: Finished difference Result 87 states and 102 transitions. [2022-04-27 10:17:05,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-27 10:17:05,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:17:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:05,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 10:17:05,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-27 10:17:05,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-27 10:17:05,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:05,728 INFO L225 Difference]: With dead ends: 87 [2022-04-27 10:17:05,729 INFO L226 Difference]: Without dead ends: 60 [2022-04-27 10:17:05,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:17:05,731 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:05,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:17:05,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-27 10:17:05,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2022-04-27 10:17:05,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:05,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,747 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,747 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,749 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 10:17:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 10:17:05,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:05,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:05,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-27 10:17:05,751 INFO L87 Difference]: Start difference. First operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-04-27 10:17:05,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:05,754 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-04-27 10:17:05,754 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2022-04-27 10:17:05,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:05,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:05,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:05,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 42 states have (on average 1.1666666666666667) internal successors, (49), 42 states have internal predecessors, (49), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:05,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2022-04-27 10:17:05,756 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 28 [2022-04-27 10:17:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:05,756 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2022-04-27 10:17:05,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:05,757 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2022-04-27 10:17:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-27 10:17:05,757 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:05,757 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:05,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-27 10:17:05,757 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:05,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1312024861, now seen corresponding path program 1 times [2022-04-27 10:17:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:05,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994149527] [2022-04-27 10:17:05,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:05,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:17:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:05,899 INFO L290 TraceCheckUtils]: 0: Hoare triple {1119#(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); {1108#true} is VALID [2022-04-27 10:17:05,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-27 10:17:05,899 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1108#true} {1108#true} #214#return; {1108#true} is VALID [2022-04-27 10:17:05,900 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1119#(and (= |old(#memory_real)| |#memory_real|) (= |old(~#a~0.offset)| |~#a~0.offset|) (= |old(~#b~0.offset)| |~#b~0.offset|) (= |old(~#a~0.base)| |~#a~0.base|) (= |~#b~0.base| |old(~#b~0.base)|) (= |~#x~0.base| |old(~#x~0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~#x~0.offset)| |~#x~0.offset|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:17:05,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {1119#(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); {1108#true} is VALID [2022-04-27 10:17:05,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-27 10:17:05,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #214#return; {1108#true} is VALID [2022-04-27 10:17:05,907 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret37 := main(); {1108#true} is VALID [2022-04-27 10:17:05,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#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; {1113#(= (+ main_~n~0 (- 5)) 0)} is VALID [2022-04-27 10:17:05,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {1113#(= (+ main_~n~0 (- 5)) 0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1114#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,908 INFO L290 TraceCheckUtils]: 7: Hoare triple {1114#(and (= main_~j~0 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); {1114#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {1114#(and (= main_~j~0 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; {1114#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,909 INFO L290 TraceCheckUtils]: 9: Hoare triple {1114#(and (= main_~j~0 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; {1114#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {1114#(and (= main_~j~0 0) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {1115#(and (<= main_~j~0 1) (= (+ 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); {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,927 INFO L290 TraceCheckUtils]: 13: Hoare triple {1115#(and (<= main_~j~0 1) (= (+ 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; {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,927 INFO L290 TraceCheckUtils]: 14: Hoare triple {1115#(and (<= main_~j~0 1) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {1116#(and (<= main_~j~0 2) (= (+ 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); {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} assume !(~i~0 == ~j~0); {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,929 INFO L290 TraceCheckUtils]: 17: Hoare triple {1116#(and (<= main_~j~0 2) (= (+ 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; {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {1116#(and (<= main_~j~0 2) (= (+ main_~n~0 (- 5)) 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,930 INFO L290 TraceCheckUtils]: 19: Hoare triple {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} 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); {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,930 INFO L290 TraceCheckUtils]: 20: Hoare triple {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,930 INFO L290 TraceCheckUtils]: 21: Hoare triple {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} 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; {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:05,931 INFO L290 TraceCheckUtils]: 22: Hoare triple {1117#(and (= (+ main_~n~0 (- 5)) 0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1118#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} is VALID [2022-04-27 10:17:05,931 INFO L290 TraceCheckUtils]: 23: Hoare triple {1118#(and (<= main_~j~0 4) (= (+ main_~n~0 (- 5)) 0))} assume !(~j~0 <= ~n~0); {1109#false} is VALID [2022-04-27 10:17:05,931 INFO L272 TraceCheckUtils]: 24: Hoare triple {1109#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1109#false} is VALID [2022-04-27 10:17:05,931 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#false} ~cond := #in~cond; {1109#false} is VALID [2022-04-27 10:17:05,931 INFO L290 TraceCheckUtils]: 26: Hoare triple {1109#false} assume 0 == ~cond; {1109#false} is VALID [2022-04-27 10:17:05,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-27 10:17:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:17:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994149527] [2022-04-27 10:17:05,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994149527] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:17:05,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271406846] [2022-04-27 10:17:05,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:05,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:05,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:17:05,964 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-27 10:17:05,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-27 10:17:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:06,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-27 10:17:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:17:06,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:17:06,258 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2022-04-27 10:17:06,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#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); {1108#true} is VALID [2022-04-27 10:17:06,259 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-27 10:17:06,259 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #214#return; {1108#true} is VALID [2022-04-27 10:17:06,259 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret37 := main(); {1108#true} is VALID [2022-04-27 10:17:06,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#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; {1138#(<= 5 main_~n~0)} is VALID [2022-04-27 10:17:06,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(<= 5 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1142#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:06,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {1142#(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); {1142#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:06,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {1142#(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; {1142#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:06,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {1142#(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; {1142#(and (<= 5 main_~n~0) (<= main_~j~0 0))} is VALID [2022-04-27 10:17:06,261 INFO L290 TraceCheckUtils]: 10: Hoare triple {1142#(and (<= 5 main_~n~0) (<= main_~j~0 0))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:06,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {1155#(and (<= 5 main_~n~0) (<= main_~j~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); {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:06,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} assume !(~i~0 == ~j~0); {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:06,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {1155#(and (<= 5 main_~n~0) (<= main_~j~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; {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} is VALID [2022-04-27 10:17:06,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {1155#(and (<= 5 main_~n~0) (<= main_~j~0 1))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:06,263 INFO L290 TraceCheckUtils]: 15: Hoare triple {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} 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); {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:06,264 INFO L290 TraceCheckUtils]: 16: Hoare triple {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} assume !(~i~0 == ~j~0); {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:06,264 INFO L290 TraceCheckUtils]: 17: Hoare triple {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} 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; {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} is VALID [2022-04-27 10:17:06,264 INFO L290 TraceCheckUtils]: 18: Hoare triple {1168#(and (<= 5 main_~n~0) (<= main_~j~0 2))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:06,265 INFO L290 TraceCheckUtils]: 19: Hoare triple {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} 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); {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:06,265 INFO L290 TraceCheckUtils]: 20: Hoare triple {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} assume !(~i~0 == ~j~0); {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:06,266 INFO L290 TraceCheckUtils]: 21: Hoare triple {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} 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; {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} is VALID [2022-04-27 10:17:06,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {1181#(and (<= 5 main_~n~0) (<= main_~j~0 3))} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1194#(and (<= 5 main_~n~0) (<= main_~j~0 4))} is VALID [2022-04-27 10:17:06,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {1194#(and (<= 5 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 <= ~n~0); {1109#false} is VALID [2022-04-27 10:17:06,266 INFO L272 TraceCheckUtils]: 24: Hoare triple {1109#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1109#false} is VALID [2022-04-27 10:17:06,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#false} ~cond := #in~cond; {1109#false} is VALID [2022-04-27 10:17:06,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {1109#false} assume 0 == ~cond; {1109#false} is VALID [2022-04-27 10:17:06,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-27 10:17:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:06,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:17:06,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2022-04-27 10:17:06,430 INFO L290 TraceCheckUtils]: 26: Hoare triple {1109#false} assume 0 == ~cond; {1109#false} is VALID [2022-04-27 10:17:06,431 INFO L290 TraceCheckUtils]: 25: Hoare triple {1109#false} ~cond := #in~cond; {1109#false} is VALID [2022-04-27 10:17:06,431 INFO L272 TraceCheckUtils]: 24: Hoare triple {1109#false} call __VERIFIER_assert((if 2 == ~i~0 then 1 else 0)); {1109#false} is VALID [2022-04-27 10:17:06,431 INFO L290 TraceCheckUtils]: 23: Hoare triple {1222#(<= main_~j~0 main_~n~0)} assume !(~j~0 <= ~n~0); {1109#false} is VALID [2022-04-27 10:17:06,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {1226#(<= (+ main_~j~0 1) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1222#(<= main_~j~0 main_~n~0)} is VALID [2022-04-27 10:17:06,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {1226#(<= (+ 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; {1226#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:06,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {1226#(<= (+ main_~j~0 1) main_~n~0)} assume !(~i~0 == ~j~0); {1226#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:06,433 INFO L290 TraceCheckUtils]: 19: Hoare triple {1226#(<= (+ 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); {1226#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:06,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {1239#(<= (+ main_~j~0 2) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1226#(<= (+ main_~j~0 1) main_~n~0)} is VALID [2022-04-27 10:17:06,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {1239#(<= (+ main_~j~0 2) 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; {1239#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:06,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {1239#(<= (+ main_~j~0 2) main_~n~0)} assume !(~i~0 == ~j~0); {1239#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:06,434 INFO L290 TraceCheckUtils]: 15: Hoare triple {1239#(<= (+ main_~j~0 2) 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); {1239#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:06,435 INFO L290 TraceCheckUtils]: 14: Hoare triple {1252#(<= (+ main_~j~0 3) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1239#(<= (+ main_~j~0 2) main_~n~0)} is VALID [2022-04-27 10:17:06,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {1252#(<= (+ main_~j~0 3) 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; {1252#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:06,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {1252#(<= (+ main_~j~0 3) main_~n~0)} assume !(~i~0 == ~j~0); {1252#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:06,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {1252#(<= (+ main_~j~0 3) 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); {1252#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:06,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {1265#(<= (+ main_~j~0 4) main_~n~0)} #t~post5 := ~j~0;~j~0 := 1 + #t~post5;havoc #t~post5; {1252#(<= (+ main_~j~0 3) main_~n~0)} is VALID [2022-04-27 10:17:06,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#(<= (+ main_~j~0 4) 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; {1265#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:06,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#(<= (+ main_~j~0 4) 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; {1265#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:06,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(<= (+ main_~j~0 4) 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); {1265#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:06,438 INFO L290 TraceCheckUtils]: 6: Hoare triple {1278#(<= 4 main_~n~0)} assume !!(~i~0 <= ~n~0);~w~0 := 0.0;~j~0 := 0; {1265#(<= (+ main_~j~0 4) main_~n~0)} is VALID [2022-04-27 10:17:06,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {1108#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; {1278#(<= 4 main_~n~0)} is VALID [2022-04-27 10:17:06,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret37 := main(); {1108#true} is VALID [2022-04-27 10:17:06,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #214#return; {1108#true} is VALID [2022-04-27 10:17:06,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2022-04-27 10:17:06,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#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); {1108#true} is VALID [2022-04-27 10:17:06,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2022-04-27 10:17:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:17:06,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271406846] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:17:06,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:17:06,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 21 [2022-04-27 10:17:06,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112140169] [2022-04-27 10:17:06,439 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:17:06,439 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:17:06,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:17:06,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:06,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-27 10:17:06,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:17:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-27 10:17:06,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=270, Unknown=0, NotChecked=0, Total=420 [2022-04-27 10:17:06,491 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,803 INFO L93 Difference]: Finished difference Result 108 states and 126 transitions. [2022-04-27 10:17:06,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-27 10:17:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-04-27 10:17:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:17:06,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-27 10:17:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 68 transitions. [2022-04-27 10:17:06,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 68 transitions. [2022-04-27 10:17:06,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:17:06,854 INFO L225 Difference]: With dead ends: 108 [2022-04-27 10:17:06,854 INFO L226 Difference]: Without dead ends: 66 [2022-04-27 10:17:06,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:17:06,855 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 104 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:17:06,855 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 64 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:17:06,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-27 10:17:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-04-27 10:17:06,870 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:17:06,870 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:06,870 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:06,871 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:06,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,872 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 10:17:06,872 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 10:17:06,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:06,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:06,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-27 10:17:06,873 INFO L87 Difference]: Start difference. First operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-04-27 10:17:06,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:17:06,874 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2022-04-27 10:17:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2022-04-27 10:17:06,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:17:06,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:17:06,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:17:06,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:17:06,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-27 10:17:06,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 72 transitions. [2022-04-27 10:17:06,876 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 72 transitions. Word has length 28 [2022-04-27 10:17:06,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:17:06,876 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 72 transitions. [2022-04-27 10:17:06,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 3.0) internal successors, (63), 20 states have internal predecessors, (63), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:17:06,876 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 72 transitions. [2022-04-27 10:17:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-27 10:17:06,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:17:06,877 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:17:06,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-27 10:17:07,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:17:07,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:17:07,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:17:07,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1975029803, now seen corresponding path program 2 times [2022-04-27 10:17:07,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:17:07,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029611800] [2022-04-27 10:17:07,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:17:07,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:17:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:17:07,125 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-27 10:17:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-27 10:17:07,158 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-27 10:17:07,158 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-27 10:17:07,159 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-27 10:17:07,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-27 10:17:07,162 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-27 10:17:07,165 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: ludcmpENTRY has no Hoare annotation [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: fabsENTRY has no Hoare annotation [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:17:07,191 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L93-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L6 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: ludcmpFINAL has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L118-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L80-2 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L93-4 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L96-3 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L6-2 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: ludcmpEXIT has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L118-4 has no Hoare annotation [2022-04-27 10:17:07,192 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L120 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: fabsFINAL has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L96-4 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L99 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L138-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L120-1 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: fabsEXIT has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L138-4 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L141-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L121-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L93-2 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L96-2 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L146-3 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L141-4 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L141-2 has no Hoare annotation [2022-04-27 10:17:07,193 WARN L170 areAnnotationChecker]: L121-4 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L146-4 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L149-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L129-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L125-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L124-1 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L149-4 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L149-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L118-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L132-3 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L125-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L121-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L146-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L132-4 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L132-2 has no Hoare annotation [2022-04-27 10:17:07,194 WARN L170 areAnnotationChecker]: L129-2 has no Hoare annotation [2022-04-27 10:17:07,194 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-27 10:17:07,195 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.04 10:17:07 BoogieIcfgContainer [2022-04-27 10:17:07,195 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-27 10:17:07,196 INFO L158 Benchmark]: Toolchain (without parser) took 4850.98ms. Allocated memory was 210.8MB in the beginning and 270.5MB in the end (delta: 59.8MB). Free memory was 160.2MB in the beginning and 203.7MB in the end (delta: -43.5MB). Peak memory consumption was 16.9MB. Max. memory is 8.0GB. [2022-04-27 10:17:07,196 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 177.2MB in the beginning and 177.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-27 10:17:07,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 245.42ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 183.1MB in the end (delta: -23.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. [2022-04-27 10:17:07,196 INFO L158 Benchmark]: Boogie Preprocessor took 55.88ms. Allocated memory is still 210.8MB. Free memory was 183.1MB in the beginning and 180.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-27 10:17:07,196 INFO L158 Benchmark]: RCFGBuilder took 448.76ms. Allocated memory is still 210.8MB. Free memory was 180.4MB in the beginning and 160.7MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. [2022-04-27 10:17:07,197 INFO L158 Benchmark]: TraceAbstraction took 4093.90ms. Allocated memory was 210.8MB in the beginning and 270.5MB in the end (delta: 59.8MB). Free memory was 160.2MB in the beginning and 203.7MB in the end (delta: -43.5MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. [2022-04-27 10:17:07,197 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 210.8MB. Free memory was 177.2MB in the beginning and 177.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 245.42ms. Allocated memory is still 210.8MB. Free memory was 160.0MB in the beginning and 183.1MB in the end (delta: -23.1MB). Peak memory consumption was 14.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 55.88ms. Allocated memory is still 210.8MB. Free memory was 183.1MB in the beginning and 180.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.76ms. Allocated memory is still 210.8MB. Free memory was 180.4MB in the beginning and 160.7MB in the end (delta: 19.7MB). Peak memory consumption was 19.9MB. Max. memory is 8.0GB. * TraceAbstraction took 4093.90ms. Allocated memory was 210.8MB in the beginning and 270.5MB in the end (delta: 59.8MB). Free memory was 160.2MB in the beginning and 203.7MB in the end (delta: -43.5MB). Peak memory consumption was 16.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 7]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_real at line 98, overapproximation of someBinaryArithmeticDOUBLEoperation at line 100. Possible FailurePath: [L71] double a[50][50], b[50], x[50]; VAL [\old(a)=20019, \old(a)=20005, \old(b)=20002, \old(b)=20014, \old(x)=20011, \old(x)=20017, a={4:0}, b={5:0}, x={6:0}] [L88] int i, j, nmax = 50, n = 5, chkerr; [L89] double eps, w; [L91] eps = 1.0e-6 [L93] i = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, n=5, nmax=50, x={6:0}] [L93] COND TRUE i <= n [L95] w = 0.0 [L96] j = 0 VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=0, n=5, nmax=50, w=0, x={6:0}] [L99] COND TRUE i == j [L99] EXPR a[i][j] [L99] a[i][j] *= 10.0 [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=1, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=2, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=3, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=4, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L96] COND TRUE j <= n [L98] a[i][j] = (i + 1) + (j + 1) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L99] COND FALSE !(i == j) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=5, n=5, nmax=50, x={6:0}] [L100] EXPR a[i][j] [L100] w += a[i][j] [L96] j++ VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L96] COND FALSE !(j <= n) VAL [a={4:0}, b={5:0}, eps=1/1000000, i=0, j=6, n=5, nmax=50, x={6:0}] [L102] CALL __VERIFIER_assert(i==2) VAL [\old(cond)=0, a={4:0}, b={5:0}, x={6:0}] [L6] COND TRUE !(cond) VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] [L7] reach_error() VAL [\old(cond)=0, a={4:0}, b={5:0}, cond=0, x={6:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 6, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 243 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 237 mSDsluCounter, 226 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 93 mSDsCounter, 64 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 313 IncrementalHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 64 mSolverCounterUnsat, 133 mSDtfsCounter, 313 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=64occurred in iteration=0, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 175 ConstructedInterpolants, 0 QuantifiedInterpolants, 742 SizeOfPredicates, 4 NumberOfNonLiveVariables, 327 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 28/115 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-04-27 10:17:07,230 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...