./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/sqrt_poly.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 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_poly.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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:00:37,920 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:00:37,924 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:00:37,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:00:37,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:00:37,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:00:37,965 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:00:37,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:00:37,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:00:37,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:00:37,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:00:37,974 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:00:37,975 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:00:37,977 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:00:37,978 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:00:37,979 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:00:37,980 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:00:37,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:00:37,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:00:37,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:00:37,992 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:00:37,994 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:00:37,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:00:37,995 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:00:37,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:00:37,998 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:00:37,999 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:00:37,999 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:00:38,000 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:00:38,000 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:00:38,001 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:00:38,001 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:00:38,002 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:00:38,003 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:00:38,003 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:00:38,004 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:00:38,004 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:00:38,005 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:00:38,005 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:00:38,005 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:00:38,006 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:00:38,007 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:00:38,008 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 14:00:38,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:00:38,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:00:38,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:00:38,033 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:00:38,033 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:00:38,033 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:00:38,034 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:00:38,034 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:00:38,034 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:00:38,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:00:38,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:00:38,035 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 14:00:38,035 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:00:38,036 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:00:38,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:00:38,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:00:38,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:00:38,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:00:38,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:00:38,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:00:38,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:00:38,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:00:38,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 14:00:38,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 14:00:38,039 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:00:38,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:00:38,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:00:38,039 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2022-07-22 14:00:38,207 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:00:38,231 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:00:38,233 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:00:38,233 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:00:38,234 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:00:38,235 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2022-07-22 14:00:38,298 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a675bf3fa/32664e5213334a298aeef5bf09bd1537/FLAG2ced84c22 [2022-07-22 14:00:38,621 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:00:38,622 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2022-07-22 14:00:38,627 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a675bf3fa/32664e5213334a298aeef5bf09bd1537/FLAG2ced84c22 [2022-07-22 14:00:38,639 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a675bf3fa/32664e5213334a298aeef5bf09bd1537 [2022-07-22 14:00:38,640 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:00:38,643 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:00:38,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:00:38,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:00:38,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:00:38,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,647 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77ea93d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38, skipping insertion in model container [2022-07-22 14:00:38,648 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:00:38,662 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:00:38,782 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_poly.c[671,684] [2022-07-22 14:00:38,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:00:38,806 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:00:38,815 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_poly.c[671,684] [2022-07-22 14:00:38,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:00:38,830 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:00:38,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38 WrapperNode [2022-07-22 14:00:38,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:00:38,833 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:00:38,833 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:00:38,834 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:00:38,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,845 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,856 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2022-07-22 14:00:38,856 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:00:38,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:00:38,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:00:38,857 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:00:38,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,870 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,870 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,875 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,877 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:00:38,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:00:38,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:00:38,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:00:38,880 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (1/1) ... [2022-07-22 14:00:38,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:00:38,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:00:38,906 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-22 14:00:38,919 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-22 14:00:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:00:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 14:00:38,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:00:38,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:00:38,969 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:00:38,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:00:39,027 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:00:39,031 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:00:39,031 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 14:00:39,032 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:39 BoogieIcfgContainer [2022-07-22 14:00:39,033 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:00:39,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:00:39,034 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:00:39,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:00:39,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:00:38" (1/3) ... [2022-07-22 14:00:39,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1113c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:00:39, skipping insertion in model container [2022-07-22 14:00:39,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:38" (2/3) ... [2022-07-22 14:00:39,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1113c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:00:39, skipping insertion in model container [2022-07-22 14:00:39,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:39" (3/3) ... [2022-07-22 14:00:39,049 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2022-07-22 14:00:39,058 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:00:39,059 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:00:39,099 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:00:39,104 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@1a06fce4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@464f4bef [2022-07-22 14:00:39,105 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:00:39,108 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-22 14:00:39,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:00:39,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:00:39,124 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:00:39,124 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:00:39,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:00:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2022-07-22 14:00:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:00:39,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294841118] [2022-07-22 14:00:39,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:00:39,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:00:39,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:00:39,243 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-22 14:00:39,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 14:00:39,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294841118] [2022-07-22 14:00:39,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294841118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:00:39,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:00:39,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:00:39,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018443690] [2022-07-22 14:00:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:00:39,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:00:39,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 14:00:39,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:00:39,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:00:39,277 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-22 14:00:39,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:00:39,286 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-07-22 14:00:39,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:00:39,289 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-07-22 14:00:39,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:00:39,294 INFO L225 Difference]: With dead ends: 23 [2022-07-22 14:00:39,294 INFO L226 Difference]: Without dead ends: 9 [2022-07-22 14:00:39,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:00:39,300 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:00:39,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:00:39,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-22 14:00:39,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-22 14:00:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-22 14:00:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-22 14:00:39,322 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2022-07-22 14:00:39,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:00:39,322 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-22 14:00:39,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-22 14:00:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-22 14:00:39,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:00:39,324 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:00:39,324 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:00:39,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 14:00:39,324 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:00:39,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:00:39,325 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2022-07-22 14:00:39,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 14:00:39,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948842735] [2022-07-22 14:00:39,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:00:39,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 14:00:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:00:39,352 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 14:00:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 14:00:39,387 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 14:00:39,388 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 14:00:39,389 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:00:39,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 14:00:39,395 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-22 14:00:39,398 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:00:39,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:00:39 BoogieIcfgContainer [2022-07-22 14:00:39,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:00:39,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:00:39,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:00:39,421 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:00:39,421 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:39" (3/4) ... [2022-07-22 14:00:39,423 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 14:00:39,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:00:39,425 INFO L158 Benchmark]: Toolchain (without parser) took 781.41ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.8MB in the beginning and 62.6MB in the end (delta: -2.7MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,425 INFO L158 Benchmark]: CDTParser took 1.45ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:00:39,427 INFO L158 Benchmark]: CACSL2BoogieTranslator took 187.47ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.7MB in the beginning and 97.6MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.21ms. Allocated memory is still 121.6MB. Free memory was 97.3MB in the beginning and 96.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,430 INFO L158 Benchmark]: Boogie Preprocessor took 22.05ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,430 INFO L158 Benchmark]: RCFGBuilder took 153.19ms. Allocated memory is still 121.6MB. Free memory was 94.7MB in the beginning and 86.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,430 INFO L158 Benchmark]: TraceAbstraction took 385.04ms. Allocated memory is still 121.6MB. Free memory was 85.7MB in the beginning and 63.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-07-22 14:00:39,431 INFO L158 Benchmark]: Witness Printer took 4.04ms. Allocated memory is still 121.6MB. Free memory was 63.2MB in the beginning and 62.6MB in the end (delta: 598.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:00:39,435 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.45ms. Allocated memory is still 92.3MB. Free memory was 48.8MB in the beginning and 48.7MB in the end (delta: 39.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 187.47ms. Allocated memory was 92.3MB in the beginning and 121.6MB in the end (delta: 29.4MB). Free memory was 59.7MB in the beginning and 97.6MB in the end (delta: -38.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.21ms. Allocated memory is still 121.6MB. Free memory was 97.3MB in the beginning and 96.1MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.05ms. Allocated memory is still 121.6MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 153.19ms. Allocated memory is still 121.6MB. Free memory was 94.7MB in the beginning and 86.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 385.04ms. Allocated memory is still 121.6MB. Free memory was 85.7MB in the beginning and 63.2MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Witness Printer took 4.04ms. Allocated memory is still 121.6MB. Free memory was 63.2MB in the beginning and 62.6MB in the end (delta: 598.0kB). 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: 16]: 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 30, overapproximation of someBinaryArithmeticDOUBLEoperation at line 27. Possible FailurePath: [L18] double sqrt2 = 1.414213538169860839843750; VAL [sqrt2=11863283/8388608] [L22] double S, I; [L24] I = __VERIFIER_nondet_double() [L25] CALL assume_abort_if_not(I >= 1. && I <= 3.) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, sqrt2=11863283/8388608] [L25] RET assume_abort_if_not(I >= 1. && I <= 3.) [L27] COND TRUE I >= 2. [L27] S = sqrt2 * (1.+(I/2.- 1.)*(.5-0.125*(I/2.-1.))) VAL [sqrt2=11863283/8388608] [L30] CALL __VERIFIER_assert(S >= 1. && S <= 2.) [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] [L16] reach_error() VAL [\old(cond)=0, cond=0, sqrt2=11863283/8388608] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 16 NumberOfCodeBlocks, 16 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 7 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-22 14:00:39,470 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_poly.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 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 14:00:41,116 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 14:00:41,119 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 14:00:41,147 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 14:00:41,148 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 14:00:41,149 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 14:00:41,151 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 14:00:41,152 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 14:00:41,153 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 14:00:41,154 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 14:00:41,155 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 14:00:41,155 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 14:00:41,156 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 14:00:41,156 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 14:00:41,157 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 14:00:41,158 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 14:00:41,158 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 14:00:41,159 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 14:00:41,160 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 14:00:41,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 14:00:41,163 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 14:00:41,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 14:00:41,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 14:00:41,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 14:00:41,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 14:00:41,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 14:00:41,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 14:00:41,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 14:00:41,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 14:00:41,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 14:00:41,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 14:00:41,193 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 14:00:41,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 14:00:41,196 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 14:00:41,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 14:00:41,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 14:00:41,198 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 14:00:41,198 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 14:00:41,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 14:00:41,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 14:00:41,199 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 14:00:41,201 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 14:00:41,203 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 14:00:41,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 14:00:41,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 14:00:41,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 14:00:41,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 14:00:41,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 14:00:41,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 14:00:41,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 14:00:41,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 14:00:41,230 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 14:00:41,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 14:00:41,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 14:00:41,232 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 14:00:41,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 14:00:41,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 14:00:41,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 14:00:41,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 14:00:41,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 14:00:41,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 14:00:41,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 14:00:41,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:00:41,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 14:00:41,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 14:00:41,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 14:00:41,234 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 14:00:41,235 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 14:00:41,235 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 14:00:41,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 14:00:41,235 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 14:00:41,235 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 14:00:41,235 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 -> 9ff417092ff6ab1dae16b3d719851bc30771c0c1117076f87d0e779624eadca8 [2022-07-22 14:00:41,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 14:00:41,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 14:00:41,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 14:00:41,508 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 14:00:41,509 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 14:00:41,509 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/sqrt_poly.c [2022-07-22 14:00:41,545 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9b66d9b/94b58db91d67427ebfe825ad344155e1/FLAG1c0e0577f [2022-07-22 14:00:41,913 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 14:00:41,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/sqrt_poly.c [2022-07-22 14:00:41,918 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9b66d9b/94b58db91d67427ebfe825ad344155e1/FLAG1c0e0577f [2022-07-22 14:00:41,930 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad9b66d9b/94b58db91d67427ebfe825ad344155e1 [2022-07-22 14:00:41,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 14:00:41,934 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 14:00:41,935 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 14:00:41,935 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 14:00:41,938 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 14:00:41,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:00:41" (1/1) ... [2022-07-22 14:00:41,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261c9737 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:41, skipping insertion in model container [2022-07-22 14:00:41,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 02:00:41" (1/1) ... [2022-07-22 14:00:41,945 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 14:00:41,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 14:00:42,033 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_poly.c[671,684] [2022-07-22 14:00:42,048 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:00:42,056 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 14:00:42,064 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_poly.c[671,684] [2022-07-22 14:00:42,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 14:00:42,083 INFO L208 MainTranslator]: Completed translation [2022-07-22 14:00:42,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42 WrapperNode [2022-07-22 14:00:42,083 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 14:00:42,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 14:00:42,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 14:00:42,084 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 14:00:42,096 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,129 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2022-07-22 14:00:42,129 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 14:00:42,130 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 14:00:42,130 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 14:00:42,130 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 14:00:42,135 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,156 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 14:00:42,160 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 14:00:42,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 14:00:42,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 14:00:42,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (1/1) ... [2022-07-22 14:00:42,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 14:00:42,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 14:00:42,186 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-22 14:00:42,194 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-22 14:00:42,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 14:00:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 14:00:42,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 14:00:42,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 14:00:42,266 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 14:00:42,268 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 14:00:46,689 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 14:00:46,693 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 14:00:46,693 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 14:00:46,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:46 BoogieIcfgContainer [2022-07-22 14:00:46,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 14:00:46,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 14:00:46,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 14:00:46,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 14:00:46,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 02:00:41" (1/3) ... [2022-07-22 14:00:46,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c0975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:00:46, skipping insertion in model container [2022-07-22 14:00:46,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 02:00:42" (2/3) ... [2022-07-22 14:00:46,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a4c0975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 02:00:46, skipping insertion in model container [2022-07-22 14:00:46,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:46" (3/3) ... [2022-07-22 14:00:46,714 INFO L111 eAbstractionObserver]: Analyzing ICFG sqrt_poly.c [2022-07-22 14:00:46,726 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 14:00:46,726 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 14:00:46,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 14:00:46,761 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@612bd8b4, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68b84463 [2022-07-22 14:00:46,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 14:00:46,770 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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-22 14:00:46,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:00:46,774 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:00:46,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:00:46,775 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:00:46,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:00:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash 119383821, now seen corresponding path program 1 times [2022-07-22 14:00:46,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:00:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346448921] [2022-07-22 14:00:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:00:46,787 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:00:46,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:00:46,790 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-22 14:00:46,791 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-22 14:00:47,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:00:47,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 14:00:47,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:00:47,375 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-22 14:00:47,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:00:47,375 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:00:47,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346448921] [2022-07-22 14:00:47,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346448921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:00:47,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:00:47,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 14:00:47,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101683820] [2022-07-22 14:00:47,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:00:47,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 14:00:47,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:00:47,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 14:00:47,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:00:47,400 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-22 14:00:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:00:47,410 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-07-22 14:00:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 14:00:47,412 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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 8 [2022-07-22 14:00:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:00:47,416 INFO L225 Difference]: With dead ends: 23 [2022-07-22 14:00:47,417 INFO L226 Difference]: Without dead ends: 9 [2022-07-22 14:00:47,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 14:00:47,424 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 14:00:47,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 14:00:47,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-22 14:00:47,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-22 14:00:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-22 14:00:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-07-22 14:00:47,447 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 8 [2022-07-22 14:00:47,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:00:47,447 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-07-22 14:00:47,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 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-22 14:00:47,448 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-07-22 14:00:47,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:00:47,448 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:00:47,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:00:47,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 14:00:47,659 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-22 14:00:47,660 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:00:47,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:00:47,661 INFO L85 PathProgramCache]: Analyzing trace with hash 176642123, now seen corresponding path program 1 times [2022-07-22 14:00:47,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:00:47,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847327075] [2022-07-22 14:00:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:00:47,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:00:47,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:00:47,664 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-22 14:00:47,691 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-22 14:00:49,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:00:49,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-22 14:00:49,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:01:06,063 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 2.0))) (and (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 3.0)) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (= |c_ULTIMATE.start_main_~S~0#1| (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (fp.add c_currentRoundingMode .cse1 (let ((.cse2 (fp.sub c_currentRoundingMode (fp.div c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0) .cse1))) (fp.mul c_currentRoundingMode .cse2 (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0)) .cse2))))))))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 14:02:00,549 WARN L833 $PredicateComparison]: unable to prove that (or (and (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2))))))) .cse0))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4))))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 2.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse7 (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse8 (let ((.cse9 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse6) .cse8))) (fp.mul roundNearestTiesToEven .cse9 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse9)))))))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse6) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (fp.geq .cse7 .cse8) (fp.leq .cse7 .cse6))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)))) is different from false [2022-07-22 14:02:33,092 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2))))))) .cse0))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4))))))) is different from false [2022-07-22 14:02:35,184 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (fp.leq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.add roundNearestTiesToEven .cse1 (let ((.cse2 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0) .cse1))) (fp.mul roundNearestTiesToEven .cse2 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse2))))))) .cse0))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse3 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse3) (fp.leq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 3.0)) (not (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.geq (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 11863283.0 8388608.0)) (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven (fp.div roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse3) .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0)) .cse5)))))) .cse4))))))) is different from true [2022-07-22 14:02:35,185 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-22 14:02:35,185 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:02:35,185 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:02:35,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847327075] [2022-07-22 14:02:35,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847327075] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:02:35,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:02:35,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:02:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782129172] [2022-07-22 14:02:35,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:02:35,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:02:35,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:02:35,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:02:35,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2022-07-22 14:02:35,187 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-22 14:02:38,115 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-22 14:02:40,554 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:02:40,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:02:40,555 INFO L93 Difference]: Finished difference Result 13 states and 12 transitions. [2022-07-22 14:02:40,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:02:40,692 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 [2022-07-22 14:02:40,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:02:40,692 INFO L225 Difference]: With dead ends: 13 [2022-07-22 14:02:40,692 INFO L226 Difference]: Without dead ends: 9 [2022-07-22 14:02:40,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2022-07-22 14:02:40,694 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 5 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-22 14:02:40,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 8 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 2 Unknown, 14 Unchecked, 4.9s Time] [2022-07-22 14:02:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-07-22 14:02:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-07-22 14:02:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 8 states have internal predecessors, (8), 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-22 14:02:40,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 8 transitions. [2022-07-22 14:02:40,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 8 transitions. Word has length 8 [2022-07-22 14:02:40,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:02:40,696 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 8 transitions. [2022-07-22 14:02:40,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-22 14:02:40,696 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 8 transitions. [2022-07-22 14:02:40,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-22 14:02:40,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 14:02:40,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 14:02:40,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 14:02:40,900 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-22 14:02:40,901 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 14:02:40,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 14:02:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash 176701705, now seen corresponding path program 1 times [2022-07-22 14:02:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 14:02:40,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2054704488] [2022-07-22 14:02:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 14:02:40,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 14:02:40,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 14:02:40,904 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-22 14:02:40,909 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-22 14:02:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 14:02:42,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 14:02:42,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 14:02:59,748 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (= |c_ULTIMATE.start_main_~S~0#1| (fp.add c_currentRoundingMode .cse0 (let ((.cse1 (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 2.0)) (fp.mul c_currentRoundingMode .cse1 (fp.add c_currentRoundingMode (fp.neg ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 8.0))) (fp.mul c_currentRoundingMode .cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 1.0 16.0)))))))))) (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) c_currentRoundingMode 2.0)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 14:03:54,909 WARN L833 $PredicateComparison]: unable to prove that (or (and (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32)) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (let ((.cse1 (fp.add roundNearestTiesToEven .cse0 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0)))))))))) (.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (fp.leq .cse1 .cse2) (fp.geq .cse1 .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2))))))) (and (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (not (fp.geq (fp.add roundNearestTiesToEven .cse4 (let ((.cse5 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse4))) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse5 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse5 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse6 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse8 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse6) (not (fp.leq (fp.add roundNearestTiesToEven .cse6 (let ((.cse7 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse6))) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse7 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse7 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse8)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse8)))))) (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32)))) is different from false [2022-07-22 14:04:27,838 WARN L833 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4)))))) is different from false [2022-07-22 14:04:29,933 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse0) (not (fp.geq |ULTIMATE.start_main_~I~0#1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (not (fp.geq (fp.add roundNearestTiesToEven .cse0 (let ((.cse1 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse0))) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse1 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse0))))) (exists ((|ULTIMATE.start_main_~I~0#1| (_ FloatingPoint 11 53))) (let ((.cse2 ((_ to_fp 11 53) roundNearestTiesToEven 1.0)) (.cse4 ((_ to_fp 11 53) roundNearestTiesToEven 2.0))) (and (fp.geq |ULTIMATE.start_main_~I~0#1| .cse2) (not (fp.leq (fp.add roundNearestTiesToEven .cse2 (let ((.cse3 (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~I~0#1| .cse2))) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) (fp.mul roundNearestTiesToEven .cse3 (fp.add roundNearestTiesToEven (fp.neg ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 8.0))) (fp.mul roundNearestTiesToEven .cse3 ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 16.0))))))))) .cse4)) (not (fp.geq |ULTIMATE.start_main_~I~0#1| .cse4)))))) is different from true [2022-07-22 14:04:29,933 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-22 14:04:29,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 14:04:29,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 14:04:29,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2054704488] [2022-07-22 14:04:29,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2054704488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 14:04:29,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 14:04:29,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-22 14:04:29,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461861042] [2022-07-22 14:04:29,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 14:04:29,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-22 14:04:29,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 14:04:29,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-22 14:04:29,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=13, Unknown=4, NotChecked=24, Total=56 [2022-07-22 14:04:29,935 INFO L87 Difference]: Start difference. First operand 9 states and 8 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-22 14:04:32,877 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 14:04:32,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 14:04:32,878 INFO L93 Difference]: Finished difference Result 9 states and 8 transitions. [2022-07-22 14:04:33,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-22 14:04:33,016 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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 8 [2022-07-22 14:04:33,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 14:04:33,016 INFO L225 Difference]: With dead ends: 9 [2022-07-22 14:04:33,016 INFO L226 Difference]: Without dead ends: 0 [2022-07-22 14:04:33,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=20, Invalid=18, Unknown=4, NotChecked=30, Total=72 [2022-07-22 14:04:33,017 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-22 14:04:33,018 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 3 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 1 Unknown, 13 Unchecked, 2.4s Time] [2022-07-22 14:04:33,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-22 14:04:33,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-22 14:04:33,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 14:04:33,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-22 14:04:33,018 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2022-07-22 14:04:33,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 14:04:33,018 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-22 14:04:33,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-22 14:04:33,021 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-22 14:04:33,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-22 14:04:33,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 14:04:33,042 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-22 14:04:33,228 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-22 14:04:33,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-22 14:04:33,233 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-22 14:04:33,233 INFO L902 garLoopResultBuilder]: At program point L31(lines 20 32) the Hoare annotation is: true [2022-07-22 14:04:33,233 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 28) no Hoare annotation was computed. [2022-07-22 14:04:33,233 INFO L899 garLoopResultBuilder]: For program point L27-2(lines 27 28) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 15) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 16) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point L16(line 16) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point L16-1(line 16) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L899 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-07-22 14:04:33,234 INFO L902 garLoopResultBuilder]: At program point L16-3(line 16) the Hoare annotation is: true [2022-07-22 14:04:33,236 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 14:04:33,237 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 14:04:33,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 02:04:33 BoogieIcfgContainer [2022-07-22 14:04:33,242 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 14:04:33,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 14:04:33,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 14:04:33,242 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 14:04:33,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 02:00:46" (3/4) ... [2022-07-22 14:04:33,244 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-22 14:04:33,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-07-22 14:04:33,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-22 14:04:33,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-22 14:04:33,250 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-22 14:04:33,267 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-22 14:04:33,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 14:04:33,268 INFO L158 Benchmark]: Toolchain (without parser) took 231334.26ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 42.1MB in the beginning and 31.1MB in the end (delta: 11.0MB). Peak memory consumption was 22.2MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,268 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 84.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:04:33,268 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.46ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 44.7MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,269 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 43.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,269 INFO L158 Benchmark]: Boogie Preprocessor took 29.65ms. Allocated memory is still 60.8MB. Free memory was 43.0MB in the beginning and 41.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 14:04:33,269 INFO L158 Benchmark]: RCFGBuilder took 4534.30ms. Allocated memory is still 60.8MB. Free memory was 41.8MB in the beginning and 33.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,269 INFO L158 Benchmark]: TraceAbstraction took 226545.52ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 32.8MB in the beginning and 33.7MB in the end (delta: -947.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,270 INFO L158 Benchmark]: Witness Printer took 25.28ms. Allocated memory is still 73.4MB. Free memory was 33.7MB in the beginning and 31.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 14:04:33,271 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.14ms. Allocated memory is still 60.8MB. Free memory was 43.3MB in the beginning and 43.2MB in the end (delta: 84.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.46ms. Allocated memory is still 60.8MB. Free memory was 41.9MB in the beginning and 44.7MB in the end (delta: -2.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 60.8MB. Free memory was 44.7MB in the beginning and 43.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.65ms. Allocated memory is still 60.8MB. Free memory was 43.0MB in the beginning and 41.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 4534.30ms. Allocated memory is still 60.8MB. Free memory was 41.8MB in the beginning and 33.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 226545.52ms. Allocated memory was 60.8MB in the beginning and 73.4MB in the end (delta: 12.6MB). Free memory was 32.8MB in the beginning and 33.7MB in the end (delta: -947.7kB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 25.28ms. Allocated memory is still 73.4MB. Free memory was 33.7MB in the beginning and 31.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 16]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 226.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 7.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 7.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 27 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10 IncrementalHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 18 mSDtfsCounter, 10 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.8s SatisfiabilityAnalysisTime, 213.2s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 21 ConstructedInterpolants, 6 QuantifiedInterpolants, 1011 SizeOfPredicates, 15 NumberOfNonLiveVariables, 78 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-22 14:04:33,491 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-22 14:04:33,537 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE