./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0685a.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_0685a.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 b47d8724c70e155baf18e623cd2101f66abd1b012fa19d34551ea9e1f3ceb9a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:20,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:20,678 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:20,697 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:20,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:20,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:20,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:20,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:20,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:20,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:20,715 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:20,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:20,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:20,719 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:20,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:20,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:20,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:20,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:20,727 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:20,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:20,733 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:20,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:20,734 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:20,735 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:20,736 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:20,740 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:20,740 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:20,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:20,741 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:20,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:20,742 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:20,743 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:20,744 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:20,744 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:20,745 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:20,745 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:20,746 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:20,746 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:20,746 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:20,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:20,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:20,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:20,749 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:20,778 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:20,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:20,780 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:20,780 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:20,781 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:20,781 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:20,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:20,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:20,782 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:20,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:20,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:20,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:20,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:20,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:20,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:20,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:20,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:20,786 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:20,786 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:20,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:20,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:20,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:20,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:20,788 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 -> b47d8724c70e155baf18e623cd2101f66abd1b012fa19d34551ea9e1f3ceb9a8 [2022-07-13 14:51:20,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:21,000 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:21,002 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:21,003 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:21,003 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:21,004 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0685a.c [2022-07-13 14:51:21,043 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0531d2af1/797f1c4d2c7d41c09ffe1c5f6be2d9d4/FLAGc4d287dfe [2022-07-13 14:51:21,386 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:21,386 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0685a.c [2022-07-13 14:51:21,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0531d2af1/797f1c4d2c7d41c09ffe1c5f6be2d9d4/FLAGc4d287dfe [2022-07-13 14:51:21,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0531d2af1/797f1c4d2c7d41c09ffe1c5f6be2d9d4 [2022-07-13 14:51:21,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:21,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:21,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:21,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:21,828 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:21,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:21" (1/1) ... [2022-07-13 14:51:21,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70ea67e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:21, skipping insertion in model container [2022-07-13 14:51:21,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:21" (1/1) ... [2022-07-13 14:51:21,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:21,863 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:22,007 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_0685a.c[5273,5286] [2022-07-13 14:51:22,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:22,022 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:22,048 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_0685a.c[5273,5286] [2022-07-13 14:51:22,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:22,061 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:22,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:22 WrapperNode [2022-07-13 14:51:22,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:22,062 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:22,062 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:22,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:22,067 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:22" (1/1) ... [2022-07-13 14:51:22,083 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:22" (1/1) ... [2022-07-13 14:51:22,106 INFO L137 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2022-07-13 14:51:22,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:22,111 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:22,111 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:22,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:22,117 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:22" (1/1) ... [2022-07-13 14:51:22,117 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:22" (1/1) ... [2022-07-13 14:51:22,120 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:22" (1/1) ... [2022-07-13 14:51:22,120 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:22" (1/1) ... [2022-07-13 14:51:22,129 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:22" (1/1) ... [2022-07-13 14:51:22,134 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:22" (1/1) ... [2022-07-13 14:51:22,136 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:22" (1/1) ... [2022-07-13 14:51:22,147 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:22,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:22,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:22,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:22,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:22" (1/1) ... [2022-07-13 14:51:22,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:22,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:22,173 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:22,181 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:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:51:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:22,210 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:22,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:22,210 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:22,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:22,344 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:22,712 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:22,717 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:22,717 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-13 14:51:22,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:22 BoogieIcfgContainer [2022-07-13 14:51:22,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:22,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:22,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:22,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:22,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:21" (1/3) ... [2022-07-13 14:51:22,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9349f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:22, skipping insertion in model container [2022-07-13 14:51:22,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:22" (2/3) ... [2022-07-13 14:51:22,724 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e9349f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:22, skipping insertion in model container [2022-07-13 14:51:22,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:22" (3/3) ... [2022-07-13 14:51:22,725 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0685a.c [2022-07-13 14:51:22,735 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:22,736 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:22,782 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:22,789 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@e692ff2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@523613eb [2022-07-13 14:51:22,789 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:22,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 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:22,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:51:22,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:22,800 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:22,800 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:22,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:22,807 INFO L85 PathProgramCache]: Analyzing trace with hash -817282921, now seen corresponding path program 1 times [2022-07-13 14:51:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:22,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413614597] [2022-07-13 14:51:22,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:22,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:22,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:22,956 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:22,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:22,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413614597] [2022-07-13 14:51:22,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413614597] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:22,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:22,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:22,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813044961] [2022-07-13 14:51:22,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:22,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:22,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:22,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:22,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:22,993 INFO L87 Difference]: Start difference. First operand has 103 states, 95 states have (on average 1.736842105263158) internal successors, (165), 96 states have internal predecessors, (165), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:23,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:23,033 INFO L93 Difference]: Finished difference Result 204 states and 348 transitions. [2022-07-13 14:51:23,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:23,035 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 14:51:23,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:23,041 INFO L225 Difference]: With dead ends: 204 [2022-07-13 14:51:23,042 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 14:51:23,045 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:23,048 INFO L413 NwaCegarLoop]: 152 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, 152 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:23,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 152 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:23,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 14:51:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-13 14:51:23,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 93 states have (on average 1.5161290322580645) internal successors, (141), 93 states have internal predecessors, (141), 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:23,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2022-07-13 14:51:23,093 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 10 [2022-07-13 14:51:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:23,094 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2022-07-13 14:51:23,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:23,095 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2022-07-13 14:51:23,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:51:23,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:23,096 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:23,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:51:23,097 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:23,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:23,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2028269105, now seen corresponding path program 1 times [2022-07-13 14:51:23,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:23,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405981057] [2022-07-13 14:51:23,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:23,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:23,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:23,212 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:23,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:23,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405981057] [2022-07-13 14:51:23,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405981057] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:23,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:23,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:51:23,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290216308] [2022-07-13 14:51:23,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:23,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:51:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:23,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:51:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:51:23,216 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:23,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:23,290 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2022-07-13 14:51:23,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:51:23,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-07-13 14:51:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:23,295 INFO L225 Difference]: With dead ends: 213 [2022-07-13 14:51:23,295 INFO L226 Difference]: Without dead ends: 142 [2022-07-13 14:51:23,300 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:23,301 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 57 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:23,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 418 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:51:23,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-13 14:51:23,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2022-07-13 14:51:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 120 states have (on average 1.55) internal successors, (186), 120 states have internal predecessors, (186), 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:23,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2022-07-13 14:51:23,314 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 12 [2022-07-13 14:51:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:23,315 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2022-07-13 14:51:23,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 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:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2022-07-13 14:51:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:51:23,320 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:23,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:23,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:51:23,320 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:23,326 INFO L85 PathProgramCache]: Analyzing trace with hash -595584804, now seen corresponding path program 1 times [2022-07-13 14:51:23,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:23,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605703784] [2022-07-13 14:51:23,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:23,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:23,382 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:51:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:23,440 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:51:23,440 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:51:23,441 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:51:23,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:51:23,445 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 14:51:23,447 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:51:23,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:51:23 BoogieIcfgContainer [2022-07-13 14:51:23,492 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:51:23,493 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:51:23,493 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:51:23,494 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:51:23,494 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:22" (3/4) ... [2022-07-13 14:51:23,496 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:51:23,496 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:51:23,497 INFO L158 Benchmark]: Toolchain (without parser) took 1672.01ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 71.8MB in the beginning and 104.4MB in the end (delta: -32.6MB). Peak memory consumption was 5.8MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,497 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:23,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.94ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 72.3MB in the end (delta: -762.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,498 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.78ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 69.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,501 INFO L158 Benchmark]: Boogie Preprocessor took 36.28ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 67.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,501 INFO L158 Benchmark]: RCFGBuilder took 571.36ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 67.1MB in the beginning and 111.1MB in the end (delta: -44.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,501 INFO L158 Benchmark]: TraceAbstraction took 772.06ms. Allocated memory is still 140.5MB. Free memory was 111.1MB in the beginning and 104.4MB in the end (delta: 6.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2022-07-13 14:51:23,501 INFO L158 Benchmark]: Witness Printer took 2.79ms. Allocated memory is still 140.5MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:23,503 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 100.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.94ms. Allocated memory is still 100.7MB. Free memory was 71.5MB in the beginning and 72.3MB in the end (delta: -762.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.78ms. Allocated memory is still 100.7MB. Free memory was 72.3MB in the beginning and 69.7MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.28ms. Allocated memory is still 100.7MB. Free memory was 69.7MB in the beginning and 67.1MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 571.36ms. Allocated memory was 100.7MB in the beginning and 140.5MB in the end (delta: 39.8MB). Free memory was 67.1MB in the beginning and 111.1MB in the end (delta: -44.0MB). Peak memory consumption was 24.9MB. Max. memory is 16.1GB. * TraceAbstraction took 772.06ms. Allocated memory is still 140.5MB. Free memory was 111.1MB in the beginning and 104.4MB in the end (delta: 6.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * Witness Printer took 2.79ms. Allocated memory is still 140.5MB. Free memory is still 104.4MB. 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: 229]: 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 228, overapproximation of someUnaryDOUBLEoperation at line 44, 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] [L222] float x = -1.0f / 0.0f; [L223] float y = 1.0f / 0.0f; [L225] CALL, EXPR __ieee754_atan2f(y, x) [L121] float z; [L122] __int32_t k, m, hx, hy, ix, iy; VAL [\old(x)=1000000000000000000000000000003, \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=1000000000000000000000000000003, 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)=1000000000000000000000000000003, \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=1000000000000000000000000000003, 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)=1000000000000000000000000000003, \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=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L136] COND TRUE ((ix) > 0x7f800000L) || ((iy) > 0x7f800000L) [L137] return x + y; VAL [\old(x)=1000000000000000000000000000003, \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=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L225] RET, EXPR __ieee754_atan2f(y, x) [L225] float res = __ieee754_atan2f(y, x); [L228] COND TRUE res != 3 * pi_o_4 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=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] [L229] 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=1000000000000000000000000000002, tiny_atan2=1/1000000000000000000000000000000, x=1000000000000000000000000000003, y=1000000000000000000000000000001, zero_atan2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 103 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, 59 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 57 mSDsluCounter, 570 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 265 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 34 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 305 mSDtfsCounter, 34 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=127occurred 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, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 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:23,535 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 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_0685a.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 b47d8724c70e155baf18e623cd2101f66abd1b012fa19d34551ea9e1f3ceb9a8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:25,138 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:25,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:25,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:25,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:25,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:25,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:25,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:25,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:25,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:25,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:25,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:25,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:25,193 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:25,194 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:25,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:25,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:25,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:25,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:25,207 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:25,209 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:25,209 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:25,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:25,211 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:25,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:25,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:25,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:25,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:25,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:25,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:25,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:25,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:25,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:25,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:25,219 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:25,220 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:25,220 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:25,220 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:25,221 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:25,221 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:25,221 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:25,222 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:25,223 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:25,247 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:25,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:25,248 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:25,248 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:25,249 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:25,249 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:25,250 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:25,250 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:25,250 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:25,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:25,251 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:25,252 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:25,252 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:25,253 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:25,253 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:25,253 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:25,253 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:25,253 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:25,253 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:25,254 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:51:25,254 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 -> b47d8724c70e155baf18e623cd2101f66abd1b012fa19d34551ea9e1f3ceb9a8 [2022-07-13 14:51:25,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:25,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:25,528 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:25,529 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:25,529 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:25,531 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0685a.c [2022-07-13 14:51:25,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee488a0/fe6174a4076440c086d3b38575090c6d/FLAG819f12ea7 [2022-07-13 14:51:25,924 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:25,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0685a.c [2022-07-13 14:51:25,929 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee488a0/fe6174a4076440c086d3b38575090c6d/FLAG819f12ea7 [2022-07-13 14:51:25,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/adee488a0/fe6174a4076440c086d3b38575090c6d [2022-07-13 14:51:25,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:25,947 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:25,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:25,948 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:25,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:25,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:25" (1/1) ... [2022-07-13 14:51:25,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c68050c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:25, skipping insertion in model container [2022-07-13 14:51:25,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:25" (1/1) ... [2022-07-13 14:51:25,958 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:25,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:26,155 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_0685a.c[5273,5286] [2022-07-13 14:51:26,157 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:26,171 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:26,227 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_0685a.c[5273,5286] [2022-07-13 14:51:26,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:26,248 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:26,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:26 WrapperNode [2022-07-13 14:51:26,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:26,249 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:26,249 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:26,250 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:26,256 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:26" (1/1) ... [2022-07-13 14:51:26,281 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:26" (1/1) ... [2022-07-13 14:51:26,306 INFO L137 Inliner]: procedures = 22, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 217 [2022-07-13 14:51:26,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:26,308 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:26,308 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:26,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:26,314 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:26" (1/1) ... [2022-07-13 14:51:26,315 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:26" (1/1) ... [2022-07-13 14:51:26,327 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:26" (1/1) ... [2022-07-13 14:51:26,327 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:26" (1/1) ... [2022-07-13 14:51:26,343 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:26" (1/1) ... [2022-07-13 14:51:26,355 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:26" (1/1) ... [2022-07-13 14:51:26,359 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:26" (1/1) ... [2022-07-13 14:51:26,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:26,369 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:26,369 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:26,370 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:26,371 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:26" (1/1) ... [2022-07-13 14:51:26,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:26,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:26,391 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:26,407 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:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-13 14:51:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:51:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:26,427 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-13 14:51:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:51:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-13 14:51:26,428 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:26,428 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:51:26,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:26,543 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:26,544 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:36,487 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:36,491 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:36,492 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-13 14:51:36,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:36 BoogieIcfgContainer [2022-07-13 14:51:36,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:36,495 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:36,495 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:36,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:36,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:25" (1/3) ... [2022-07-13 14:51:36,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4543ecf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:36, skipping insertion in model container [2022-07-13 14:51:36,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:26" (2/3) ... [2022-07-13 14:51:36,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4543ecf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:36, skipping insertion in model container [2022-07-13 14:51:36,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:36" (3/3) ... [2022-07-13 14:51:36,500 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0685a.c [2022-07-13 14:51:36,510 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:36,511 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:36,543 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:36,548 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@575692a9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78ba2241 [2022-07-13 14:51:36,548 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 82 states have (on average 1.6585365853658536) internal successors, (136), 83 states have internal predecessors, (136), 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:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:51:36,559 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:36,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:36,560 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:36,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1138107774, now seen corresponding path program 1 times [2022-07-13 14:51:36,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:36,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [408388954] [2022-07-13 14:51:36,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:36,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:36,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:36,576 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:36,577 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:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:37,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:51:37,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:37,393 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,393 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:37,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:37,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [408388954] [2022-07-13 14:51:37,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [408388954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:37,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:37,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665434259] [2022-07-13 14:51:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:37,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:37,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:37,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:37,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:37,430 INFO L87 Difference]: Start difference. First operand has 90 states, 82 states have (on average 1.6585365853658536) internal successors, (136), 83 states have internal predecessors, (136), 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:37,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:37,468 INFO L93 Difference]: Finished difference Result 178 states and 290 transitions. [2022-07-13 14:51:37,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:37,469 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-13 14:51:37,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:37,476 INFO L225 Difference]: With dead ends: 178 [2022-07-13 14:51:37,477 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 14:51:37,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 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:37,482 INFO L413 NwaCegarLoop]: 129 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, 129 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:37,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 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:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 14:51:37,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 14:51:37,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.475) internal successors, (118), 80 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:51:37,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2022-07-13 14:51:37,513 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 10 [2022-07-13 14:51:37,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:37,513 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2022-07-13 14:51:37,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:37,513 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2022-07-13 14:51:37,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:51:37,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:37,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:37,547 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:37,719 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:37,720 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:37,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1466192473, now seen corresponding path program 1 times [2022-07-13 14:51:37,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:37,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1777828214] [2022-07-13 14:51:37,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:37,722 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:37,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:37,724 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:37,726 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:38,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:38,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 14:51:38,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:38,679 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:39,061 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:51:39,500 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:39,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:39,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:39,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1777828214] [2022-07-13 14:51:39,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1777828214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:39,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:39,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:51:39,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530987500] [2022-07-13 14:51:39,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:39,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:51:39,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:39,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:51:39,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:39,502 INFO L87 Difference]: Start difference. First operand 87 states and 126 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:39,521 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-07-13 14:51:39,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:51:39,521 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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 12 [2022-07-13 14:51:39,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:39,522 INFO L225 Difference]: With dead ends: 91 [2022-07-13 14:51:39,522 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 14:51:39,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:39,523 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 0 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:39,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 655 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 67 Unchecked, 0.0s Time] [2022-07-13 14:51:39,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 14:51:39,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 14:51:39,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 80 states have (on average 1.4625) internal successors, (117), 80 states have internal predecessors, (117), 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:39,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2022-07-13 14:51:39,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 12 [2022-07-13 14:51:39,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:39,530 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2022-07-13 14:51:39,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 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:39,530 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2022-07-13 14:51:39,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:39,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:39,531 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:39,559 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-07-13 14:51:39,735 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:39,740 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:39,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:39,741 INFO L85 PathProgramCache]: Analyzing trace with hash -369945613, now seen corresponding path program 1 times [2022-07-13 14:51:39,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:39,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427545753] [2022-07-13 14:51:39,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:39,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:39,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:39,743 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:39,743 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:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:40,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:40,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:40,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-13 14:51:40,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:40,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:40,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427545753] [2022-07-13 14:51:40,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427545753] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:40,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:40,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:40,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832279975] [2022-07-13 14:51:40,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:40,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:40,935 INFO L87 Difference]: Start difference. First operand 87 states and 125 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:40,942 INFO L93 Difference]: Finished difference Result 159 states and 227 transitions. [2022-07-13 14:51:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:40,942 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:40,943 INFO L225 Difference]: With dead ends: 159 [2022-07-13 14:51:40,943 INFO L226 Difference]: Without dead ends: 85 [2022-07-13 14:51:40,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:51:40,944 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 5 mSDsluCounter, 314 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:40,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 427 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-07-13 14:51:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-13 14:51:40,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-13 14:51:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 74 states have (on average 1.4324324324324325) internal successors, (106), 74 states have internal predecessors, (106), 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:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2022-07-13 14:51:40,965 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 17 [2022-07-13 14:51:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:40,965 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2022-07-13 14:51:40,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2022-07-13 14:51:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:40,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:40,967 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:40,994 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:41,179 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:41,180 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:41,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:41,180 INFO L85 PathProgramCache]: Analyzing trace with hash 2028116593, now seen corresponding path program 1 times [2022-07-13 14:51:41,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:41,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780450829] [2022-07-13 14:51:41,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:41,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:41,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:41,182 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:41,184 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:51:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:41,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:41,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:42,424 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:42,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:42,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:42,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780450829] [2022-07-13 14:51:42,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780450829] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:42,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:42,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:42,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937126121] [2022-07-13 14:51:42,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:42,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:42,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:42,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:42,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:42,426 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:42,437 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2022-07-13 14:51:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:42,440 INFO L225 Difference]: With dead ends: 89 [2022-07-13 14:51:42,440 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 14:51:42,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:42,443 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 413 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:51:42,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 413 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-13 14:51:42,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 14:51:42,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-07-13 14:51:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 states have internal predecessors, (102), 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:42,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2022-07-13 14:51:42,460 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 17 [2022-07-13 14:51:42,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:42,461 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2022-07-13 14:51:42,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:42,462 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-07-13 14:51:42,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:51:42,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:42,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:42,495 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:51:42,689 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:51:42,689 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:42,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:42,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1893883166, now seen corresponding path program 1 times [2022-07-13 14:51:42,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:42,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1183683283] [2022-07-13 14:51:42,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:42,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:42,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:42,692 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:51:42,693 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:51:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:43,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:51:43,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:44,076 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:44,076 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:44,076 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:44,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1183683283] [2022-07-13 14:51:44,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1183683283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:44,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:44,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:51:44,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475704294] [2022-07-13 14:51:44,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:44,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:51:44,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:44,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:51:44,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:51:44,077 INFO L87 Difference]: Start difference. First operand 79 states and 110 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:44,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:44,662 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-07-13 14:51:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:51:44,666 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-07-13 14:51:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:44,667 INFO L225 Difference]: With dead ends: 96 [2022-07-13 14:51:44,667 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 14:51:44,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:51:44,668 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 14 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:44,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 495 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 25 Unchecked, 0.6s Time] [2022-07-13 14:51:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 14:51:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2022-07-13 14:51:44,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 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:44,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-07-13 14:51:44,680 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 18 [2022-07-13 14:51:44,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:44,680 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-07-13 14:51:44,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:44,681 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-07-13 14:51:44,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:51:44,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:44,682 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:44,712 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:51:44,891 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:51:44,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:44,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:44,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1871003678, now seen corresponding path program 1 times [2022-07-13 14:51:44,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1564474323] [2022-07-13 14:51:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:44,893 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:44,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:44,894 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:51:44,895 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:51:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:45,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:45,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:46,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:51:46,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:46,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:46,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1564474323] [2022-07-13 14:51:46,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1564474323] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:46,147 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:46,147 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:46,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337220440] [2022-07-13 14:51:46,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:46,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:46,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:46,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:46,148 INFO L87 Difference]: Start difference. First operand 79 states and 109 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:46,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:46,165 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2022-07-13 14:51:46,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:46,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 18 [2022-07-13 14:51:46,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:46,166 INFO L225 Difference]: With dead ends: 137 [2022-07-13 14:51:46,166 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 14:51:46,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 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:51:46,167 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 6 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 358 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:51:46,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 358 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-13 14:51:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 14:51:46,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-07-13 14:51:46,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 67 states have internal predecessors, (91), 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:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2022-07-13 14:51:46,177 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 18 [2022-07-13 14:51:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:46,178 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2022-07-13 14:51:46,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2022-07-13 14:51:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 14:51:46,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:46,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:46,211 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:51:46,381 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:51:46,381 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1889067684, now seen corresponding path program 1 times [2022-07-13 14:51:46,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:46,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1090520588] [2022-07-13 14:51:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:46,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:46,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:46,383 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:51:46,384 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:51:47,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:47,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:47,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:47,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:47,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:47,611 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:47,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1090520588] [2022-07-13 14:51:47,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1090520588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:47,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:47,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:47,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171834589] [2022-07-13 14:51:47,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:47,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:47,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:47,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:47,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:47,612 INFO L87 Difference]: Start difference. First operand 74 states and 99 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:47,615 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2022-07-13 14:51:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 14:51:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:47,616 INFO L225 Difference]: With dead ends: 131 [2022-07-13 14:51:47,616 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 14:51:47,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:47,617 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 5 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:47,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 363 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-13 14:51:47,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 14:51:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-07-13 14:51:47,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 67 states have internal predecessors, (90), 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:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-07-13 14:51:47,628 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 19 [2022-07-13 14:51:47,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:47,629 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-07-13 14:51:47,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-07-13 14:51:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 14:51:47,629 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:47,629 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:47,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-13 14:51:47,829 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:51:47,830 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:47,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1417522822, now seen corresponding path program 1 times [2022-07-13 14:51:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:47,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744995142] [2022-07-13 14:51:47,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:47,831 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:47,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:47,832 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:51:47,834 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:51:48,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:48,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:51:48,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:49,485 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:49,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:49,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:49,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744995142] [2022-07-13 14:51:49,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744995142] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:49,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:49,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:51:49,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553164167] [2022-07-13 14:51:49,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:49,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:51:49,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:49,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:51:49,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:49,486 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:49,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:49,964 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-07-13 14:51:49,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:51:49,964 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-13 14:51:49,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:49,965 INFO L225 Difference]: With dead ends: 78 [2022-07-13 14:51:49,965 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 14:51:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:49,966 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:49,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 507 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 28 Unchecked, 0.5s Time] [2022-07-13 14:51:49,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 14:51:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 14:51:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.328358208955224) internal successors, (89), 67 states have internal predecessors, (89), 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:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-07-13 14:51:49,969 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 19 [2022-07-13 14:51:49,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:49,969 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-07-13 14:51:49,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-07-13 14:51:49,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:51:49,970 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:49,970 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:50,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 14:51:50,171 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:51:50,172 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:50,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:50,172 INFO L85 PathProgramCache]: Analyzing trace with hash 992042301, now seen corresponding path program 1 times [2022-07-13 14:51:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:50,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18638964] [2022-07-13 14:51:50,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:50,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:50,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:50,174 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:51:50,174 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:51:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:51,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 14:51:51,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:54,575 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:54,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:54,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:54,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18638964] [2022-07-13 14:51:54,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18638964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:54,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:54,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:51:54,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709610920] [2022-07-13 14:51:54,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:54,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:54,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:54,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:54,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:54,577 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:51:59,054 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s 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:01,834 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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:03,304 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s 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:05,311 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s 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:07,408 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s 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:09,419 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:52:11,422 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s 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:12,511 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:14,035 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:16,915 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:52:19,865 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s 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:21,107 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s 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:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:21,912 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2022-07-13 14:52:21,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:52:21,913 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-13 14:52:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:21,914 INFO L225 Difference]: With dead ends: 81 [2022-07-13 14:52:21,914 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 14:52:21,914 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:21,915 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 75 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.1s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:21,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 206 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 8 Unknown, 0 Unchecked, 26.1s Time] [2022-07-13 14:52:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 14:52:21,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-13 14:52:21,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 67 states have internal predecessors, (88), 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:21,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2022-07-13 14:52:21,922 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2022-07-13 14:52:21,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:21,923 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2022-07-13 14:52:21,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2022-07-13 14:52:21,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 14:52:21,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:21,925 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] [2022-07-13 14:52:21,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-07-13 14:52:22,125 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:22,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:22,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:22,126 INFO L85 PathProgramCache]: Analyzing trace with hash 687196993, now seen corresponding path program 1 times [2022-07-13 14:52:22,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:22,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1727011642] [2022-07-13 14:52:22,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:22,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:22,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:22,128 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:22,131 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:22,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:22,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 14:52:22,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:23,042 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:23,288 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 35 treesize of output 19 [2022-07-13 14:52:24,214 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:24,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:24,214 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:24,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1727011642] [2022-07-13 14:52:24,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1727011642] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:24,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:24,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:52:24,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938312616] [2022-07-13 14:52:24,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:24,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:52:24,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:24,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:52:24,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:24,215 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:24,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:24,228 INFO L93 Difference]: Finished difference Result 108 states and 139 transitions. [2022-07-13 14:52:24,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:52:24,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-13 14:52:24,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:24,230 INFO L225 Difference]: With dead ends: 108 [2022-07-13 14:52:24,230 INFO L226 Difference]: Without dead ends: 46 [2022-07-13 14:52:24,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:24,231 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 22 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:24,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 22 Unchecked, 0.0s Time] [2022-07-13 14:52:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-13 14:52:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-13 14:52:24,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.2682926829268293) internal successors, (52), 41 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:52:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2022-07-13 14:52:24,235 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 21 [2022-07-13 14:52:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:24,236 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2022-07-13 14:52:24,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:24,236 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2022-07-13 14:52:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 14:52:24,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:24,236 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:24,265 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:24,437 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:24,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:24,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1381153585, now seen corresponding path program 1 times [2022-07-13 14:52:24,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:24,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83355536] [2022-07-13 14:52:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:24,438 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:24,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:24,439 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:24,439 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:25,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:25,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:52:25,182 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:25,437 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:25,437 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:25,437 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:25,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83355536] [2022-07-13 14:52:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83355536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:25,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:52:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012404999] [2022-07-13 14:52:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:25,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:52:25,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:25,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:52:25,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:52:25,438 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:25,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:25,439 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-07-13 14:52:25,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:52:25,440 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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 23 [2022-07-13 14:52:25,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:25,440 INFO L225 Difference]: With dead ends: 46 [2022-07-13 14:52:25,440 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:52:25,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:52:25,440 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:25,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 3 Unchecked, 0.0s Time] [2022-07-13 14:52:25,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:52:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:52:25,442 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:52:25,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:52:25,442 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2022-07-13 14:52:25,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:25,442 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:52:25,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 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:25,442 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:52:25,442 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:52:25,444 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:52:25,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:25,668 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:52:25,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:52:27,073 INFO L899 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:27,073 INFO L899 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:27,073 INFO L902 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2022-07-13 14:52:27,073 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:52:27,073 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:27,073 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L902 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2022-07-13 14:52:27,074 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L895 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-13 14:52:27,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L895 garLoopResultBuilder]: At program point L120(lines 120 215) the Hoare annotation is: (let ((.cse0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0))))) (and (= ~tiny_atan2~0 .cse0) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (= (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 3.0)) ~pi_o_4~0) .cse0) |ULTIMATE.start___ieee754_atan2f_#res#1|) (= currentRoundingMode roundNearestTiesToEven))) [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L228(lines 228 231) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-07-13 14:52:27,075 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L229(line 229) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L895 garLoopResultBuilder]: At program point L130-2(lines 130 134) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse1 ((_ to_fp 8 24) currentRoundingMode 1.0)) (.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6|) (_ bv0 32)))) (and (= (bvand (_ bv2147483647 32) .cse0) |ULTIMATE.start___ieee754_atan2f_~ix~2#1|) (= (fp.div currentRoundingMode .cse1 (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (= (fp.div currentRoundingMode (fp.neg .cse1) (_ +zero 8 24)) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (exists ((currentRoundingMode RoundingMode) (|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19| (_ BitVec 32))) (let ((.cse3 ((_ to_fp 8 24) currentRoundingMode 1.0)) (.cse2 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19|) (_ bv0 32)))) (and (= .cse2 |ULTIMATE.start___ieee754_atan2f_~hx~1#1|) (= (fp.div currentRoundingMode .cse3 (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|) (= (fp.div currentRoundingMode (fp.neg .cse3) (_ +zero 8 24)) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-07-13 14:52:27,076 INFO L895 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: false [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 229) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2022-07-13 14:52:27,077 INFO L895 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L895 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (and (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 8 24) currentRoundingMode 1.0) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~x#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-13 14:52:27,078 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L902 garLoopResultBuilder]: At program point L233(lines 217 234) the Hoare annotation is: true [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L902 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: true [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:52:27,079 INFO L902 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: true [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2022-07-13 14:52:27,080 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:52:27,081 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:52:27,083 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:27,085 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:52:27,090 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,091 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,095 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,101 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,102 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,109 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:52:27,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,110 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:52:27,110 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:52:27,110 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:52:27,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,110 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,111 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,113 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,113 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,120 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:52:27,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,121 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:52:27,121 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:52:27,121 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:52:27,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,122 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:52:27 BoogieIcfgContainer [2022-07-13 14:52:27,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:52:27,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:52:27,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:52:27,124 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:52:27,124 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:36" (3/4) ... [2022-07-13 14:52:27,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:52:27,131 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2022-07-13 14:52:27,131 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2022-07-13 14:52:27,140 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-13 14:52:27,141 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 14:52:27,141 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 14:52:27,141 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:52:27,160 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_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:52:27,161 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)) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: (~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~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]))) && (\exists currentRoundingMode : FloatRoundingMode, v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32] == hx && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][22:0]))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:52:27,161 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_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.mul~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3.0)), pi_o_4), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:52:27,194 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:52:27,195 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:52:27,195 INFO L158 Benchmark]: Toolchain (without parser) took 61248.75ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 47.8MB in the beginning and 34.2MB in the end (delta: 13.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,196 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:52:27,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.50ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.4MB in the end (delta: 221.8kB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.92ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,197 INFO L158 Benchmark]: Boogie Preprocessor took 59.88ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 42.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,197 INFO L158 Benchmark]: RCFGBuilder took 10124.58ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 42.3MB in the beginning and 52.6MB in the end (delta: -10.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,198 INFO L158 Benchmark]: TraceAbstraction took 50628.57ms. Allocated memory is still 83.9MB. Free memory was 51.9MB in the beginning and 39.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,198 INFO L158 Benchmark]: Witness Printer took 71.15ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 34.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:52:27,203 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 67.1MB. Free memory was 49.5MB in the beginning and 49.4MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.50ms. Allocated memory is still 67.1MB. Free memory was 47.6MB in the beginning and 47.4MB in the end (delta: 221.8kB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.92ms. Allocated memory is still 67.1MB. Free memory was 47.4MB in the beginning and 44.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.88ms. Allocated memory is still 67.1MB. Free memory was 44.9MB in the beginning and 42.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 10124.58ms. Allocated memory was 67.1MB in the beginning and 83.9MB in the end (delta: 16.8MB). Free memory was 42.3MB in the beginning and 52.6MB in the end (delta: -10.3MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * TraceAbstraction took 50628.57ms. Allocated memory is still 83.9MB. Free memory was 51.9MB in the beginning and 39.7MB in the end (delta: 12.2MB). Peak memory consumption was 12.4MB. Max. memory is 16.1GB. * Witness Printer took 71.15ms. Allocated memory is still 83.9MB. Free memory was 39.7MB in the beginning and 34.2MB in the end (delta: 5.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - 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[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 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[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[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 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___ieee754_atan2f_~#gf_u~2#1.base_19,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,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___ieee754_atan2f_~#gf_u~2#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 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___ieee754_atan2f_~#gf_u~2#1.base_19,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 229]: 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, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 50.6s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 8 mSolverCounterUnknown, 118 SdHoareTripleChecker+Valid, 27.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 110 mSDsluCounter, 3870 SdHoareTripleChecker+Invalid, 26.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 203 IncrementalHoareTripleChecker+Unchecked, 2875 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 995 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 185 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, InterpolantAutomatonStates: 58, 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, 11 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 51 PreInvPairs, 55 NumberOfFragments, 190 HoareAnnotationTreeSize, 51 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 67 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 7.5s SatisfiabilityAnalysisTime, 10.0s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 183 ConstructedInterpolants, 96 QuantifiedInterpolants, 2641 SizeOfPredicates, 78 NumberOfNonLiveVariables, 1318 ConjunctsInSsa, 117 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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: 124]: Loop Invariant [2022-07-13 14:52:27,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,219 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,219 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,220 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,220 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_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 120]: Loop Invariant [2022-07-13 14:52:27,221 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,221 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_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.mul~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3.0)), pi_o_4), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) == \result) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant [2022-07-13 14:52:27,222 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:52:27,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,222 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,223 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:52:27,223 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:52:27,223 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:52:27,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,223 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,224 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,224 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:27,225 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:52:27,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,225 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,225 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:52:27,225 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:52:27,226 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:52:27,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:27,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19,QUANTIFIED] [2022-07-13 14:52:27,227 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)) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6 : bv32, currentRoundingMode : FloatRoundingMode :: (~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6][0bv32]) == ix && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~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]))) && (\exists currentRoundingMode : FloatRoundingMode, v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19 : bv32 :: (unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32] == hx && ~fp.div~FLOAT(currentRoundingMode, ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0), ~Pluszero~LONGDOUBLE()) == y) && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_19][0bv32][22:0]))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-13 14:52:27,381 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 Writing output log to file Ultimate.log Result: TRUE