./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0685b.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_0685b.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 cdda62b63fa4d692099c5c94751a7c724c7a2bb15acfaa2811161fc559f30277 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:25,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:25,843 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:25,874 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:25,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:25,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:25,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:25,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:25,879 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:25,879 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:25,880 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:25,881 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:25,881 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:25,882 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:25,883 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:25,887 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:25,888 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:25,892 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:25,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:25,902 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:25,905 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:25,906 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:25,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:25,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:25,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:25,917 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:25,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:25,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:25,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:25,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:25,919 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:25,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:25,921 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:25,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:25,922 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:25,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:25,923 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:25,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:25,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:25,924 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:25,925 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:25,926 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:25,928 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:25,950 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:25,950 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:25,951 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:25,951 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:25,951 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:25,952 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:25,952 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:25,952 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:25,952 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:25,953 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:25,953 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:25,953 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:51:25,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:25,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:25,955 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:25,955 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:25,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:25,956 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:25,956 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:25,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:25,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:25,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:25,956 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:25,957 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:51:25,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:51:25,957 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:25,957 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:25,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:25,957 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 -> cdda62b63fa4d692099c5c94751a7c724c7a2bb15acfaa2811161fc559f30277 [2022-07-13 14:51:26,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:26,162 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:26,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:26,164 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:26,166 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:26,167 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0685b.c [2022-07-13 14:51:26,211 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff243cda/4d56da84746940b8b9efeb87c712d63c/FLAG809d763b7 [2022-07-13 14:51:26,593 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:26,594 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0685b.c [2022-07-13 14:51:26,600 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff243cda/4d56da84746940b8b9efeb87c712d63c/FLAG809d763b7 [2022-07-13 14:51:26,611 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ff243cda/4d56da84746940b8b9efeb87c712d63c [2022-07-13 14:51:26,613 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:26,614 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:26,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:26,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:26,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:26,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:26" (1/1) ... [2022-07-13 14:51:26,619 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33ea9526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:26, skipping insertion in model container [2022-07-13 14:51:26,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:26" (1/1) ... [2022-07-13 14:51:26,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:26,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:26,809 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_0685b.c[5277,5290] [2022-07-13 14:51:26,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:26,818 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:26,877 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_0685b.c[5277,5290] [2022-07-13 14:51:26,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:26,895 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:26,896 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,896 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:26,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:26,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:26,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:26,902 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,910 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,932 INFO L137 Inliner]: procedures = 19, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2022-07-13 14:51:26,932 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:26,933 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:26,933 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:26,933 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:26,939 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,940 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,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:26" (1/1) ... [2022-07-13 14:51:26,944 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,953 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,957 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,960 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,964 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:26,964 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:26,965 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:26,965 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:26,965 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,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:26,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:26,991 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,995 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:27,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:51:27,033 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:27,034 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:27,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:51:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-13 14:51:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:27,034 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:27,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:27,100 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:27,101 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:27,436 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:27,442 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:27,442 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-13 14:51:27,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:27 BoogieIcfgContainer [2022-07-13 14:51:27,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:27,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:27,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:27,448 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:27,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:26" (1/3) ... [2022-07-13 14:51:27,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1495fbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:27, skipping insertion in model container [2022-07-13 14:51:27,449 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:27,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1495fbbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:27, skipping insertion in model container [2022-07-13 14:51:27,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:27" (3/3) ... [2022-07-13 14:51:27,451 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0685b.c [2022-07-13 14:51:27,462 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:27,462 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:27,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:27,503 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@3457def9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3327ff26 [2022-07-13 14:51:27,504 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:27,507 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:27,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:51:27,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:27,513 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:27,514 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:27,518 INFO L85 PathProgramCache]: Analyzing trace with hash -817282921, now seen corresponding path program 1 times [2022-07-13 14:51:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:27,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008329601] [2022-07-13 14:51:27,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:27,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:27,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:27,623 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:27,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:27,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008329601] [2022-07-13 14:51:27,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008329601] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:27,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:27,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:27,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844702225] [2022-07-13 14:51:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:27,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:27,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:27,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:27,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:27,651 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:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:27,678 INFO L93 Difference]: Finished difference Result 204 states and 348 transitions. [2022-07-13 14:51:27,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:27,680 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:27,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:27,685 INFO L225 Difference]: With dead ends: 204 [2022-07-13 14:51:27,686 INFO L226 Difference]: Without dead ends: 100 [2022-07-13 14:51:27,689 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:27,692 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:27,693 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:27,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-13 14:51:27,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-07-13 14:51:27,722 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:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2022-07-13 14:51:27,725 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 10 [2022-07-13 14:51:27,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:27,725 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2022-07-13 14:51:27,726 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:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2022-07-13 14:51:27,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:51:27,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:27,727 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:27,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:51:27,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:27,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:27,728 INFO L85 PathProgramCache]: Analyzing trace with hash -2028269105, now seen corresponding path program 1 times [2022-07-13 14:51:27,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:27,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086686535] [2022-07-13 14:51:27,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:27,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:27,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:27,798 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:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:51:27,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086686535] [2022-07-13 14:51:27,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086686535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:27,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:27,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:51:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409571236] [2022-07-13 14:51:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:27,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:51:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:51:27,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:51:27,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:51:27,801 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:27,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:27,847 INFO L93 Difference]: Finished difference Result 213 states and 318 transitions. [2022-07-13 14:51:27,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:51:27,848 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:27,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:27,849 INFO L225 Difference]: With dead ends: 213 [2022-07-13 14:51:27,850 INFO L226 Difference]: Without dead ends: 142 [2022-07-13 14:51:27,850 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:27,851 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:27,852 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:27,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-13 14:51:27,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 127. [2022-07-13 14:51:27,878 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:27,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 194 transitions. [2022-07-13 14:51:27,880 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 194 transitions. Word has length 12 [2022-07-13 14:51:27,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:27,880 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 194 transitions. [2022-07-13 14:51:27,880 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:27,880 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 194 transitions. [2022-07-13 14:51:27,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-13 14:51:27,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:27,881 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:27,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:51:27,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:27,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:27,882 INFO L85 PathProgramCache]: Analyzing trace with hash -595584804, now seen corresponding path program 1 times [2022-07-13 14:51:27,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:51:27,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871021651] [2022-07-13 14:51:27,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:27,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:51:27,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:27,914 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:51:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:51:27,953 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:51:27,954 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:51:27,955 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:51:27,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-13 14:51:27,959 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-13 14:51:27,962 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:51:27,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:51:27 BoogieIcfgContainer [2022-07-13 14:51:27,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:51:27,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:51:27,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:51:27,988 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:51:27,988 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:27" (3/4) ... [2022-07-13 14:51:27,990 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:51:27,990 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:51:27,991 INFO L158 Benchmark]: Toolchain (without parser) took 1376.70ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 54.7MB in the beginning and 67.4MB in the end (delta: -12.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,992 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 86.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:27,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 280.51ms. Allocated memory is still 86.0MB. Free memory was 54.4MB in the beginning and 59.6MB in the end (delta: -5.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.82ms. Allocated memory is still 86.0MB. Free memory was 59.6MB in the beginning and 57.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,993 INFO L158 Benchmark]: Boogie Preprocessor took 30.80ms. Allocated memory is still 86.0MB. Free memory was 57.2MB in the beginning and 54.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,993 INFO L158 Benchmark]: RCFGBuilder took 479.54ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 54.7MB in the beginning and 80.7MB in the end (delta: -26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,994 INFO L158 Benchmark]: TraceAbstraction took 541.54ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 67.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-07-13 14:51:27,994 INFO L158 Benchmark]: Witness Printer took 3.36ms. Allocated memory is still 104.9MB. Free memory is still 67.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:51:27,996 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.18ms. Allocated memory is still 86.0MB. Free memory was 42.6MB in the beginning and 42.6MB in the end (delta: 34.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 280.51ms. Allocated memory is still 86.0MB. Free memory was 54.4MB in the beginning and 59.6MB in the end (delta: -5.2MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.82ms. Allocated memory is still 86.0MB. Free memory was 59.6MB in the beginning and 57.2MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.80ms. Allocated memory is still 86.0MB. Free memory was 57.2MB in the beginning and 54.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 479.54ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 54.7MB in the beginning and 80.7MB in the end (delta: -26.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 541.54ms. Allocated memory is still 104.9MB. Free memory was 80.2MB in the beginning and 67.4MB in the end (delta: 12.9MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * Witness Printer took 3.36ms. Allocated memory is still 104.9MB. Free memory is still 67.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: 231]: 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 230, 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] [L224] float x = -1.0f / 0.0f; [L225] float y = -1.0f / 0.0f; [L227] 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] [L227] RET, EXPR __ieee754_atan2f(y, x) [L227] float res = __ieee754_atan2f(y, x); [L230] 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] [L231] 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.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, 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:28,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_0685b.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 cdda62b63fa4d692099c5c94751a7c724c7a2bb15acfaa2811161fc559f30277 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:51:29,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:51:29,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:51:29,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:51:29,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:51:29,837 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:51:29,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:51:29,844 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:51:29,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:51:29,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:51:29,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:51:29,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:51:29,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:51:29,856 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:51:29,857 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:51:29,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:51:29,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:51:29,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:51:29,864 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:51:29,869 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:51:29,871 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:51:29,872 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:51:29,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:51:29,874 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:51:29,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:51:29,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:51:29,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:51:29,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:51:29,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:51:29,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:51:29,879 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:51:29,880 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:51:29,881 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:51:29,881 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:51:29,882 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:51:29,883 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:51:29,883 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:51:29,884 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:51:29,884 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:51:29,884 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:51:29,884 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:51:29,886 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:51:29,886 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:29,921 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:51:29,921 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:51:29,922 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:51:29,922 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:51:29,923 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:51:29,923 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:51:29,923 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:51:29,924 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:51:29,924 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:51:29,925 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:51:29,925 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:51:29,925 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:51:29,925 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:51:29,925 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:51:29,925 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:51:29,926 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:51:29,927 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:51:29,927 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:51:29,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:51:29,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:51:29,927 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:51:29,927 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:29,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:51:29,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:51:29,928 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:51:29,928 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:51:29,928 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:51:29,929 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:51:29,929 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:51:29,929 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:51:29,929 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:51:29,929 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 -> cdda62b63fa4d692099c5c94751a7c724c7a2bb15acfaa2811161fc559f30277 [2022-07-13 14:51:30,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:51:30,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:51:30,223 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:51:30,224 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:51:30,224 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:51:30,226 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0685b.c [2022-07-13 14:51:30,274 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7496db4/bc226b4c3bbf4a85a60665e05dad1c2b/FLAG49ce7bf9c [2022-07-13 14:51:30,675 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:51:30,677 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0685b.c [2022-07-13 14:51:30,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7496db4/bc226b4c3bbf4a85a60665e05dad1c2b/FLAG49ce7bf9c [2022-07-13 14:51:31,078 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7496db4/bc226b4c3bbf4a85a60665e05dad1c2b [2022-07-13 14:51:31,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:51:31,080 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:51:31,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:31,082 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:51:31,084 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:51:31,085 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:31" (1/1) ... [2022-07-13 14:51:31,086 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e9615b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:31, skipping insertion in model container [2022-07-13 14:51:31,086 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:51:31" (1/1) ... [2022-07-13 14:51:31,091 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:51:31,112 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:51:31,264 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_0685b.c[5277,5290] [2022-07-13 14:51:31,266 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:31,275 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:51:31,305 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_0685b.c[5277,5290] [2022-07-13 14:51:31,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:51:31,318 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:51:31,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:31 WrapperNode [2022-07-13 14:51:31,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:51:31,320 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:31,320 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:51:31,320 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:51:31,325 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:31" (1/1) ... [2022-07-13 14:51:31,334 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:31" (1/1) ... [2022-07-13 14:51:31,351 INFO L137 Inliner]: procedures = 22, calls = 79, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 217 [2022-07-13 14:51:31,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:51:31,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:51:31,352 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:51:31,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:51:31,358 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:31" (1/1) ... [2022-07-13 14:51:31,359 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:31" (1/1) ... [2022-07-13 14:51:31,362 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:31" (1/1) ... [2022-07-13 14:51:31,363 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:31" (1/1) ... [2022-07-13 14:51:31,372 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:31" (1/1) ... [2022-07-13 14:51:31,391 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:31" (1/1) ... [2022-07-13 14:51:31,393 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:31" (1/1) ... [2022-07-13 14:51:31,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:51:31,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:51:31,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:51:31,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:51:31,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:31" (1/1) ... [2022-07-13 14:51:31,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:51:31,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:51:31,438 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:31,457 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:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:51:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-13 14:51:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:51:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:51:31,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-13 14:51:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure fabs_float [2022-07-13 14:51:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure fabs_float [2022-07-13 14:51:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:51:31,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:51:31,473 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:51:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-13 14:51:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure atan_float [2022-07-13 14:51:31,474 INFO L138 BoogieDeclarations]: Found implementation of procedure atan_float [2022-07-13 14:51:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:51:31,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:51:31,580 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:51:31,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:51:43,558 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:51:43,563 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:51:43,563 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-07-13 14:51:43,565 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:43 BoogieIcfgContainer [2022-07-13 14:51:43,565 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:51:43,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:51:43,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:51:43,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:51:43,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:51:31" (1/3) ... [2022-07-13 14:51:43,569 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aa6a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:43, skipping insertion in model container [2022-07-13 14:51:43,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:51:31" (2/3) ... [2022-07-13 14:51:43,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28aa6a48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:51:43, skipping insertion in model container [2022-07-13 14:51:43,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:51:43" (3/3) ... [2022-07-13 14:51:43,571 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0685b.c [2022-07-13 14:51:43,581 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:51:43,582 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:51:43,626 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:51:43,630 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@44d0e25b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@44c19b1d [2022-07-13 14:51:43,631 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:51:43,634 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:43,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:51:43,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:43,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:43,640 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:43,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:43,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1138107774, now seen corresponding path program 1 times [2022-07-13 14:51:43,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:43,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156360449] [2022-07-13 14:51:43,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:43,655 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:43,715 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:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:44,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:51:44,492 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:44,507 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,508 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:44,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:44,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156360449] [2022-07-13 14:51:44,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156360449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:44,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:44,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:51:44,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865320863] [2022-07-13 14:51:44,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:44,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:51:44,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:44,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:51:44,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:51:44,547 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:44,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:44,589 INFO L93 Difference]: Finished difference Result 178 states and 290 transitions. [2022-07-13 14:51:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:51:44,590 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:44,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:44,600 INFO L225 Difference]: With dead ends: 178 [2022-07-13 14:51:44,601 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 14:51:44,604 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:44,607 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:44,608 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:44,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 14:51:44,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 14:51:44,649 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:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 126 transitions. [2022-07-13 14:51:44,656 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 126 transitions. Word has length 10 [2022-07-13 14:51:44,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:44,657 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 126 transitions. [2022-07-13 14:51:44,657 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:44,657 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 126 transitions. [2022-07-13 14:51:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:51:44,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:44,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:51:44,686 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 14:51:44,883 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:44,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:44,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:44,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1466192473, now seen corresponding path program 1 times [2022-07-13 14:51:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [777617031] [2022-07-13 14:51:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:44,885 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:44,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:44,887 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:44,902 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:45,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:45,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 14:51:45,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:45,870 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:46,200 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:46,608 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,608 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:46,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:46,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [777617031] [2022-07-13 14:51:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [777617031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:46,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:46,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:51:46,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034091293] [2022-07-13 14:51:46,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:46,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:51:46,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:51:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:46,615 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:46,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:46,638 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-07-13 14:51:46,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:51:46,642 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:46,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:46,644 INFO L225 Difference]: With dead ends: 91 [2022-07-13 14:51:46,644 INFO L226 Difference]: Without dead ends: 87 [2022-07-13 14:51:46,645 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:46,646 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:46,647 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:46,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-13 14:51:46,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-07-13 14:51:46,660 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:46,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 125 transitions. [2022-07-13 14:51:46,662 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 125 transitions. Word has length 12 [2022-07-13 14:51:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:46,662 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 125 transitions. [2022-07-13 14:51:46,663 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:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 125 transitions. [2022-07-13 14:51:46,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:46,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:46,664 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:46,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-13 14:51:46,879 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:46,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:46,881 INFO L85 PathProgramCache]: Analyzing trace with hash -369945613, now seen corresponding path program 1 times [2022-07-13 14:51:46,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:46,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781459469] [2022-07-13 14:51:46,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:46,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:46,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:46,882 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:46,885 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:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:47,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:47,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:48,100 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:48,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:48,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:48,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781459469] [2022-07-13 14:51:48,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781459469] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:48,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:48,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:48,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454857852] [2022-07-13 14:51:48,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:48,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:48,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:48,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:48,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:48,102 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:48,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:48,109 INFO L93 Difference]: Finished difference Result 159 states and 227 transitions. [2022-07-13 14:51:48,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:48,109 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:48,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:48,110 INFO L225 Difference]: With dead ends: 159 [2022-07-13 14:51:48,110 INFO L226 Difference]: Without dead ends: 85 [2022-07-13 14:51:48,110 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:48,111 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:48,111 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:48,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-13 14:51:48,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-13 14:51:48,115 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:48,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2022-07-13 14:51:48,116 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 17 [2022-07-13 14:51:48,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:48,116 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2022-07-13 14:51:48,117 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:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2022-07-13 14:51:48,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-13 14:51:48,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:48,117 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:48,149 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:48,331 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:48,331 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:48,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:48,332 INFO L85 PathProgramCache]: Analyzing trace with hash 2028116593, now seen corresponding path program 1 times [2022-07-13 14:51:48,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:48,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [453690563] [2022-07-13 14:51:48,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:48,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:48,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:48,334 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:48,337 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:49,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:49,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:49,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:49,632 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,632 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:49,633 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:49,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [453690563] [2022-07-13 14:51:49,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [453690563] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:49,633 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:49,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:49,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353424676] [2022-07-13 14:51:49,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:49,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:49,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:49,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:49,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:49,634 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:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:49,639 INFO L93 Difference]: Finished difference Result 89 states and 120 transitions. [2022-07-13 14:51:49,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:49,639 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:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:49,640 INFO L225 Difference]: With dead ends: 89 [2022-07-13 14:51:49,640 INFO L226 Difference]: Without dead ends: 83 [2022-07-13 14:51:49,640 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:49,641 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:49,641 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:49,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-13 14:51:49,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 79. [2022-07-13 14:51:49,645 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:49,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 110 transitions. [2022-07-13 14:51:49,646 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 110 transitions. Word has length 17 [2022-07-13 14:51:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:49,646 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 110 transitions. [2022-07-13 14:51:49,646 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:49,647 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 110 transitions. [2022-07-13 14:51:49,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:51:49,647 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:49,647 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:49,678 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:49,866 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:49,866 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1893883166, now seen corresponding path program 1 times [2022-07-13 14:51:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842118482] [2022-07-13 14:51:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:49,867 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:49,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:49,868 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:49,870 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:50,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:50,682 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 14:51:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:51,302 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:51,302 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:51,302 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:51,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842118482] [2022-07-13 14:51:51,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842118482] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:51,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:51,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:51:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238417964] [2022-07-13 14:51:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:51,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-13 14:51:51,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:51,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-13 14:51:51,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-13 14:51:51,303 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:52,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:52,024 INFO L93 Difference]: Finished difference Result 96 states and 131 transitions. [2022-07-13 14:51:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-13 14:51:52,026 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:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:52,027 INFO L225 Difference]: With dead ends: 96 [2022-07-13 14:51:52,027 INFO L226 Difference]: Without dead ends: 92 [2022-07-13 14:51:52,027 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:52,028 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 14 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s 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.7s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:52,028 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.7s Time] [2022-07-13 14:51:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-13 14:51:52,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 79. [2022-07-13 14:51:52,033 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:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 109 transitions. [2022-07-13 14:51:52,034 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 109 transitions. Word has length 18 [2022-07-13 14:51:52,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:52,034 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 109 transitions. [2022-07-13 14:51:52,034 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:52,034 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 109 transitions. [2022-07-13 14:51:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 14:51:52,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:52,035 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:52,064 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:52,251 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:52,251 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:52,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1871003678, now seen corresponding path program 1 times [2022-07-13 14:51:52,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:52,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535780190] [2022-07-13 14:51:52,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:52,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:52,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:52,253 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:52,254 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:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:53,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:53,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:53,510 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:53,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:53,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:53,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535780190] [2022-07-13 14:51:53,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [535780190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:53,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:53,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521913760] [2022-07-13 14:51:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:53,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:53,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:53,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:53,512 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:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:53,515 INFO L93 Difference]: Finished difference Result 137 states and 186 transitions. [2022-07-13 14:51:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:53,515 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:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:53,516 INFO L225 Difference]: With dead ends: 137 [2022-07-13 14:51:53,516 INFO L226 Difference]: Without dead ends: 79 [2022-07-13 14:51:53,516 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:53,517 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:53,517 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:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-13 14:51:53,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2022-07-13 14:51:53,521 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:53,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 99 transitions. [2022-07-13 14:51:53,521 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 99 transitions. Word has length 18 [2022-07-13 14:51:53,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:53,521 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 99 transitions. [2022-07-13 14:51:53,521 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:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 99 transitions. [2022-07-13 14:51:53,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 14:51:53,522 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:53,522 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:53,550 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:53,740 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:53,740 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1889067684, now seen corresponding path program 1 times [2022-07-13 14:51:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:53,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1167977174] [2022-07-13 14:51:53,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:53,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:53,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:53,742 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:53,743 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:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:54,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:51:54,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:55,047 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:55,048 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:55,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:55,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1167977174] [2022-07-13 14:51:55,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1167977174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:55,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:55,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:51:55,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644001512] [2022-07-13 14:51:55,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:55,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:51:55,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:55,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:51:55,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:51:55,049 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:55,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:55,052 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2022-07-13 14:51:55,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:51:55,052 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:55,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:55,053 INFO L225 Difference]: With dead ends: 131 [2022-07-13 14:51:55,053 INFO L226 Difference]: Without dead ends: 78 [2022-07-13 14:51:55,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:55,054 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:55,054 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:55,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-13 14:51:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-07-13 14:51:55,058 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:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-07-13 14:51:55,058 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 19 [2022-07-13 14:51:55,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:55,059 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-07-13 14:51:55,059 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:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-07-13 14:51:55,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 14:51:55,059 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:55,060 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:55,090 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:55,284 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:55,285 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:55,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:55,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1417522822, now seen corresponding path program 1 times [2022-07-13 14:51:55,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:55,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053925198] [2022-07-13 14:51:55,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:55,286 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:55,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:55,287 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:55,289 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:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:56,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 14:51:56,091 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:57,019 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:57,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:51:57,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:51:57,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053925198] [2022-07-13 14:51:57,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053925198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:51:57,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:51:57,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:51:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165913829] [2022-07-13 14:51:57,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:51:57,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:51:57,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:51:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:51:57,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:57,021 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:57,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:51:57,619 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2022-07-13 14:51:57,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:51:57,620 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:57,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:51:57,621 INFO L225 Difference]: With dead ends: 78 [2022-07-13 14:51:57,621 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 14:51:57,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:51:57,622 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.6s IncrementalHoareTripleChecker+Time [2022-07-13 14:51:57,622 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.6s Time] [2022-07-13 14:51:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 14:51:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 14:51:57,625 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:57,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 97 transitions. [2022-07-13 14:51:57,625 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 97 transitions. Word has length 19 [2022-07-13 14:51:57,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:51:57,626 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 97 transitions. [2022-07-13 14:51:57,626 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:57,626 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 97 transitions. [2022-07-13 14:51:57,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:51:57,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:51:57,626 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:57,654 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:57,832 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:57,833 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:51:57,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:51:57,833 INFO L85 PathProgramCache]: Analyzing trace with hash 992042301, now seen corresponding path program 1 times [2022-07-13 14:51:57,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:51:57,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [19219122] [2022-07-13 14:51:57,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:51:57,834 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:51:57,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:51:57,835 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:57,835 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:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:51:58,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-13 14:51:58,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:51:58,793 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:59,020 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:00,410 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:00,410 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:00,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:00,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [19219122] [2022-07-13 14:52:00,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [19219122] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:00,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:00,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:52:00,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606208253] [2022-07-13 14:52:00,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:00,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 14:52:00,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:00,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 14:52:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:52:00,417 INFO L87 Difference]: Start difference. First operand 74 states and 97 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:00,793 INFO L93 Difference]: Finished difference Result 78 states and 100 transitions. [2022-07-13 14:52:00,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:52:00,795 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:00,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:00,796 INFO L225 Difference]: With dead ends: 78 [2022-07-13 14:52:00,796 INFO L226 Difference]: Without dead ends: 74 [2022-07-13 14:52:00,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-13 14:52:00,797 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:00,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 479 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 39 Unchecked, 0.4s Time] [2022-07-13 14:52:00,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-07-13 14:52:00,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-07-13 14:52:00,808 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:00,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 96 transitions. [2022-07-13 14:52:00,809 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 96 transitions. Word has length 20 [2022-07-13 14:52:00,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:00,811 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 96 transitions. [2022-07-13 14:52:00,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 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:00,811 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 96 transitions. [2022-07-13 14:52:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-13 14:52:00,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:00,812 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:00,846 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 14:52:01,012 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:01,012 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash 687196993, now seen corresponding path program 1 times [2022-07-13 14:52:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428742107] [2022-07-13 14:52:01,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:01,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:01,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:01,015 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:01,016 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:01,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:01,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 14:52:01,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:06,304 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:06,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:06,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:06,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428742107] [2022-07-13 14:52:06,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428742107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:06,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:06,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:52:06,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477532081] [2022-07-13 14:52:06,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:06,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:52:06,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:06,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:52:06,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:52:06,305 INFO L87 Difference]: Start difference. First operand 74 states and 96 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:11,642 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s 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:14,547 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:15,617 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s 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:17,761 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:19,767 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:21,770 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:25,395 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:27,090 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s 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:29,323 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:31,129 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s 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:32,970 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s 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:34,146 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:52:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:34,302 INFO L93 Difference]: Finished difference Result 81 states and 103 transitions. [2022-07-13 14:52:34,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:52:34,303 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:34,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:34,305 INFO L225 Difference]: With dead ends: 81 [2022-07-13 14:52:34,305 INFO L226 Difference]: Without dead ends: 77 [2022-07-13 14:52:34,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:34,306 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 73 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:34,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 206 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 7 Unknown, 0 Unchecked, 25.8s Time] [2022-07-13 14:52:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-13 14:52:34,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-13 14:52:34,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 67 states have internal predecessors, (87), 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:34,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 95 transitions. [2022-07-13 14:52:34,309 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 95 transitions. Word has length 21 [2022-07-13 14:52:34,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:34,310 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 95 transitions. [2022-07-13 14:52:34,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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:34,310 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 95 transitions. [2022-07-13 14:52:34,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-13 14:52:34,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:34,311 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:34,349 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:34,539 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:34,539 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:34,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:34,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1381153585, now seen corresponding path program 1 times [2022-07-13 14:52:34,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:34,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2064422419] [2022-07-13 14:52:34,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:34,540 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:34,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:34,541 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:34,542 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:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:35,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:52:35,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:35,557 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:35,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:35,557 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:35,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2064422419] [2022-07-13 14:52:35,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2064422419] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:35,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:35,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:52:35,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979095319] [2022-07-13 14:52:35,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:35,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:52:35,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:35,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:52:35,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:52:35,558 INFO L87 Difference]: Start difference. First operand 74 states and 95 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:35,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:35,561 INFO L93 Difference]: Finished difference Result 108 states and 138 transitions. [2022-07-13 14:52:35,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:52:35,561 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:35,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:35,561 INFO L225 Difference]: With dead ends: 108 [2022-07-13 14:52:35,561 INFO L226 Difference]: Without dead ends: 72 [2022-07-13 14:52:35,562 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:35,562 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 7 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:35,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 254 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 7 Unchecked, 0.0s Time] [2022-07-13 14:52:35,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-13 14:52:35,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-13 14:52:35,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 66 states have (on average 1.2878787878787878) internal successors, (85), 66 states have internal predecessors, (85), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-13 14:52:35,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-07-13 14:52:35,566 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 23 [2022-07-13 14:52:35,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:35,566 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-07-13 14:52:35,566 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:35,566 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-07-13 14:52:35,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 14:52:35,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:52:35,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:35,620 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:35,773 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:35,773 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:52:35,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:52:35,773 INFO L85 PathProgramCache]: Analyzing trace with hash -635481348, now seen corresponding path program 1 times [2022-07-13 14:52:35,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:52:35,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1719719480] [2022-07-13 14:52:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:52:35,774 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:52:35,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:52:35,775 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:52:35,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-13 14:52:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:52:36,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-13 14:52:36,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:52:36,703 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:36,952 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:37,869 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:37,870 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:52:37,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:52:37,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1719719480] [2022-07-13 14:52:37,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1719719480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:52:37,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:52:37,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:52:37,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499038506] [2022-07-13 14:52:37,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:52:37,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:52:37,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:52:37,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:52:37,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:52:37,871 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:37,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:52:37,882 INFO L93 Difference]: Finished difference Result 72 states and 91 transitions. [2022-07-13 14:52:37,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:52:37,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-13 14:52:37,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:52:37,885 INFO L225 Difference]: With dead ends: 72 [2022-07-13 14:52:37,885 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:52:37,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 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:37,886 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:52:37,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-07-13 14:52:37,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:52:37,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:52:37,892 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:37,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:52:37,892 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-07-13 14:52:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:52:37,892 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:52:37,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:52:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:52:37,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:52:37,894 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:52:37,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-13 14:52:38,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:52:38,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point fabs_floatFINAL(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point fabs_floatEXIT(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L902 garLoopResultBuilder]: At program point fabs_floatENTRY(lines 14 27) the Hoare annotation is: true [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L21(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 14 27) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L21-2(lines 21 25) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L16-1(lines 16 20) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L902 garLoopResultBuilder]: At program point L16-2(lines 16 20) the Hoare annotation is: true [2022-07-13 14:52:39,109 INFO L895 garLoopResultBuilder]: At program point L192(line 192) the Hoare annotation is: false [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L159(lines 159 168) no Hoare annotation was computed. [2022-07-13 14:52:39,109 INFO L895 garLoopResultBuilder]: At program point L192-1(line 192) the Hoare annotation is: false [2022-07-13 14:52:39,109 INFO L899 garLoopResultBuilder]: For program point L192-2(line 192) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L184-2(line 184) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L143(lines 143 151) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L193(lines 193 214) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L210(line 210) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L177(line 177) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L144-2(line 144) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L902 garLoopResultBuilder]: At program point L235(lines 217 236) the Hoare annotation is: true [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L136(lines 136 137) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L194(line 194) no Hoare annotation was computed. [2022-07-13 14:52:39,110 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 (= (fp.sub currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 3.0))) ~pi_o_4~0) .cse0) |ULTIMATE.start___ieee754_atan2f_#res#1|) (= ~tiny_atan2~0 .cse0) (= ~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:39,110 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L203(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L170(lines 170 179) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L203-1(lines 196 208) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L203-2(lines 203 207) no Hoare annotation was computed. [2022-07-13 14:52:39,110 INFO L899 garLoopResultBuilder]: For program point L162(line 162) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L187(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L212(line 212) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L171(line 171) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L138(lines 138 139) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L196(line 196) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L130-1(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:52:39,111 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)))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_6| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse1 (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24))) (.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|) (= .cse1 |ULTIMATE.start___ieee754_atan2f_~y#1|) (= .cse1 (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))))) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (let ((.cse2 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18|) (_ bv0 32))) (.cse3 (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)))) (and (= |ULTIMATE.start___ieee754_atan2f_~hx~1#1| .cse2) (= .cse3 |ULTIMATE.start___ieee754_atan2f_~y#1|) (= (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)) .cse3))))) [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L130-3(lines 130 134) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L155-2(line 155) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L895 garLoopResultBuilder]: At program point L139(line 139) the Hoare annotation is: false [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L139-1(line 139) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L230(lines 230 233) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L189(lines 189 192) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point L189-2(lines 187 192) no Hoare annotation was computed. [2022-07-13 14:52:39,111 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L173(line 173) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L231(line 231) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L198-1(lines 198 202) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L895 garLoopResultBuilder]: At program point L198-2(lines 198 202) the Hoare annotation is: false [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L157(lines 157 181) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L157-1(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L895 garLoopResultBuilder]: At program point L124-2(lines 124 128) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)) (_ +zero 8 24)) |ULTIMATE.start___ieee754_atan2f_~y#1|)) (= ~tiny_atan2~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 1.0 1000000000000000000000000000000.0)))) (= ~pi_o_4~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 3141592741.0 4000000000.0)))) (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:39,112 INFO L899 garLoopResultBuilder]: For program point L124-3(lines 124 128) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L166(line 166) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L158(lines 158 180) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L175(line 175) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L142(lines 142 152) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L142-2(lines 120 215) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L64(lines 64 65) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L902 garLoopResultBuilder]: At program point atan_floatENTRY(lines 53 115) the Hoare annotation is: true [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point atan_floatFINAL(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 74) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:52:39,112 INFO L902 garLoopResultBuilder]: At program point L57-2(lines 57 61) the Hoare annotation is: true [2022-07-13 14:52:39,112 INFO L899 garLoopResultBuilder]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L902 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: true [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L78-1(line 78) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 69) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L79(lines 79 95) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point atan_floatEXIT(lines 53 115) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 70) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 94) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L88-2(lines 71 96) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L113(line 113) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L80(lines 80 86) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L113-2(line 113) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L109(lines 109 114) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L72(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:52:39,113 INFO L899 garLoopResultBuilder]: For program point L72-2(lines 72 75) no Hoare annotation was computed. [2022-07-13 14:52:39,117 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:52:39,122 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:52:39,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,132 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,133 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,135 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,136 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,136 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,137 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,138 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:39,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,139 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,139 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:39,139 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:39,139 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:39,140 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,140 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,141 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,141 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:39,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,142 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,142 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:39,142 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:39,142 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:39,143 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,143 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,144 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,160 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:52:39 BoogieIcfgContainer [2022-07-13 14:52:39,160 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:52:39,161 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:52:39,161 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:52:39,161 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:52:39,161 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:43" (3/4) ... [2022-07-13 14:52:39,163 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:52:39,167 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fabs_float [2022-07-13 14:52:39,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure atan_float [2022-07-13 14:52:39,173 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2022-07-13 14:52:39,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-13 14:52:39,174 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-07-13 14:52:39,175 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:52:39,198 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\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:39,198 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 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, ~fp.neg~FLOAT(~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]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18 : bv32, currentRoundingMode : FloatRoundingMode :: (hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32] && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-07-13 14:52:39,199 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.sub~FLOAT(unknown-currentRoundingMode-unknown, ~fp.mul~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~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 && 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))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:52:39,229 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:52:39,229 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:52:39,230 INFO L158 Benchmark]: Toolchain (without parser) took 68149.49ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 27.7MB in the beginning and 44.4MB in the end (delta: -16.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,230 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:52:39,231 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.35ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 27.5MB in the beginning and 46.7MB in the end (delta: -19.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.08ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 44.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,232 INFO L158 Benchmark]: Boogie Preprocessor took 44.74ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,232 INFO L158 Benchmark]: RCFGBuilder took 12167.64ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 32.8MB in the end (delta: 8.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,232 INFO L158 Benchmark]: TraceAbstraction took 55593.82ms. Allocated memory is still 67.1MB. Free memory was 32.3MB in the beginning and 24.1MB in the end (delta: 8.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,232 INFO L158 Benchmark]: Witness Printer took 68.87ms. Allocated memory is still 67.1MB. Free memory was 24.1MB in the beginning and 44.4MB in the end (delta: -20.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:52:39,237 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.30ms. Allocated memory is still 50.3MB. Free memory was 32.1MB in the beginning and 32.1MB in the end (delta: 33.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.35ms. Allocated memory was 50.3MB in the beginning and 67.1MB in the end (delta: 16.8MB). Free memory was 27.5MB in the beginning and 46.7MB in the end (delta: -19.2MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.08ms. Allocated memory is still 67.1MB. Free memory was 46.5MB in the beginning and 44.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.74ms. Allocated memory is still 67.1MB. Free memory was 44.2MB in the beginning and 41.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 12167.64ms. Allocated memory is still 67.1MB. Free memory was 41.5MB in the beginning and 32.8MB in the end (delta: 8.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * TraceAbstraction took 55593.82ms. Allocated memory is still 67.1MB. Free memory was 32.3MB in the beginning and 24.1MB in the end (delta: 8.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * Witness Printer took 68.87ms. Allocated memory is still 67.1MB. Free memory was 24.1MB in the beginning and 44.4MB in the end (delta: -20.3MB). Peak memory consumption was 4.2MB. 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 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_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,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[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 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_18,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_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,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] * 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: 231]: 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: 55.5s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 116 SdHoareTripleChecker+Valid, 27.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 108 mSDsluCounter, 4322 SdHoareTripleChecker+Invalid, 26.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 237 IncrementalHoareTripleChecker+Unchecked, 3206 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 94 IncrementalHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 1116 mSDtfsCounter, 94 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 209 GetRequests, 164 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=0, InterpolantAutomatonStates: 66, 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, 12 MinimizatonAttempts, 33 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 51 PreInvPairs, 55 NumberOfFragments, 194 HoareAnnotationTreeSize, 51 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 114 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 8.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 207 ConstructedInterpolants, 111 QuantifiedInterpolants, 3330 SizeOfPredicates, 89 NumberOfNonLiveVariables, 1449 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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: 217]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 124]: Loop Invariant [2022-07-13 14:52:39,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,252 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,253 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,253 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,254 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000))) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\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:39,254 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,255 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~fp.sub~FLOAT(unknown-currentRoundingMode-unknown, ~fp.mul~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.neg~FLOAT(~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 && 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))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 130]: Loop Invariant [2022-07-13 14:52:39,256 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:39,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,256 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,256 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:39,256 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:39,256 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:39,257 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,257 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,258 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:39,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,258 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,259 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,259 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:39,259 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:39,259 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:39,260 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:52:39,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,260 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18,QUANTIFIED] [2022-07-13 14:52:39,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:52:39,261 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((tiny_atan2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1/1000000000000000000000000000000)) && pi_o_4 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 3141592741/4000000000))) && (\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, ~fp.neg~FLOAT(~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]))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18 : bv32, currentRoundingMode : FloatRoundingMode :: (hx == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32] && ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) == y) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_atan2f_~#gf_u~2#1.base_18][0bv32][22:0]) == ~fp.div~FLOAT(currentRoundingMode, ~fp.neg~FLOAT(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) RESULT: Ultimate proved your program to be correct! [2022-07-13 14:52:39,407 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