./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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-newlib/float_req_bl_0684b.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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:11,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:11,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:11,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:11,904 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:11,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:11,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:11,912 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:11,915 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:11,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:11,917 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:11,919 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:11,919 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:11,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:11,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:11,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:11,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:11,927 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:11,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:11,931 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:11,933 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:11,934 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:11,935 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:11,935 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:11,936 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:11,941 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:11,943 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:11,944 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:11,945 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:11,945 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:11,946 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:11,946 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:11,947 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:11,948 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:11,949 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:11,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:11,950 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:11,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:11,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:11,951 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:11,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:11,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:11,953 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:51:11,974 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:11,976 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:11,976 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:11,976 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:11,977 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:11,977 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:11,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:11,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:11,978 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:11,978 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:11,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:11,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:11,980 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:11,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:11,981 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:11,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:11,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:11,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:11,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:51:11,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:51:11,983 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:11,983 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:11,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:11,983 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2022-07-13 14:51:12,168 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:12,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:12,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:12,189 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:12,189 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:12,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-07-13 14:51:12,240 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7e73f0e/771ed3b524584dc0965c68cfc7486212/FLAG8b26f9d47 [2022-07-13 14:51:12,596 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:12,596 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-07-13 14:51:12,606 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7e73f0e/771ed3b524584dc0965c68cfc7486212/FLAG8b26f9d47 [2022-07-13 14:51:12,621 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df7e73f0e/771ed3b524584dc0965c68cfc7486212 [2022-07-13 14:51:12,624 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:12,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:12,627 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:12,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:12,630 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:12,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,632 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4da37177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12, skipping insertion in model container [2022-07-13 14:51:12,632 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:12,650 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:12,807 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-newlib/float_req_bl_0684b.c[5556,5569] [2022-07-13 14:51:12,813 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:12,820 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:12,874 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-newlib/float_req_bl_0684b.c[5556,5569] [2022-07-13 14:51:12,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:12,886 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:12,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12 WrapperNode [2022-07-13 14:51:12,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:12,888 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:12,888 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:12,888 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:12,893 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,901 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,926 INFO L137 Inliner]: procedures = 20, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 274 [2022-07-13 14:51:12,931 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:12,932 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:12,932 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:12,932 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:12,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,956 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,961 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,964 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,968 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:12,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:12,969 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:12,969 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:12,970 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (1/1) ... [2022-07-13 14:51:12,990 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:12,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:13,008 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-13 14:51:13,013 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-13 14:51:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:51:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:13,045 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:51:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:51:13,046 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:51:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:13,048 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:13,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:51:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 14:51:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:13,049 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:13,117 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:13,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:13,487 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:13,493 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:13,493 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-13 14:51:13,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:13 BoogieIcfgContainer [2022-07-13 14:51:13,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:13,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:13,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:13,500 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:13,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:12" (1/3) ... [2022-07-13 14:51:13,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fd953e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:13, skipping insertion in model container [2022-07-13 14:51:13,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:12" (2/3) ... [2022-07-13 14:51:13,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21fd953e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:13, skipping insertion in model container [2022-07-13 14:51:13,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:13" (3/3) ... [2022-07-13 14:51:13,502 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2022-07-13 14:51:13,518 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:13,518 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:13,562 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:13,566 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@4912d0b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@648e9adb [2022-07-13 14:51:13,567 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:13,571 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:13,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 14:51:13,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:13,577 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:13,577 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:13,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:13,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1799288028, now seen corresponding path program 1 times [2022-07-13 14:51:13,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:13,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110245365] [2022-07-13 14:51:13,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:13,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:13,691 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-13 14:51:13,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:13,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110245365] [2022-07-13 14:51:13,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110245365] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:13,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:13,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:13,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615360964] [2022-07-13 14:51:13,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:13,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:13,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:13,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:13,725 INFO L87 Difference]: Start difference. First operand has 109 states, 101 states have (on average 1.7227722772277227) internal successors, (174), 102 states have internal predecessors, (174), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 14:51:13,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:13,769 INFO L93 Difference]: Finished difference Result 216 states and 366 transitions. [2022-07-13 14:51:13,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:13,771 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-07-13 14:51:13,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:13,781 INFO L225 Difference]: With dead ends: 216 [2022-07-13 14:51:13,781 INFO L226 Difference]: Without dead ends: 105 [2022-07-13 14:51:13,787 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-13 14:51:13,790 INFO L413 NwaCegarLoop]: 159 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, 159 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-13 14:51:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:51:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-13 14:51:13,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-13 14:51:13,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 98 states have (on average 1.489795918367347) internal successors, (146), 98 states have internal predecessors, (146), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2022-07-13 14:51:13,837 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 14 [2022-07-13 14:51:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:13,837 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2022-07-13 14:51:13,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 14:51:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2022-07-13 14:51:13,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:13,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:13,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:13,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:51:13,841 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:13,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:13,842 INFO L85 PathProgramCache]: Analyzing trace with hash 647324465, now seen corresponding path program 1 times [2022-07-13 14:51:13,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:13,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129637250] [2022-07-13 14:51:13,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:13,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:13,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:14,016 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-13 14:51:14,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:14,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129637250] [2022-07-13 14:51:14,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129637250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:14,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:14,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:51:14,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318918772] [2022-07-13 14:51:14,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:14,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:51:14,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:14,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:51:14,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:51:14,020 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-13 14:51:14,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:14,095 INFO L93 Difference]: Finished difference Result 218 states and 323 transitions. [2022-07-13 14:51:14,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:51:14,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-07-13 14:51:14,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:14,100 INFO L225 Difference]: With dead ends: 218 [2022-07-13 14:51:14,100 INFO L226 Difference]: Without dead ends: 147 [2022-07-13 14:51:14,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:51:14,106 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 81 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:14,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 320 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:51:14,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-13 14:51:14,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 132. [2022-07-13 14:51:14,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 125 states have (on average 1.528) internal successors, (191), 125 states have internal predecessors, (191), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:14,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 199 transitions. [2022-07-13 14:51:14,121 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 199 transitions. Word has length 17 [2022-07-13 14:51:14,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:14,122 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 199 transitions. [2022-07-13 14:51:14,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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-13 14:51:14,123 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 199 transitions. [2022-07-13 14:51:14,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:51:14,126 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:14,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:14,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:51:14,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:14,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:14,127 INFO L85 PathProgramCache]: Analyzing trace with hash 2009397772, now seen corresponding path program 1 times [2022-07-13 14:51:14,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:14,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232988766] [2022-07-13 14:51:14,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:14,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:14,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:14,198 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:51:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:14,239 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:51:14,240 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:51:14,241 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:51:14,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:51:14,244 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 14:51:14,246 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:51:14,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:51:14 BoogieIcfgContainer [2022-07-13 14:51:14,274 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:51:14,275 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:51:14,276 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:51:14,276 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:51:14,276 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:13" (3/4) ... [2022-07-13 14:51:14,278 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:51:14,278 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:51:14,279 INFO L158 Benchmark]: Toolchain (without parser) took 1654.02ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 61.7MB in the beginning and 63.1MB in the end (delta: -1.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,280 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:14,281 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.56ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 66.5MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,285 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.90ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,285 INFO L158 Benchmark]: Boogie Preprocessor took 35.79ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,287 INFO L158 Benchmark]: RCFGBuilder took 527.97ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 61.1MB in the beginning and 84.1MB in the end (delta: -23.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,287 INFO L158 Benchmark]: TraceAbstraction took 776.59ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 63.4MB in the end (delta: 20.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-07-13 14:51:14,287 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 63.1MB in the end (delta: 377.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:14,289 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.17ms. Allocated memory is still 94.4MB. Free memory was 49.1MB in the beginning and 49.1MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.56ms. Allocated memory is still 94.4MB. Free memory was 61.6MB in the beginning and 66.5MB in the end (delta: -5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.90ms. Allocated memory is still 94.4MB. Free memory was 66.5MB in the beginning and 63.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.79ms. Allocated memory is still 94.4MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 527.97ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 61.1MB in the beginning and 84.1MB in the end (delta: -23.0MB). Peak memory consumption was 20.5MB. Max. memory is 16.1GB. * TraceAbstraction took 776.59ms. Allocated memory is still 117.4MB. Free memory was 83.5MB in the beginning and 63.4MB in the end (delta: 20.1MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 117.4MB. Free memory was 63.4MB in the beginning and 63.1MB in the end (delta: 377.3kB). 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: 245]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 244, overapproximation of someUnaryDOUBLEoperation at line 44, overapproximation of bitwiseAnd at line 225, overapproximation of someBinaryArithmeticFLOAToperation at line 137. Possible FailurePath: [L29-L34] static const float atanhi_atan[] = { 4.6364760399e-01, 7.8539812565e-01, 9.8279368877e-01, 1.5707962513e+00, }; [L36-L41] static const float atanlo_atan[] = { 5.0121582440e-09, 3.7748947079e-08, 3.4473217170e-08, 7.5497894159e-08, }; [L43-L47] static const float aT_atan[] = { 3.3333334327e-01, -2.0000000298e-01, 1.4285714924e-01, -1.1111110449e-01, 9.0908870101e-02, -7.6918758452e-02, 6.6610731184e-02, -5.8335702866e-02, 4.9768779427e-02, -3.6531571299e-02, 1.6285819933e-02, }; [L49-L51] static const float one_atan = 1.0, huge_atan = 1.0e30, pi_o_4 = 7.8539818525e-01, pi_o_2 = 1.5707963705e+00, pi = 3.1415927410e+00; [L117-L118] static const float tiny_atan2 = 1.0e-30, zero_atan2 = 0.0, pi_lo_atan2 = -8.7422776573e-08; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, zero_atan2=0] [L236] float x = __VERIFIER_nondet_float(); [L237] float y = -1.0f / 0.0f; [L239] CALL isfinite_float(x) [L219] __int32_t ix; VAL [\old(x)=1000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L221] ieee_float_shape_type gf_u; [L222] gf_u.value = (x) [L223] EXPR gf_u.word [L223] (ix) = gf_u.word [L225] ix &= 0x7fffffff [L226] return (((ix) < 0x7f800000L)); VAL [\old(x)=1000000000000000000000000000002, \result=1, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, ix=2139095039, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, zero_atan2=0] [L239] RET isfinite_float(x) [L239] COND TRUE isfinite_float(x) [L241] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L125] ieee_float_shape_type gf_u; [L126] gf_u.value = (x) [L127] EXPR gf_u.word [L127] (hx) = gf_u.word [L129] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L131] ieee_float_shape_type gf_u; [L132] gf_u.value = (y) [L133] EXPR gf_u.word [L133] (hy) = gf_u.word [L135] iy = hy & 0x7fffffff VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000002, \old(y)=1000000000000000000000000000001, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, hx=0, hy=2147483647, ix=0, iy=2147483646, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L241] RET, EXPR __ieee754_atan2f(y, x) [L241] float res = __ieee754_atan2f(y, x); [L244] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] [L245] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000, iy = hy & 0x7fffffff=2147483647, one_atan=1, pi=3141592741/1000000000, pi_o_2=3141592741/2000000000, pi_o_4=3141592741/4000000000, res=1000000000000000000000000000003, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000002, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.7s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 83 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81 mSDsluCounter, 479 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 162 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22 IncrementalHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 317 mSDtfsCounter, 22 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=2, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 51 NumberOfCodeBlocks, 51 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 41 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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-13 14:51:14,324 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-newlib/float_req_bl_0684b.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 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:15,951 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:15,954 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:15,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:15,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:15,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:15,992 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:15,995 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:15,996 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:16,000 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:16,001 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:16,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:16,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:16,004 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:16,005 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:16,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:16,009 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:16,010 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:16,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:16,018 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:16,020 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:16,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:16,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:16,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:16,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:16,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:16,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:16,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:16,031 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:16,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:16,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:16,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:16,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:16,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:16,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:16,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:16,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:16,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:16,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:16,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:16,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:16,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:16,044 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:51:16,070 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:16,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:16,071 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:16,071 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:16,072 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:16,072 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:16,072 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:16,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:16,073 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:16,073 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:16,074 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:16,074 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:16,074 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:16,074 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:16,085 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:16,085 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:16,085 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:16,086 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:16,087 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:16,087 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:16,087 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:16,087 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:16,087 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:16,088 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:16,088 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:16,088 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:51:16,088 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:51:16,089 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:16,089 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:16,089 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:16,089 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:51:16,089 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 -> 27ce6cfdcb9dfa0489011437b04a08db6e71d8edccf3dd91706f7dddce0310b4 [2022-07-13 14:51:16,363 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:16,384 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:16,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:16,388 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:16,388 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:16,390 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-07-13 14:51:16,447 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a6bd0eb/c745aa8d443a4f42b7f58cfcadd2edb8/FLAGd969c3e6e [2022-07-13 14:51:16,798 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:16,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0684b.c [2022-07-13 14:51:16,805 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a6bd0eb/c745aa8d443a4f42b7f58cfcadd2edb8/FLAGd969c3e6e [2022-07-13 14:51:17,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40a6bd0eb/c745aa8d443a4f42b7f58cfcadd2edb8 [2022-07-13 14:51:17,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:17,229 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:17,230 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:17,230 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:17,238 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:17,239 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,240 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d99a53f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17, skipping insertion in model container [2022-07-13 14:51:17,240 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,245 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:17,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:17,413 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-newlib/float_req_bl_0684b.c[5556,5569] [2022-07-13 14:51:17,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:17,437 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:17,494 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-newlib/float_req_bl_0684b.c[5556,5569] [2022-07-13 14:51:17,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:17,508 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:17,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17 WrapperNode [2022-07-13 14:51:17,509 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:17,510 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:17,510 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:17,510 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:17,515 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,573 INFO L137 Inliner]: procedures = 23, calls = 84, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 238 [2022-07-13 14:51:17,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:17,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:17,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:17,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:17,581 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,596 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,618 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,621 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:17,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:17,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:17,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:17,625 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (1/1) ... [2022-07-13 14:51:17,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:17,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:17,656 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-13 14:51:17,676 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-13 14:51:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-13 14:51:17,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:51:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-13 14:51:17,691 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:17,692 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:51:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:17,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-13 14:51:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:17,692 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:17,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:51:17,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:17,785 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:17,786 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:29,732 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:29,737 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:29,737 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2022-07-13 14:51:29,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:29 BoogieIcfgContainer [2022-07-13 14:51:29,739 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:29,740 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:29,740 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:29,743 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:29,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:17" (1/3) ... [2022-07-13 14:51:29,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1337135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:29, skipping insertion in model container [2022-07-13 14:51:29,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:17" (2/3) ... [2022-07-13 14:51:29,744 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1337135b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:29, skipping insertion in model container [2022-07-13 14:51:29,744 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:29" (3/3) ... [2022-07-13 14:51:29,749 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0684b.c [2022-07-13 14:51:29,759 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:29,759 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:29,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:29,799 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@4e0c084c, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b4e8252 [2022-07-13 14:51:29,800 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:29,803 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:29,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-13 14:51:29,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:29,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:29,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:29,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:29,812 INFO L85 PathProgramCache]: Analyzing trace with hash -540288573, now seen corresponding path program 1 times [2022-07-13 14:51:29,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:29,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [85030025] [2022-07-13 14:51:29,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:29,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:29,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:29,823 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-13 14:51:29,827 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-13 14:51:30,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:30,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:51:30,598 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:30,610 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-13 14:51:30,610 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:30,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:30,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [85030025] [2022-07-13 14:51:30,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [85030025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:30,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:30,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:30,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514631307] [2022-07-13 14:51:30,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:30,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:30,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:30,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:30,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:30,651 INFO L87 Difference]: Start difference. First operand has 96 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 89 states have internal predecessors, (145), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 14:51:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:30,690 INFO L93 Difference]: Finished difference Result 190 states and 308 transitions. [2022-07-13 14:51:30,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-07-13 14:51:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:30,703 INFO L225 Difference]: With dead ends: 190 [2022-07-13 14:51:30,703 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 14:51:30,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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-13 14:51:30,710 INFO L413 NwaCegarLoop]: 136 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, 136 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-13 14:51:30,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:51:30,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 14:51:30,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-13 14:51:30,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4470588235294117) internal successors, (123), 85 states have internal predecessors, (123), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2022-07-13 14:51:30,745 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 14 [2022-07-13 14:51:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:30,745 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2022-07-13 14:51:30,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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-13 14:51:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2022-07-13 14:51:30,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:30,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:30,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:30,776 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-13 14:51:30,947 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-13 14:51:30,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1209401097, now seen corresponding path program 1 times [2022-07-13 14:51:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:30,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587825229] [2022-07-13 14:51:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:30,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:30,951 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-13 14:51:30,953 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-13 14:51:31,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:31,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-13 14:51:31,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:31,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 14:51:33,235 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-13 14:51:33,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 35 [2022-07-13 14:51:33,963 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-13 14:51:33,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 26 [2022-07-13 14:51:34,837 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-13 14:51:34,837 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:34,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:34,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587825229] [2022-07-13 14:51:34,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587825229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:34,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:34,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-13 14:51:34,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286913440] [2022-07-13 14:51:34,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:34,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-13 14:51:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-13 14:51:34,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:51:34,848 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 14:51:34,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:34,869 INFO L93 Difference]: Finished difference Result 96 states and 134 transitions. [2022-07-13 14:51:34,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 14:51:34,870 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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 17 [2022-07-13 14:51:34,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:34,871 INFO L225 Difference]: With dead ends: 96 [2022-07-13 14:51:34,875 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 14:51:34,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:51:34,877 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 0 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1105 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:34,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1105 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 110 Unchecked, 0.0s Time] [2022-07-13 14:51:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 14:51:34,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-13 14:51:34,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.4352941176470588) internal successors, (122), 85 states have internal predecessors, (122), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:34,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2022-07-13 14:51:34,887 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 17 [2022-07-13 14:51:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:34,887 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2022-07-13 14:51:34,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 11 states have internal predecessors, (17), 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-13 14:51:34,887 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2022-07-13 14:51:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:51:34,888 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:34,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:34,919 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-13 14:51:35,099 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-13 14:51:35,100 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:35,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:35,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1450439137, now seen corresponding path program 1 times [2022-07-13 14:51:35,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:35,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425753015] [2022-07-13 14:51:35,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:35,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:35,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:35,108 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-13 14:51:35,109 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-13 14:51:35,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:35,862 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 14:51:35,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:37,564 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-13 14:51:37,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:37,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:37,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425753015] [2022-07-13 14:51:37,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425753015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:37,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:37,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:37,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507982934] [2022-07-13 14:51:37,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:37,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:51:37,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:37,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:51:37,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:51:37,566 INFO L87 Difference]: Start difference. First operand 92 states and 130 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:45,351 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:48,110 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:50,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:52,299 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:54,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:55,818 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:58,083 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:59,376 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:51:59,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:59,618 INFO L93 Difference]: Finished difference Result 100 states and 138 transitions. [2022-07-13 14:51:59,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:51:59,619 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 14:51:59,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:59,621 INFO L225 Difference]: With dead ends: 100 [2022-07-13 14:51:59,621 INFO L226 Difference]: Without dead ends: 95 [2022-07-13 14:51:59,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:51:59,622 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 107 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:59,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 368 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 143 Invalid, 5 Unknown, 0 Unchecked, 20.6s Time] [2022-07-13 14:51:59,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-13 14:51:59,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-13 14:51:59,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:51:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 129 transitions. [2022-07-13 14:51:59,637 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 129 transitions. Word has length 22 [2022-07-13 14:51:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:59,637 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 129 transitions. [2022-07-13 14:51:59,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 129 transitions. [2022-07-13 14:51:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:51:59,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:59,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:59,672 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-13 14:51:59,844 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-13 14:51:59,844 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:59,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:59,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1452286179, now seen corresponding path program 1 times [2022-07-13 14:51:59,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:59,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1965999146] [2022-07-13 14:51:59,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:59,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:59,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:51:59,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-13 14:52:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:00,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:52:00,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:01,146 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-13 14:52:01,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:01,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:01,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1965999146] [2022-07-13 14:52:01,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1965999146] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:01,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:01,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:52:01,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908851733] [2022-07-13 14:52:01,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:01,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:52:01,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:01,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:52:01,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:52:01,147 INFO L87 Difference]: Start difference. First operand 92 states and 129 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:01,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:01,152 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2022-07-13 14:52:01,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:52:01,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 14:52:01,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:01,153 INFO L225 Difference]: With dead ends: 100 [2022-07-13 14:52:01,153 INFO L226 Difference]: Without dead ends: 94 [2022-07-13 14:52:01,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:52:01,154 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 61 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:01,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 408 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-13 14:52:01,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-13 14:52:01,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2022-07-13 14:52:01,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 83 states have internal predecessors, (118), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:52:01,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 126 transitions. [2022-07-13 14:52:01,162 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 126 transitions. Word has length 22 [2022-07-13 14:52:01,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:01,162 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 126 transitions. [2022-07-13 14:52:01,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:01,162 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 126 transitions. [2022-07-13 14:52:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:52:01,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:01,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:01,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:01,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:01,363 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:01,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:01,364 INFO L85 PathProgramCache]: Analyzing trace with hash -947623069, now seen corresponding path program 1 times [2022-07-13 14:52:01,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:01,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1011483189] [2022-07-13 14:52:01,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:01,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:01,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:01,366 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:01,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-13 14:52:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:02,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:52:02,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:02,777 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-13 14:52:02,777 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:02,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:02,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1011483189] [2022-07-13 14:52:02,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1011483189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:02,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:02,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:52:02,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204661140] [2022-07-13 14:52:02,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:02,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:52:02,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:02,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:52:02,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:52:02,779 INFO L87 Difference]: Start difference. First operand 90 states and 126 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:02,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:02,784 INFO L93 Difference]: Finished difference Result 160 states and 224 transitions. [2022-07-13 14:52:02,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:52:02,784 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 14:52:02,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:02,785 INFO L225 Difference]: With dead ends: 160 [2022-07-13 14:52:02,785 INFO L226 Difference]: Without dead ends: 88 [2022-07-13 14:52:02,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:52:02,786 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:02,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 540 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-13 14:52:02,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-13 14:52:02,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 84. [2022-07-13 14:52:02,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:52:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 115 transitions. [2022-07-13 14:52:02,794 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 115 transitions. Word has length 22 [2022-07-13 14:52:02,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:02,794 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 115 transitions. [2022-07-13 14:52:02,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:02,794 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 115 transitions. [2022-07-13 14:52:02,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 14:52:02,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:02,799 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:02,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:03,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:03,004 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:03,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:03,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1672952196, now seen corresponding path program 1 times [2022-07-13 14:52:03,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:03,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2084191105] [2022-07-13 14:52:03,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:03,005 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:03,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:03,006 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:03,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-13 14:52:03,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:03,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-13 14:52:03,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:03,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 14:52:04,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-13 14:52:05,909 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-13 14:52:05,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:05,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:05,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2084191105] [2022-07-13 14:52:05,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2084191105] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:05,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:05,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-13 14:52:05,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [484614978] [2022-07-13 14:52:05,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:05,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 14:52:05,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:05,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 14:52:05,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:52:05,911 INFO L87 Difference]: Start difference. First operand 84 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-13 14:52:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:06,163 INFO L93 Difference]: Finished difference Result 141 states and 190 transitions. [2022-07-13 14:52:06,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:52:06,164 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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 23 [2022-07-13 14:52:06,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:06,164 INFO L225 Difference]: With dead ends: 141 [2022-07-13 14:52:06,164 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 14:52:06,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:52:06,165 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:06,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 636 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 66 Unchecked, 0.0s Time] [2022-07-13 14:52:06,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 14:52:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-07-13 14:52:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.303030303030303) internal successors, (86), 66 states have internal predecessors, (86), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:52:06,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 94 transitions. [2022-07-13 14:52:06,172 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 94 transitions. Word has length 23 [2022-07-13 14:52:06,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:06,172 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 94 transitions. [2022-07-13 14:52:06,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 states have internal predecessors, (23), 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-13 14:52:06,172 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 94 transitions. [2022-07-13 14:52:06,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:52:06,173 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:06,173 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:06,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:06,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:06,392 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash 791814228, now seen corresponding path program 1 times [2022-07-13 14:52:06,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:06,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [35529150] [2022-07-13 14:52:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:06,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:06,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:06,396 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:06,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-13 14:52:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:07,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 14:52:07,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:08,885 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-13 14:52:08,885 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:08,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:08,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [35529150] [2022-07-13 14:52:08,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [35529150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:08,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:08,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:52:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027979131] [2022-07-13 14:52:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:08,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:52:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:52:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:52:08,887 INFO L87 Difference]: Start difference. First operand 73 states and 94 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:14,919 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:17,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:19,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:21,916 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:23,190 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:25,453 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:27,602 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:27,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:27,671 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2022-07-13 14:52:27,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:52:27,672 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 14:52:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:27,672 INFO L225 Difference]: With dead ends: 81 [2022-07-13 14:52:27,672 INFO L226 Difference]: Without dead ends: 76 [2022-07-13 14:52:27,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:52:27,673 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 68 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:27,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 268 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 5 Unknown, 0 Unchecked, 17.5s Time] [2022-07-13 14:52:27,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-13 14:52:27,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-07-13 14:52:27,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:52:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 93 transitions. [2022-07-13 14:52:27,677 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 93 transitions. Word has length 24 [2022-07-13 14:52:27,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:27,678 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 93 transitions. [2022-07-13 14:52:27,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:27,678 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-07-13 14:52:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:52:27,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:27,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:27,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-07-13 14:52:27,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:27,879 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash 793661270, now seen corresponding path program 1 times [2022-07-13 14:52:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:27,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893879829] [2022-07-13 14:52:27,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:27,880 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:27,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:27,881 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:27,881 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-13 14:52:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:28,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:52:28,631 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:29,169 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-13 14:52:29,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:29,169 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:29,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893879829] [2022-07-13 14:52:29,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893879829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:29,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:29,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:52:29,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786485008] [2022-07-13 14:52:29,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:29,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:52:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:29,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:52:29,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:52:29,170 INFO L87 Difference]: Start difference. First operand 73 states and 93 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:29,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:29,174 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-07-13 14:52:29,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:52:29,174 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 14:52:29,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:29,175 INFO L225 Difference]: With dead ends: 77 [2022-07-13 14:52:29,175 INFO L226 Difference]: Without dead ends: 71 [2022-07-13 14:52:29,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:52:29,175 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 26 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:29,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 303 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 6 Unchecked, 0.0s Time] [2022-07-13 14:52:29,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-13 14:52:29,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-07-13 14:52:29,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 64 states have (on average 1.28125) internal successors, (82), 64 states have internal predecessors, (82), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 14:52:29,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 90 transitions. [2022-07-13 14:52:29,183 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 90 transitions. Word has length 24 [2022-07-13 14:52:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:29,183 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 90 transitions. [2022-07-13 14:52:29,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:29,183 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2022-07-13 14:52:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 14:52:29,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:29,184 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:29,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 14:52:29,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:29,390 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:29,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1553945203, now seen corresponding path program 1 times [2022-07-13 14:52:29,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:29,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1302806061] [2022-07-13 14:52:29,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:29,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:29,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:29,392 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:29,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 14:52:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:30,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:52:30,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:30,950 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-13 14:52:30,951 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:30,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:30,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1302806061] [2022-07-13 14:52:30,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1302806061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:30,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:30,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:52:30,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659011233] [2022-07-13 14:52:30,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:30,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:52:30,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:30,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:52:30,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:52:30,952 INFO L87 Difference]: Start difference. First operand 71 states and 90 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-13 14:52:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:30,955 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2022-07-13 14:52:30,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:52:30,955 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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 25 [2022-07-13 14:52:30,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:30,955 INFO L225 Difference]: With dead ends: 105 [2022-07-13 14:52:30,955 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 14:52:30,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:52:30,956 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:30,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 280 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-13 14:52:30,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 14:52:30,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-13 14:52:30,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 46 states have internal predecessors, (57), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:52:30,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 61 transitions. [2022-07-13 14:52:30,960 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 61 transitions. Word has length 25 [2022-07-13 14:52:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:30,960 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 61 transitions. [2022-07-13 14:52:30,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 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-13 14:52:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-07-13 14:52:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 14:52:30,961 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:30,961 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:31,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:31,176 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:31,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:31,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1512113405, now seen corresponding path program 1 times [2022-07-13 14:52:31,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:31,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116260254] [2022-07-13 14:52:31,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:31,179 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:31,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:31,180 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:31,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 14:52:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:31,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:52:31,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:32,989 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-13 14:52:32,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:32,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:32,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116260254] [2022-07-13 14:52:32,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116260254] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:32,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:52:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643697673] [2022-07-13 14:52:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:32,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:52:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:52:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:52:32,990 INFO L87 Difference]: Start difference. First operand 51 states and 61 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:52:35,940 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:37,013 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:39,033 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:41,209 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:44,239 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:46,397 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:46,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:46,398 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2022-07-13 14:52:46,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:52:46,448 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-13 14:52:46,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:46,449 INFO L225 Difference]: With dead ends: 58 [2022-07-13 14:52:46,449 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 14:52:46,449 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:52:46,449 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 8 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 13.2s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:46,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 317 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 4 Unknown, 31 Unchecked, 13.2s Time] [2022-07-13 14:52:46,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 14:52:46,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-07-13 14:52:46,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 46 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:52:46,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2022-07-13 14:52:46,452 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 60 transitions. Word has length 28 [2022-07-13 14:52:46,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:46,453 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 60 transitions. [2022-07-13 14:52:46,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:52:46,453 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 60 transitions. [2022-07-13 14:52:46,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:52:46,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:46,453 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:46,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:46,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:46,664 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:46,664 INFO L85 PathProgramCache]: Analyzing trace with hash 868682631, now seen corresponding path program 1 times [2022-07-13 14:52:46,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:46,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [115873250] [2022-07-13 14:52:46,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:46,665 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:46,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:46,666 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:46,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-13 14:52:47,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:47,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:52:47,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:48,293 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-13 14:52:48,294 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:48,294 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:48,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [115873250] [2022-07-13 14:52:48,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [115873250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:48,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:48,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:52:48,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001921954] [2022-07-13 14:52:48,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:48,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:52:48,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:48,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:52:48,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:48,295 INFO L87 Difference]: Start difference. First operand 51 states and 60 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:52:51,561 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.36s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:53,770 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:55,481 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:56,721 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:57,954 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:00,113 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:02,268 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:02,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:53:02,268 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2022-07-13 14:53:02,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:53:02,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-13 14:53:02,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:53:02,321 INFO L225 Difference]: With dead ends: 61 [2022-07-13 14:53:02,321 INFO L226 Difference]: Without dead ends: 54 [2022-07-13 14:53:02,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:53:02,321 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 36 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:53:02,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 238 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 4 Unknown, 30 Unchecked, 13.5s Time] [2022-07-13 14:53:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-13 14:53:02,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-13 14:53:02,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 46 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:53:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-13 14:53:02,329 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 29 [2022-07-13 14:53:02,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:53:02,329 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-13 14:53:02,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:53:02,329 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-13 14:53:02,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-13 14:53:02,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:53:02,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:53:02,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-07-13 14:53:02,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:53:02,539 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:53:02,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:53:02,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1756186312, now seen corresponding path program 1 times [2022-07-13 14:53:02,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:53:02,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658492142] [2022-07-13 14:53:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:53:02,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:53:02,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:53:02,541 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:53:02,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 14:53:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:53:03,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-13 14:53:03,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:53:04,889 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 14:53:04,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-13 14:53:04,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-07-13 14:53:05,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:53:05,836 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:53:05,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-07-13 14:53:06,193 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 14:53:06,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-13 14:53:07,009 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-13 14:53:07,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-13 14:53:07,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 66 [2022-07-13 14:53:08,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 27 [2022-07-13 14:53:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:53:11,279 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 14:53:11,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 46 [2022-07-13 14:53:13,624 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-13 14:53:13,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:53:13,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:53:13,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1658492142] [2022-07-13 14:53:13,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1658492142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:53:13,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:53:13,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:53:13,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663678452] [2022-07-13 14:53:13,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:53:13,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 14:53:13,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:53:13,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 14:53:13,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:53:13,626 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:53:16,702 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:17,936 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:20,011 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:22,585 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:24,600 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:27,745 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:53:28,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:53:28,863 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-07-13 14:53:28,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:53:28,912 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-13 14:53:28,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:53:28,912 INFO L225 Difference]: With dead ends: 60 [2022-07-13 14:53:28,912 INFO L226 Difference]: Without dead ends: 51 [2022-07-13 14:53:28,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 18 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-07-13 14:53:28,913 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 19 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 79 IncrementalHoareTripleChecker+Unchecked, 14.7s IncrementalHoareTripleChecker+Time [2022-07-13 14:53:28,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 276 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 4 Unknown, 79 Unchecked, 14.7s Time] [2022-07-13 14:53:28,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-13 14:53:28,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-13 14:53:28,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 44 states have (on average 1.1818181818181819) internal successors, (52), 44 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-13 14:53:28,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-07-13 14:53:28,916 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 29 [2022-07-13 14:53:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:53:28,916 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-07-13 14:53:28,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:53:28,916 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-07-13 14:53:28,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-13 14:53:28,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:53:28,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:53:28,949 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-13 14:53:29,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:53:29,120 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:53:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:53:29,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1197063290, now seen corresponding path program 1 times [2022-07-13 14:53:29,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:53:29,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13747820] [2022-07-13 14:53:29,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:53:29,120 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:53:29,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:53:29,122 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:53:29,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-13 14:53:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:53:29,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:53:29,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:53:30,970 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-13 14:53:30,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:53:30,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:53:30,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13747820] [2022-07-13 14:53:30,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13747820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:53:30,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:53:30,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:53:30,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296317032] [2022-07-13 14:53:30,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:53:30,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:53:30,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:53:30,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:53:30,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:53:30,972 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:53:31,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:53:31,577 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-13 14:53:31,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:53:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-13 14:53:31,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:53:31,578 INFO L225 Difference]: With dead ends: 49 [2022-07-13 14:53:31,578 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:53:31,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:53:31,579 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 21 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:53:31,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 250 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 44 Unchecked, 0.0s Time] [2022-07-13 14:53:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:53:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:53:31,580 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-13 14:53:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:53:31,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-07-13 14:53:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:53:31,580 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:53:31,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-13 14:53:31,580 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:53:31,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:53:31,582 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:53:31,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 14:53:31,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:53:31,784 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:53:37,768 INFO L899 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:53:37,768 INFO L899 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:53:37,768 INFO L902 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2022-07-13 14:53:37,768 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:53:37,768 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:53:37,768 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L902 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2022-07-13 14:53:37,769 INFO L902 garLoopResultBuilder]: At program point L250(lines 229 251) the Hoare annotation is: true [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 215) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= currentRoundingMode roundNearestTiesToEven) (= (fp.sub roundNearestTiesToEven (fp.neg ~pi_o_2~0) ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 1000000000000000000000000000000.0)))) |ULTIMATE.start___ieee754_atan2f_#res#1|)) [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L220-1(lines 220 224) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:53:37,769 INFO L895 garLoopResultBuilder]: At program point L220-2(lines 220 224) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (select |#valid| (_ bv5 32)) (_ bv1 1)) (= |ULTIMATE.start_isfinite_float_~x#1| |ULTIMATE.start_main_~x~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (select |#valid| (_ bv4 32)) (_ bv1 1)) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))) [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L220-3(lines 220 224) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L895 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (exists ((|ULTIMATE.start___ieee754_atan2f_~hy~0#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~iy~0#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))))) (= (select |#valid| (_ bv5 32)) (_ bv1 1)) (exists ((|ULTIMATE.start___ieee754_atan2f_~hx~1#1| (_ BitVec 32))) (and (= |ULTIMATE.start___ieee754_atan2f_~ix~2#1| (bvand (_ bv2147483647 32) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (exists ((v_arrayElimCell_4 (_ BitVec 32))) (and (bvslt (bvand (_ bv2147483647 32) v_arrayElimCell_4) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hx~1#1|)) (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4))))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) (fp ((_ extract 31 31) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start___ieee754_atan2f_~hy~0#1|)))) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= (select |#valid| (_ bv4 32)) (_ bv1 1)) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L239(lines 239 248) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L239-2(lines 239 248) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:53:37,770 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L895 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (_ bv4 32))))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (bvadd (bvneg (select |#valid| (_ bv5 32))) (_ bv1 1)) (_ bv0 1)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)))) (and (bvslt (bvand (_ bv2147483647 32) .cse2) (_ bv2139095040 32)) (= |ULTIMATE.start___ieee754_atan2f_~x#1| (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))))) [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L895 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L895 garLoopResultBuilder]: At program point L226(lines 218 227) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (_ bv4 32))))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (bvadd (bvneg (select |#valid| (_ bv5 32))) (_ bv1 1)) (_ bv0 1)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (let ((.cse3 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32)))) (and (let ((.cse2 (bvslt (bvand (_ bv2147483647 32) .cse3) (_ bv2139095040 32)))) (or (and (not .cse2) (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv0 32))) (and .cse2 (= |ULTIMATE.start_isfinite_float_#res#1| (_ bv1 32))))) (= |ULTIMATE.start_main_~x~0#1| (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start_main_~y~0#1|))) [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-07-13 14:53:37,771 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L244(lines 244 247) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L245(line 245) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L895 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))) (let ((.cse0 (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (|v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6|) (_ bv0 32))) (.cse2 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (bvslt (bvand (_ bv2147483647 32) .cse1) (_ bv2139095040 32)) (= (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1))) (= (bvand (_ bv2147483647 32) .cse2) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|)))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (_ bv4 32))))) (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0)))) (= (bvadd (bvneg (select |#valid| (_ bv5 32))) (_ bv1 1)) (_ bv0 1)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse3 (select (select |#memory_int| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:53:37,772 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 245) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L895 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L895 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: (or (not (= (_ bv4 32) |~#atanhi_atan~0.base|)) (and (= |old(#valid)| |#valid|) (= |old(#memory_int)| |#memory_int|)) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (bvneg (select |old(#valid)| (_ bv4 32))) (_ bv1 1)))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |old(#valid)| (_ bv5 32))))) (not (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L895 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: (or (not (= (_ bv4 32) |~#atanhi_atan~0.base|)) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (and (= |old(#valid)| |#valid|) (= |atan_float_#in~x| atan_float_~x) (= |old(#memory_int)| |#memory_int|)) (not (= (_ bv0 1) (bvadd (bvneg (select |old(#valid)| (_ bv4 32))) (_ bv1 1)))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |old(#valid)| (_ bv5 32))))) (not (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (or (not (= (_ bv4 32) |~#atanhi_atan~0.base|)) (and (exists ((atan_float_~hx~0 (_ BitVec 32))) (and (not (bvsge (bvand (_ bv2147483647 32) atan_float_~hx~0) (_ bv1350565888 32))) (= |atan_float_#in~x| (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0))))) (= |atan_float_#in~x| atan_float_~x) (exists ((v_ArrVal_173 (Array (_ BitVec 32) (_ BitVec 32))) (|v_atan_float_~#gf_u~1.base_9| (_ BitVec 32))) (and (= (_ bv0 1) (select |old(#valid)| |v_atan_float_~#gf_u~1.base_9|)) (= (store |old(#memory_int)| |v_atan_float_~#gf_u~1.base_9| v_ArrVal_173) |#memory_int|))) (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| (_ bv4 32))))) (= (bvadd (bvneg (select |#valid| (_ bv5 32))) (_ bv1 1)) (_ bv0 1)) (= |atan_float_#in~x| (fp ((_ extract 31 31) atan_float_~hx~0) ((_ extract 30 23) atan_float_~hx~0) ((_ extract 22 0) atan_float_~hx~0)))) (not (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (not (= (let ((.cse0 (select (select |old(#memory_int)| |~#atanlo_atan~0.base|) (bvadd |~#atanlo_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 75497894159.0 1000000000000000000.0))))) (not (= (_ bv0 1) (bvadd (bvneg (select |old(#valid)| (_ bv4 32))) (_ bv1 1)))) (not (= currentRoundingMode roundNearestTiesToEven)) (not (= |~#atanlo_atan~0.base| (_ bv5 32))) (not (= ~pi_o_2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 2000000000.0))))) (not (= (_ bv0 1) (bvadd (_ bv1 1) (select |old(#valid)| (_ bv5 32))))) (not (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 15707962513.0 10000000000.0))) (let ((.cse1 (select (select |old(#memory_int)| |~#atanhi_atan~0.base|) (bvadd |~#atanhi_atan~0.offset| (_ bv12 32))))) (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)))))) [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-07-13 14:53:37,773 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-07-13 14:53:37,774 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:53:37,775 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:53:37,777 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:53:37,778 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:53:37,785 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,786 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,787 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,790 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,791 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,798 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,798 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,799 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,800 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,800 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,801 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,802 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,803 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,805 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,806 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,807 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,808 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,809 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,810 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,810 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,812 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,812 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,813 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,813 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:53:37 BoogieIcfgContainer [2022-07-13 14:53:37,823 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:53:37,824 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:53:37,824 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:53:37,824 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:53:37,824 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:29" (3/4) ... [2022-07-13 14:53:37,826 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:53:37,831 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2022-07-13 14:53:37,832 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2022-07-13 14:53:37,843 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 31 nodes and edges [2022-07-13 14:53:37,844 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-07-13 14:53:37,845 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 14:53:37,845 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:53:37,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && \valid[5bv32] == 1bv1) && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2022-07-13 14:53:37,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && \result == 1bv32)) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) [2022-07-13 14:53:37,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0])) [2022-07-13 14:53:37,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: (~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0])) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix)) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:53:37,862 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result [2022-07-13 14:53:37,863 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(4bv32 == atanhi_atan) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)))) || ((\old(\valid) == \valid && \old(x) == x) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) || !(0bv1 == ~bvadd64(~bvneg64(\old(\valid)[4bv32]), 1bv1))) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(atanlo_atan == 5bv32)) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000)))) || !(0bv1 == ~bvadd64(1bv1, \old(\valid)[5bv32]))) || !(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) [2022-07-13 14:53:37,888 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:53:37,888 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:53:37,889 INFO L158 Benchmark]: Toolchain (without parser) took 140659.39ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 42.8MB in the beginning and 24.4MB in the end (delta: 18.4MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,889 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:53:37,889 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.30ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 41.2MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,889 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.80ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 38.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,890 INFO L158 Benchmark]: Boogie Preprocessor took 49.29ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,890 INFO L158 Benchmark]: RCFGBuilder took 12114.30ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 45.0MB in the end (delta: -9.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,890 INFO L158 Benchmark]: TraceAbstraction took 128083.05ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 30.0MB in the end (delta: 14.1MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,890 INFO L158 Benchmark]: Witness Printer took 64.76ms. Allocated memory is still 77.6MB. Free memory was 30.0MB in the beginning and 24.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:53:37,891 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.17ms. Allocated memory is still 62.9MB. Free memory was 44.6MB in the beginning and 44.5MB in the end (delta: 52.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.30ms. Allocated memory is still 62.9MB. Free memory was 42.7MB in the beginning and 41.2MB in the end (delta: 1.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.80ms. Allocated memory is still 62.9MB. Free memory was 41.2MB in the beginning and 38.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.29ms. Allocated memory is still 62.9MB. Free memory was 38.6MB in the beginning and 36.0MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 12114.30ms. Allocated memory was 62.9MB in the beginning and 77.6MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 45.0MB in the end (delta: -9.3MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * TraceAbstraction took 128083.05ms. Allocated memory is still 77.6MB. Free memory was 44.1MB in the beginning and 30.0MB in the end (delta: 14.1MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Witness Printer took 64.76ms. Allocated memory is still 77.6MB. Free memory was 30.0MB in the beginning and 24.4MB in the end (delta: 5.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * 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: 245]: 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 3 procedures, 96 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 128.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 84.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 22 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 79.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 363 mSDsluCounter, 5125 SdHoareTripleChecker+Invalid, 77.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 396 IncrementalHoareTripleChecker+Unchecked, 4029 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 297 IncrementalHoareTripleChecker+Invalid, 720 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 1096 mSDtfsCounter, 297 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 311 GetRequests, 231 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 14.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=0, InterpolantAutomatonStates: 90, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 23 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 46 PreInvPairs, 58 NumberOfFragments, 1202 HoareAnnotationTreeSize, 46 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1155 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 9.3s SatisfiabilityAnalysisTime, 24.5s InterpolantComputationTime, 309 NumberOfCodeBlocks, 309 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 296 ConstructedInterpolants, 156 QuantifiedInterpolants, 5366 SizeOfPredicates, 94 NumberOfNonLiveVariables, 1835 ConjunctsInSsa, 167 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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: 198]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 218]: Loop Invariant [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,911 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,912 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,912 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: ((!~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && \result == 0bv32) || (~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && \result == 1bv32)) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) - InvariantResult [Line: 124]: Loop Invariant [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,913 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,914 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,915 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,915 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,922 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] Derived loop invariant: ((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: ~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && x == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0])) - InvariantResult [Line: 229]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 120]: Loop Invariant [2022-07-13 14:53:37,923 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,928 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,929 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~FLOAT(~roundNearestTiesToEven, ~fp.neg~FLOAT(pi_o_2), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1/1000000000000000000000000000000))) == \result - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant [2022-07-13 14:53:37,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,930 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((!(4bv32 == atanhi_atan) || !(tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)))) || !(~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)))) || ((\old(\valid) == \valid && \old(x) == x) && \old(unknown-#memory_int-unknown) == unknown-#memory_int-unknown)) || !(0bv1 == ~bvadd64(~bvneg64(\old(\valid)[4bv32]), 1bv1))) || !(unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven)) || !(atanlo_atan == 5bv32)) || !(pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000)))) || !(0bv1 == ~bvadd64(1bv1, \old(\valid)[5bv32]))) || !(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(\old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], \old(unknown-#memory_int-unknown)[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) - InvariantResult [Line: 130]: Loop Invariant [2022-07-13 14:53:37,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,931 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,932 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,933 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,933 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,933 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,934 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,935 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6,QUANTIFIED] [2022-07-13 14:53:37,935 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6 : bv32 :: (~bvslt32(~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32]), 2139095040bv32) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32][22:0]) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_isfinite_float_~#gf_u~5#1.base_6][0bv32][22:0])) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix)) && 4bv32 == atanhi_atan) && 0bv1 == ~bvadd64(1bv1, ~bvneg64(\valid[4bv32]))) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && ~bvadd64(~bvneg64(\valid[5bv32]), 1bv1) == 0bv1) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 220]: Loop Invariant [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:53:37,936 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && atanlo_atan == 5bv32) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 75497894159/1000000000000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanlo_atan][~bvadd64(atanlo_atan, 12bv32)][22:0])) && 4bv32 == atanhi_atan) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/2000000000))) && \valid[5bv32] == 1bv1) && x == x) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 15707962513/10000000000)) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][31:31], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][30:23], unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 12bv32)][22:0])) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) RESULT: Ultimate proved your program to be correct! [2022-07-13 14:53:38,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE