./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:22:28,564 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:22:28,565 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:22:28,590 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:22:28,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:22:28,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:22:28,598 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:22:28,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:22:28,603 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:22:28,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:22:28,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:22:28,612 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:22:28,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:22:28,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:22:28,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:22:28,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:22:28,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:22:28,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:22:28,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:22:28,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:22:28,627 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:22:28,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:22:28,630 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:22:28,631 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:22:28,632 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:22:28,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:22:28,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:22:28,650 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:22:28,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:22:28,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:22:28,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:22:28,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:22:28,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:22:28,655 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:22:28,656 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:22:28,657 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:22:28,657 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:22:28,658 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:22:28,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:22:28,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:22:28,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:22:28,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:22:28,665 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-21 01:22:28,699 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:22:28,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:22:28,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:22:28,701 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:22:28,701 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:22:28,701 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:22:28,702 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:22:28,702 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:22:28,703 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:22:28,703 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:22:28,704 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:22:28,704 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 01:22:28,704 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:22:28,704 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:22:28,705 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:22:28,705 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:22:28,705 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:22:28,705 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:22:28,706 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:22:28,706 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:22:28,706 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:22:28,706 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:22:28,707 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:22:28,707 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:22:28,707 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:22:28,707 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:22:28,708 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:22:28,708 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:22:28,708 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 01:22:28,708 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 01:22:28,709 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:22:28,709 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:22:28,709 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:22:28,709 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2022-07-21 01:22:29,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:22:29,032 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:22:29,034 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:22:29,035 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:22:29,037 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:22:29,039 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-21 01:22:29,105 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f825af3/dd535403327a4829a48bc88a822495f6/FLAG07cda8efe [2022-07-21 01:22:29,524 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:22:29,525 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-21 01:22:29,530 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f825af3/dd535403327a4829a48bc88a822495f6/FLAG07cda8efe [2022-07-21 01:22:29,941 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11f825af3/dd535403327a4829a48bc88a822495f6 [2022-07-21 01:22:29,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:22:29,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:22:29,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:22:29,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:22:29,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:22:29,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:22:29" (1/1) ... [2022-07-21 01:22:29,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d49fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:29, skipping insertion in model container [2022-07-21 01:22:29,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:22:29" (1/1) ... [2022-07-21 01:22:29,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:22:29,973 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:22:30,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2022-07-21 01:22:30,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:22:30,142 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:22:30,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2022-07-21 01:22:30,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:22:30,197 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:22:30,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30 WrapperNode [2022-07-21 01:22:30,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:22:30,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:22:30,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:22:30,200 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:22:30,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,232 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-07-21 01:22:30,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:22:30,233 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:22:30,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:22:30,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:22:30,240 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,240 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,248 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,267 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:22:30,272 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:22:30,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:22:30,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:22:30,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (1/1) ... [2022-07-21 01:22:30,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:22:30,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:22:30,313 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-07-21 01:22:30,343 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-07-21 01:22:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:22:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 01:22:30,357 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:22:30,357 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:22:30,418 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:22:30,420 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:22:30,561 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:22:30,565 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:22:30,566 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 01:22:30,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:22:30 BoogieIcfgContainer [2022-07-21 01:22:30,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:22:30,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:22:30,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:22:30,581 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:22:30,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:22:29" (1/3) ... [2022-07-21 01:22:30,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f13d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:22:30, skipping insertion in model container [2022-07-21 01:22:30,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:30" (2/3) ... [2022-07-21 01:22:30,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52f13d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:22:30, skipping insertion in model container [2022-07-21 01:22:30,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:22:30" (3/3) ... [2022-07-21 01:22:30,589 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2022-07-21 01:22:30,611 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:22:30,615 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:22:30,665 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:22:30,677 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@7e9ab1f5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@62732b07 [2022-07-21 01:22:30,678 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:22:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:22:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:22:30,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:22:30,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:22:30,689 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:22:30,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:22:30,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2022-07-21 01:22:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 01:22:30,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040367421] [2022-07-21 01:22:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:22:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 01:22:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:22:30,807 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-21 01:22:30,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-21 01:22:30,856 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-21 01:22:30,859 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-21 01:22:30,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-21 01:22:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 01:22:30,865 INFO L356 BasicCegarLoop]: Path program histogram: [1] [2022-07-21 01:22:30,869 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-21 01:22:30,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.07 01:22:30 BoogieIcfgContainer [2022-07-21 01:22:30,894 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-21 01:22:30,895 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-21 01:22:30,896 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-21 01:22:30,896 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-21 01:22:30,896 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:22:30" (3/4) ... [2022-07-21 01:22:30,898 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-21 01:22:30,898 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-21 01:22:30,900 INFO L158 Benchmark]: Toolchain (without parser) took 955.20ms. Allocated memory was 50.3MB in the beginning and 69.2MB in the end (delta: 18.9MB). Free memory was 27.3MB in the beginning and 40.5MB in the end (delta: -13.2MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-21 01:22:30,901 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:22:30,902 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.26ms. Allocated memory was 50.3MB in the beginning and 69.2MB in the end (delta: 18.9MB). Free memory was 27.1MB in the beginning and 52.2MB in the end (delta: -25.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-21 01:22:30,903 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.02ms. Allocated memory is still 69.2MB. Free memory was 52.2MB in the beginning and 50.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:22:30,907 INFO L158 Benchmark]: Boogie Preprocessor took 37.95ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 49.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:22:30,908 INFO L158 Benchmark]: RCFGBuilder took 301.27ms. Allocated memory is still 69.2MB. Free memory was 49.5MB in the beginning and 40.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 01:22:30,909 INFO L158 Benchmark]: TraceAbstraction took 319.13ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 40.8MB in the end (delta: -1.3MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-07-21 01:22:30,910 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 40.5MB in the end (delta: 308.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:22:30,916 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 50.3MB. Free memory was 31.1MB in the beginning and 31.1MB in the end (delta: 37.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 251.26ms. Allocated memory was 50.3MB in the beginning and 69.2MB in the end (delta: 18.9MB). Free memory was 27.1MB in the beginning and 52.2MB in the end (delta: -25.1MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.02ms. Allocated memory is still 69.2MB. Free memory was 52.2MB in the beginning and 50.7MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 37.95ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 49.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 301.27ms. Allocated memory is still 69.2MB. Free memory was 49.5MB in the beginning and 40.2MB in the end (delta: 9.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 319.13ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 40.8MB in the end (delta: -1.3MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 69.2MB. Free memory was 40.8MB in the beginning and 40.5MB in the end (delta: 308.9kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 32, overapproximation of someBinaryArithmeticDOUBLEoperation at line 44. Possible FailurePath: [L22] double _EPS = 1e-6; VAL [_EPS=1/1000000] [L49] double d, r; [L51] d = 1. VAL [_EPS=1/1000000, d=1] [L51] COND TRUE d <= 20. [L53] CALL, EXPR SqrtR(d) [L26] double xn, xnp1, residu, lsup, linf; [L27] int i, cond; VAL [\old(Input)=1, _EPS=1/1000000, Input=1] [L28] COND TRUE Input <= 1.0 [L28] xn = 1.0 VAL [\old(Input)=1, _EPS=1/1000000, Input=1, xn=1] [L29] xnp1 = xn [L30] residu = 2.0*_EPS*(xn+xnp1) [L31] lsup = _EPS * (xn+xnp1) [L32] linf = -lsup [L33] cond = ((residu > lsup) || (residu < linf)) [L34] i = 0 VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L35] COND FALSE !(\read(cond)) VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L44] return 1.0 / xnp1; VAL [\old(Input)=1, _EPS=1/1000000, cond=0, i=0, Input=1, xn=1, xn=1] [L53] RET, EXPR SqrtR(d) [L53] r = SqrtR(d) [L55] CALL __VERIFIER_assert(r >= 1.0 && r <= 5.0) [L20] COND TRUE !(cond) VAL [\old(cond)=0, _EPS=1/1000000, cond=0] [L20] reach_error() VAL [\old(cond)=0, _EPS=1/1000000, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.2s, OverallIterations: 1, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 10 NumberOfCodeBlocks, 10 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 PerfectInterpolantSequences, 0/0 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-07-21 01:22:30,959 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 01:22:32,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 01:22:32,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 01:22:32,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 01:22:32,868 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 01:22:32,869 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 01:22:32,873 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 01:22:32,876 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 01:22:32,877 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 01:22:32,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 01:22:32,882 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 01:22:32,887 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 01:22:32,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 01:22:32,889 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 01:22:32,890 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 01:22:32,893 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 01:22:32,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 01:22:32,895 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 01:22:32,896 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 01:22:32,901 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 01:22:32,903 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 01:22:32,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 01:22:32,905 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 01:22:32,906 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 01:22:32,907 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 01:22:32,914 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 01:22:32,914 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 01:22:32,914 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 01:22:32,915 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 01:22:32,916 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 01:22:32,917 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 01:22:32,917 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 01:22:32,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 01:22:32,919 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 01:22:32,920 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 01:22:32,921 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 01:22:32,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 01:22:32,922 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 01:22:32,922 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 01:22:32,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 01:22:32,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 01:22:32,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 01:22:32,930 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-21 01:22:32,961 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 01:22:32,962 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 01:22:32,962 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 01:22:32,963 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 01:22:32,963 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 01:22:32,964 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 01:22:32,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 01:22:32,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 01:22:32,965 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 01:22:32,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 01:22:32,966 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 01:22:32,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 01:22:32,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 01:22:32,966 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 01:22:32,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 01:22:32,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 01:22:32,967 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 01:22:32,967 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-21 01:22:32,967 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-21 01:22:32,968 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 01:22:32,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 01:22:32,968 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 01:22:32,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 01:22:32,968 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 01:22:32,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 01:22:32,969 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 01:22:32,969 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:22:32,969 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 01:22:32,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 01:22:32,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 01:22:32,970 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-21 01:22:32,970 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-21 01:22:32,970 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 01:22:32,971 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 01:22:32,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 01:22:32,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-21 01:22:32,971 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 736ab1a5e950f94d10703cde0979d12465a57eb1332dc067f0dbd06f88e9370a [2022-07-21 01:22:33,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 01:22:33,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 01:22:33,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 01:22:33,327 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 01:22:33,327 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 01:22:33,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-21 01:22:33,381 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662cf2ff4/c9cd6bef39e749b593a3fe59043bbf61/FLAG025665aed [2022-07-21 01:22:33,778 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 01:22:33,779 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c [2022-07-21 01:22:33,785 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662cf2ff4/c9cd6bef39e749b593a3fe59043bbf61/FLAG025665aed [2022-07-21 01:22:34,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/662cf2ff4/c9cd6bef39e749b593a3fe59043bbf61 [2022-07-21 01:22:34,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 01:22:34,192 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 01:22:34,194 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 01:22:34,194 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 01:22:34,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 01:22:34,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254e3849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34, skipping insertion in model container [2022-07-21 01:22:34,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,208 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 01:22:34,219 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 01:22:34,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2022-07-21 01:22:34,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:22:34,350 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 01:22:34,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_Householder_constant.c[831,844] [2022-07-21 01:22:34,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 01:22:34,389 INFO L208 MainTranslator]: Completed translation [2022-07-21 01:22:34,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34 WrapperNode [2022-07-21 01:22:34,389 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 01:22:34,390 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 01:22:34,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 01:22:34,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 01:22:34,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,439 INFO L137 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2022-07-21 01:22:34,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 01:22:34,441 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 01:22:34,441 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 01:22:34,441 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 01:22:34,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,478 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 01:22:34,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 01:22:34,488 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 01:22:34,488 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 01:22:34,489 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (1/1) ... [2022-07-21 01:22:34,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 01:22:34,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 01:22:34,516 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-07-21 01:22:34,543 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-07-21 01:22:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 01:22:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-21 01:22:34,560 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 01:22:34,561 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 01:22:34,626 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 01:22:34,628 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 01:22:43,715 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 01:22:43,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 01:22:43,720 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-21 01:22:43,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:22:43 BoogieIcfgContainer [2022-07-21 01:22:43,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 01:22:43,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 01:22:43,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 01:22:43,725 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 01:22:43,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:22:34" (1/3) ... [2022-07-21 01:22:43,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b03b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:22:43, skipping insertion in model container [2022-07-21 01:22:43,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:22:34" (2/3) ... [2022-07-21 01:22:43,727 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13b03b2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:22:43, skipping insertion in model container [2022-07-21 01:22:43,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:22:43" (3/3) ... [2022-07-21 01:22:43,728 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_Householder_constant.c [2022-07-21 01:22:43,739 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 01:22:43,740 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-21 01:22:43,781 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 01:22:43,791 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@5d65287f, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2a47997b [2022-07-21 01:22:43,796 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-21 01:22:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:22:43,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:22:43,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:22:43,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:22:43,806 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:22:43,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:22:43,810 INFO L85 PathProgramCache]: Analyzing trace with hash -1706227183, now seen corresponding path program 1 times [2022-07-21 01:22:43,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:22:43,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67860661] [2022-07-21 01:22:43,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:22:43,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:22:43,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:22:43,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:22:43,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-21 01:22:44,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:22:44,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 01:22:44,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:22:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:22:45,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:22:45,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:22:45,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67860661] [2022-07-21 01:22:45,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67860661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:22:45,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:22:45,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:22:45,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577581224] [2022-07-21 01:22:45,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:22:45,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 01:22:45,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:22:45,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 01:22:45,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:22:45,927 INFO L87 Difference]: Start difference. First operand has 17 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:22:48,662 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:22:51,008 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:22:53,898 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:22:56,799 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:22:57,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:22:57,190 INFO L93 Difference]: Finished difference Result 40 states and 54 transitions. [2022-07-21 01:22:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 01:22:57,195 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 01:22:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:22:57,199 INFO L225 Difference]: With dead ends: 40 [2022-07-21 01:22:57,200 INFO L226 Difference]: Without dead ends: 17 [2022-07-21 01:22:57,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:22:57,204 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 5 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.2s IncrementalHoareTripleChecker+Time [2022-07-21 01:22:57,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 4 Unknown, 0 Unchecked, 11.2s Time] [2022-07-21 01:22:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-21 01:22:57,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-21 01:22:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:22:57,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2022-07-21 01:22:57,226 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 20 transitions. Word has length 10 [2022-07-21 01:22:57,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:22:57,227 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 20 transitions. [2022-07-21 01:22:57,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:22:57,227 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 20 transitions. [2022-07-21 01:22:57,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-21 01:22:57,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:22:57,227 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:22:57,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-21 01:22:57,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:22:57,432 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:22:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:22:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 68780179, now seen corresponding path program 1 times [2022-07-21 01:22:57,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:22:57,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315358391] [2022-07-21 01:22:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:22:57,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:22:57,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:22:57,436 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:22:57,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-21 01:22:58,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:22:59,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-21 01:22:59,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:22:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:22:59,344 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 01:22:59,344 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:22:59,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315358391] [2022-07-21 01:22:59,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315358391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 01:22:59,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 01:22:59,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 01:22:59,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280595253] [2022-07-21 01:22:59,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 01:22:59,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 01:22:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:22:59,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 01:22:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 01:22:59,347 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:23:01,773 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:04,624 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.85s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:06,627 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:09,540 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.91s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:11,548 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:14,495 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:16,513 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:23:16,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:23:16,514 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2022-07-21 01:23:16,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 01:23:16,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-21 01:23:16,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:23:16,709 INFO L225 Difference]: With dead ends: 28 [2022-07-21 01:23:16,709 INFO L226 Difference]: Without dead ends: 17 [2022-07-21 01:23:16,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 01:23:16,711 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 3 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-07-21 01:23:16,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 7 Unknown, 0 Unchecked, 17.0s Time] [2022-07-21 01:23:16,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-21 01:23:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-21 01:23:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:23:16,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-07-21 01:23:16,715 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 10 [2022-07-21 01:23:16,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:23:16,715 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-07-21 01:23:16,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:23:16,716 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-07-21 01:23:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 01:23:16,716 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:23:16,716 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:23:16,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-21 01:23:16,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:23:16,917 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:23:16,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:23:16,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1301780435, now seen corresponding path program 1 times [2022-07-21 01:23:16,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:23:16,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500237167] [2022-07-21 01:23:16,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 01:23:16,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:23:16,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:23:16,920 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:23:16,921 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-21 01:23:19,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 01:23:19,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-21 01:23:19,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:23:23,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 01:23:23,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:23:35,649 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-21 01:23:37,851 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-21 01:23:53,353 WARN L233 SmtUtils]: Spent 6.00s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:23:59,216 WARN L233 SmtUtils]: Spent 5.86s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:01,789 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-21 01:24:04,348 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-21 01:24:10,243 WARN L233 SmtUtils]: Spent 5.89s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:16,149 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:21,429 WARN L233 SmtUtils]: Spent 5.28s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:26,676 WARN L233 SmtUtils]: Spent 5.25s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:29,039 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2022-07-21 01:24:31,399 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2022-07-21 01:24:36,661 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:41,918 WARN L233 SmtUtils]: Spent 5.26s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:24:44,294 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from false [2022-07-21 01:24:46,672 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1)))) is different from true [2022-07-21 01:24:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-21 01:24:46,699 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:24:46,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500237167] [2022-07-21 01:24:46,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500237167] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 01:24:46,703 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-21 01:24:46,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2022-07-21 01:24:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436050226] [2022-07-21 01:24:46,704 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-21 01:24:46,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 01:24:46,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-21 01:24:46,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 01:24:46,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=83, Unknown=8, NotChecked=84, Total=210 [2022-07-21 01:24:46,706 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:24:48,932 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:51,259 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:24:54,223 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_main_~d~0#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_main_~d~0#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_main_~d~0#1|) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:24:56,646 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-07-21 01:24:59,002 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (fp.geq .cse0 .cse1) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:25:01,525 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from false [2022-07-21 01:25:04,177 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (= .cse1 |c_ULTIMATE.start_SqrtR_~Input#1|) (= .cse1 |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:25:14,827 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode .cse1 .cse1) .cse1) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) .cse1) .cse1) .cse1))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xnp1~0#1|) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0)) (= c_currentRoundingMode roundNearestTiesToEven)))) is different from true [2022-07-21 01:25:17,723 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.90s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:22,057 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:24,374 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.32s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:27,470 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:29,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:31,971 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-21 01:25:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 01:25:32,936 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-07-21 01:25:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 01:25:32,940 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 01:25:32,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 01:25:32,942 INFO L225 Difference]: With dead ends: 29 [2022-07-21 01:25:32,942 INFO L226 Difference]: Without dead ends: 27 [2022-07-21 01:25:32,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 46.1s TimeCoverageRelationStatistics Valid=56, Invalid=118, Unknown=14, NotChecked=232, Total=420 [2022-07-21 01:25:32,943 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 19 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 22.5s IncrementalHoareTripleChecker+Time [2022-07-21 01:25:32,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 8 Unknown, 75 Unchecked, 22.5s Time] [2022-07-21 01:25:32,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-21 01:25:32,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-07-21 01:25:32,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:25:32,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-07-21 01:25:32,948 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 11 [2022-07-21 01:25:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 01:25:32,948 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-07-21 01:25:32,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.4) internal successors, (21), 15 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 01:25:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-07-21 01:25:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 01:25:32,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 01:25:32,949 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 01:25:33,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-21 01:25:33,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:25:33,156 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-21 01:25:33,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 01:25:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1648833135, now seen corresponding path program 2 times [2022-07-21 01:25:33,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-21 01:25:33,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [591050093] [2022-07-21 01:25:33,157 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 01:25:33,157 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-21 01:25:33,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-21 01:25:33,163 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-21 01:25:33,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-21 01:25:37,140 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 01:25:37,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 01:25:37,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-21 01:25:37,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 01:25:48,572 WARN L233 SmtUtils]: Spent 5.13s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:25:50,747 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= .cse0 |c_ULTIMATE.start_SqrtR_~Input#1|) (= (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode .cse0 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| .cse0) .cse0) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) .cse0) .cse0))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0)) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2022-07-21 01:25:54,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 01:25:54,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 01:26:07,435 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-21 01:26:09,633 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 |c_ULTIMATE.start_SqrtR_~xnp1~0#1|))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-21 01:26:25,187 WARN L233 SmtUtils]: Spent 6.02s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:26:31,218 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 927] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-21 01:26:33,819 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from false [2022-07-21 01:26:36,426 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (let ((.cse0 (fp.div c_currentRoundingMode .cse1 (fp.div c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~xn~0#1| (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 15.0) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode |c_ULTIMATE.start_SqrtR_~Input#1| |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode 10.0)) (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 3.0) |c_ULTIMATE.start_SqrtR_~Input#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|) |c_ULTIMATE.start_SqrtR_~xn~0#1|))))) ((_ to_fp 11 53) c_currentRoundingMode 8.0))))) (and (fp.geq .cse0 .cse1) (fp.leq .cse0 ((_ to_fp 11 53) c_currentRoundingMode 5.0))))) is different from true [2022-07-21 01:26:38,105 WARN L230 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2022-07-21 01:26:38,107 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 101 [2022-07-21 01:26:38,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-21 01:26:38,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [591050093] [2022-07-21 01:26:38,108 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-21 01:26:38,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-21 01:26:38,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-21 01:26:38,309 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseSuccess(Executor.java:258) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.push(Scriptor.java:133) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.push(DiffWrapperScript.java:90) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.push(HistoryRecordingScript.java:107) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.push(WrapperScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.UndoableWrapperScript.push(UndoableWrapperScript.java:54) at de.uni_freiburg.informatik.ultimate.logic.Util.checkSat(Util.java:48) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.getRedundancy(SimplifyDDA.java:620) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getRedundancy(SimplifyDDAWithTimeout.java:120) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA$Simplifier.walk(SimplifyDDA.java:370) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.logic.simplification.SimplifyDDA.simplifyOnce(SimplifyDDA.java:649) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.simplify.SimplifyDDAWithTimeout.getSimplifiedTerm(SimplifyDDAWithTimeout.java:180) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplify(SmtUtils.java:198) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.SmtUtils.simplifyWithStatistics(SmtUtils.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify(QuantifierPusher.java:927) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:120) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1465) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:658) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:239) ... 61 more [2022-07-21 01:26:38,311 INFO L158 Benchmark]: Toolchain (without parser) took 244118.42ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.6MB in the beginning and 48.0MB in the end (delta: -16.5MB). Peak memory consumption was 2.0MB. Max. memory is 16.1GB. [2022-07-21 01:26:38,311 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.3MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:26:38,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.31ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.4MB in the beginning and 55.9MB in the end (delta: -24.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. [2022-07-21 01:26:38,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.71ms. Allocated memory is still 73.4MB. Free memory was 55.7MB in the beginning and 54.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:26:38,312 INFO L158 Benchmark]: Boogie Preprocessor took 45.77ms. Allocated memory is still 73.4MB. Free memory was 54.1MB in the beginning and 52.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-21 01:26:38,312 INFO L158 Benchmark]: RCFGBuilder took 9234.09ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 43.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-21 01:26:38,313 INFO L158 Benchmark]: TraceAbstraction took 234587.66ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 48.0MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-21 01:26:38,317 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.3MB in the end (delta: 30.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.31ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.4MB in the beginning and 55.9MB in the end (delta: -24.5MB). Peak memory consumption was 5.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.71ms. Allocated memory is still 73.4MB. Free memory was 55.7MB in the beginning and 54.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.77ms. Allocated memory is still 73.4MB. Free memory was 54.1MB in the beginning and 52.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 9234.09ms. Allocated memory is still 73.4MB. Free memory was 52.7MB in the beginning and 43.0MB in the end (delta: 9.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 234587.66ms. Allocated memory is still 73.4MB. Free memory was 42.4MB in the beginning and 48.0MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:243) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")