./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1250.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:24,911 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:24,914 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:24,962 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:24,963 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:24,966 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:24,967 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:24,970 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:24,971 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:24,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:24,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:24,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:24,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:24,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:24,983 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:24,985 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:24,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:24,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:24,990 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:24,995 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:24,997 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:24,998 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:24,999 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:25,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:25,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:25,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:25,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:25,009 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:25,010 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:25,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:25,011 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:25,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:25,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:25,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:25,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:25,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:25,016 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:25,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:25,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:25,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:25,018 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:25,019 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:37:25,051 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:25,051 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:25,052 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:25,052 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:25,053 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:25,053 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:25,054 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:25,054 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:25,054 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:25,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:25,055 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:25,055 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:25,056 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:25,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:25,057 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:25,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:25,057 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:25,057 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:25,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:25,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:25,058 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:25,058 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:25,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:25,060 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:37:25,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:37:25,060 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:25,060 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:25,061 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:25,061 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2022-02-20 16:37:25,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:25,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:25,337 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:25,338 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:25,338 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:25,340 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2022-02-20 16:37:25,426 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4752f0/08eebe80f4cb4142b61e5c76ada461f8/FLAG3afa61a25 [2022-02-20 16:37:25,819 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:25,819 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2022-02-20 16:37:25,827 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4752f0/08eebe80f4cb4142b61e5c76ada461f8/FLAG3afa61a25 [2022-02-20 16:37:26,261 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbb4752f0/08eebe80f4cb4142b61e5c76ada461f8 [2022-02-20 16:37:26,263 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:26,264 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:26,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:26,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:26,270 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:26,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,272 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6502c3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26, skipping insertion in model container [2022-02-20 16:37:26,272 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,278 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:26,295 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:26,472 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/double_req_bl_1250.c[1965,1978] [2022-02-20 16:37:26,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:26,481 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:26,501 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/double_req_bl_1250.c[1965,1978] [2022-02-20 16:37:26,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:26,514 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:26,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26 WrapperNode [2022-02-20 16:37:26,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:26,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:26,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:26,517 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:26,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,559 INFO L137 Inliner]: procedures = 18, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 50 [2022-02-20 16:37:26,559 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:26,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:26,561 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:26,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:26,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:26,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:26,589 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:26,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:26,590 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (1/1) ... [2022-02-20 16:37:26,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:26,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:26,616 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-02-20 16:37:26,622 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-02-20 16:37:26,651 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:37:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-02-20 16:37:26,653 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-02-20 16:37:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:37:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:26,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:26,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:37:26,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:26,712 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:26,713 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:26,887 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:26,893 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:26,894 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:37:26,895 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:26 BoogieIcfgContainer [2022-02-20 16:37:26,895 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:26,897 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:26,897 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:26,900 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:26,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:26" (1/3) ... [2022-02-20 16:37:26,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3f7598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:26, skipping insertion in model container [2022-02-20 16:37:26,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:26" (2/3) ... [2022-02-20 16:37:26,901 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f3f7598 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:26, skipping insertion in model container [2022-02-20 16:37:26,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:26" (3/3) ... [2022-02-20 16:37:26,902 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2022-02-20 16:37:26,907 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:26,907 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:26,944 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:26,951 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:37:26,952 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:26,985 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:27,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:27,003 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:27,003 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash 525089809, now seen corresponding path program 1 times [2022-02-20 16:37:27,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:27,031 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057068965] [2022-02-20 16:37:27,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:27,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:27,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:27,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:27,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:27,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {30#true} is VALID [2022-02-20 16:37:27,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:37:27,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {31#false} is VALID [2022-02-20 16:37:27,300 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:37:27,301 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:37:27,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {30#true} is VALID [2022-02-20 16:37:27,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {30#true} is VALID [2022-02-20 16:37:27,304 INFO L272 TraceCheckUtils]: 2: Hoare triple {30#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:37:27,305 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {30#true} is VALID [2022-02-20 16:37:27,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {30#true} assume !true; {31#false} is VALID [2022-02-20 16:37:27,306 INFO L290 TraceCheckUtils]: 5: Hoare triple {31#false} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {31#false} is VALID [2022-02-20 16:37:27,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {31#false} assume true; {31#false} is VALID [2022-02-20 16:37:27,307 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {31#false} {30#true} #69#return; {31#false} is VALID [2022-02-20 16:37:27,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#false} assume -2147483648 <= fmax_double_#t~ret6#1 && fmax_double_#t~ret6#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:37:27,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {31#false} assume 0 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {31#false} is VALID [2022-02-20 16:37:27,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {31#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {31#false} is VALID [2022-02-20 16:37:27,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {31#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {31#false} is VALID [2022-02-20 16:37:27,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {31#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {31#false} is VALID [2022-02-20 16:37:27,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {31#false} assume !false; {31#false} is VALID [2022-02-20 16:37:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:27,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:27,312 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057068965] [2022-02-20 16:37:27,313 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057068965] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:27,313 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:27,313 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:27,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016829243] [2022-02-20 16:37:27,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:27,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2022-02-20 16:37:27,324 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:27,327 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-20 16:37:27,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:27,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:27,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:27,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:27,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:27,384 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-20 16:37:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:27,524 INFO L93 Difference]: Finished difference Result 51 states and 72 transitions. [2022-02-20 16:37:27,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:27,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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 14 [2022-02-20 16:37:27,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:27,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-20 16:37:27,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:37:27,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-20 16:37:27,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2022-02-20 16:37:27,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2022-02-20 16:37:27,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:27,667 INFO L225 Difference]: With dead ends: 51 [2022-02-20 16:37:27,667 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:37:27,671 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:27,676 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:27,678 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 62 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:37:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:37:27,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:27,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:27,710 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:27,710 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:27,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:27,713 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:37:27,714 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:27,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:27,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:27,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:37:27,715 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 24 states. [2022-02-20 16:37:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:27,718 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2022-02-20 16:37:27,718 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:27,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:27,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:27,719 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:27,719 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:27,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:27,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2022-02-20 16:37:27,726 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 14 [2022-02-20 16:37:27,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:27,726 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2022-02-20 16:37:27,727 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 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-02-20 16:37:27,727 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2022-02-20 16:37:27,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:27,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:27,728 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:27,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:37:27,729 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:27,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:27,729 INFO L85 PathProgramCache]: Analyzing trace with hash -395826406, now seen corresponding path program 1 times [2022-02-20 16:37:27,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:27,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567127276] [2022-02-20 16:37:27,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:27,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:27,947 INFO L290 TraceCheckUtils]: 0: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {182#true} is VALID [2022-02-20 16:37:27,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {182#true} is VALID [2022-02-20 16:37:27,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:37:27,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {182#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:27,950 INFO L290 TraceCheckUtils]: 4: Hoare triple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} assume true; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:27,951 INFO L284 TraceCheckUtils]: 5: Hoare quadruple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:27,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {182#true} is VALID [2022-02-20 16:37:27,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {182#true} is VALID [2022-02-20 16:37:27,953 INFO L272 TraceCheckUtils]: 2: Hoare triple {182#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:37:27,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {191#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {182#true} is VALID [2022-02-20 16:37:27,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {182#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {182#true} is VALID [2022-02-20 16:37:27,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {182#true} goto; {182#true} is VALID [2022-02-20 16:37:27,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {182#true} assume (0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 2; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:27,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} assume true; {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:27,956 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {192#(and (<= |__fpclassify_double_#res| 2) (<= 2 |__fpclassify_double_#res|))} {182#true} #69#return; {190#(= (+ (- 2) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:27,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume -2147483648 <= fmax_double_#t~ret6#1 && fmax_double_#t~ret6#1 <= 2147483647; {190#(= (+ (- 2) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:27,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {190#(= (+ (- 2) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume 0 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {183#false} is VALID [2022-02-20 16:37:27,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {183#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {183#false} is VALID [2022-02-20 16:37:27,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {183#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {183#false} is VALID [2022-02-20 16:37:27,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {183#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {183#false} is VALID [2022-02-20 16:37:27,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {183#false} assume !false; {183#false} is VALID [2022-02-20 16:37:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:27,958 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:27,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567127276] [2022-02-20 16:37:27,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567127276] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:27,959 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:27,959 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:27,959 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957028854] [2022-02-20 16:37:27,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 16:37:27,961 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:27,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:37:27,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:27,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:27,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:27,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:27,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:27,977 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:37:28,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,083 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 16:37:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:28,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:37:28,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:37:28,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:28,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,136 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:28,136 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:28,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,148 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:28,149 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 101 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:28,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-02-20 16:37:28,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:28,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,156 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,156 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,159 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:28,159 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:28,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:28,160 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,163 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:28,163 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:28,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:28,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:28,166 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 15 [2022-02-20 16:37:28,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:28,167 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:28,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:37:28,167 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:37:28,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:28,168 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:28,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:37:28,169 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:28,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:28,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1214793076, now seen corresponding path program 1 times [2022-02-20 16:37:28,170 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:28,170 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076491885] [2022-02-20 16:37:28,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:28,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:28,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {326#true} is VALID [2022-02-20 16:37:28,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {326#true} is VALID [2022-02-20 16:37:28,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:37:28,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {326#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {326#true} is VALID [2022-02-20 16:37:28,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} assume (~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719);#res := 4; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:28,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {337#(= |__fpclassify_double_#res| 4)} assume true; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:28,289 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {337#(= |__fpclassify_double_#res| 4)} {326#true} #69#return; {335#(= (+ (- 4) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {326#true} is VALID [2022-02-20 16:37:28,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {326#true} is VALID [2022-02-20 16:37:28,291 INFO L272 TraceCheckUtils]: 2: Hoare triple {326#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:37:28,291 INFO L290 TraceCheckUtils]: 3: Hoare triple {336#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {326#true} is VALID [2022-02-20 16:37:28,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {326#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {326#true} is VALID [2022-02-20 16:37:28,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#true} goto; {326#true} is VALID [2022-02-20 16:37:28,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {326#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {326#true} is VALID [2022-02-20 16:37:28,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {326#true} assume (~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719);#res := 4; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:28,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {337#(= |__fpclassify_double_#res| 4)} assume true; {337#(= |__fpclassify_double_#res| 4)} is VALID [2022-02-20 16:37:28,299 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {337#(= |__fpclassify_double_#res| 4)} {326#true} #69#return; {335#(= (+ (- 4) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,300 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#(= (+ (- 4) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume -2147483648 <= fmax_double_#t~ret6#1 && fmax_double_#t~ret6#1 <= 2147483647; {335#(= (+ (- 4) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,300 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#(= (+ (- 4) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume 0 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {327#false} is VALID [2022-02-20 16:37:28,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {327#false} is VALID [2022-02-20 16:37:28,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {327#false} is VALID [2022-02-20 16:37:28,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {327#false} is VALID [2022-02-20 16:37:28,301 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#false} assume !false; {327#false} is VALID [2022-02-20 16:37:28,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-02-20 16:37:28,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:28,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076491885] [2022-02-20 16:37:28,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076491885] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:28,303 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:28,303 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:28,303 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682149177] [2022-02-20 16:37:28,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:28,304 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-02-20 16:37:28,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:28,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-02-20 16:37:28,330 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:28,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:28,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:28,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,336 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-02-20 16:37:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,471 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:28,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:28,472 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 16 [2022-02-20 16:37:28,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-02-20 16:37:28,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-02-20 16:37:28,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:28,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,524 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:28,525 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:28,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,526 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:28,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:28,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:28,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:28,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,531 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,532 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,534 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:28,534 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:28,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:28,535 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:28,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,537 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:28,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:28,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:28,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:28,540 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 16 [2022-02-20 16:37:28,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:28,541 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:28,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-02-20 16:37:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:28,542 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:28,542 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:28,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:37:28,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:28,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:28,543 INFO L85 PathProgramCache]: Analyzing trace with hash 964506206, now seen corresponding path program 1 times [2022-02-20 16:37:28,543 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:28,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121860880] [2022-02-20 16:37:28,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:28,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:28,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {483#true} is VALID [2022-02-20 16:37:28,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {483#true} is VALID [2022-02-20 16:37:28,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:37:28,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {483#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {483#true} is VALID [2022-02-20 16:37:28,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {483#true} is VALID [2022-02-20 16:37:28,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} assume ~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223);#res := 3; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} assume true; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,641 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {483#true} is VALID [2022-02-20 16:37:28,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {483#true} is VALID [2022-02-20 16:37:28,643 INFO L272 TraceCheckUtils]: 2: Hoare triple {483#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:37:28,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {494#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {483#true} is VALID [2022-02-20 16:37:28,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {483#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {483#true} is VALID [2022-02-20 16:37:28,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {483#true} goto; {483#true} is VALID [2022-02-20 16:37:28,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {483#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {483#true} is VALID [2022-02-20 16:37:28,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {483#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {483#true} is VALID [2022-02-20 16:37:28,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {483#true} assume ~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223);#res := 3; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} assume true; {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {495#(and (<= |__fpclassify_double_#res| 3) (<= 3 |__fpclassify_double_#res|))} {483#true} #69#return; {493#(= (+ (- 3) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume -2147483648 <= fmax_double_#t~ret6#1 && fmax_double_#t~ret6#1 <= 2147483647; {493#(= (+ (- 3) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {493#(= (+ (- 3) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume 0 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {484#false} is VALID [2022-02-20 16:37:28,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {484#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {484#false} is VALID [2022-02-20 16:37:28,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {484#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {484#false} is VALID [2022-02-20 16:37:28,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {484#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {484#false} is VALID [2022-02-20 16:37:28,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {484#false} assume !false; {484#false} is VALID [2022-02-20 16:37:28,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:28,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:28,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121860880] [2022-02-20 16:37:28,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121860880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:28,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:28,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:28,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298842774] [2022-02-20 16:37:28,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:28,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:28,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:28,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 16:37:28,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:28,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:28,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,667 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 16:37:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,777 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:28,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:28,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 16:37:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 16:37:28,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:28,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:28,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,821 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:28,821 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:28,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,823 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:28,824 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:28,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:28,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:28,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:28,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,828 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,829 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,831 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:28,831 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:28,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:28,832 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:28,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:28,834 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:28,835 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:28,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:28,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:28,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:28,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:28,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:28,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:28,838 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2022-02-20 16:37:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:28,838 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:28,838 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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-02-20 16:37:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:37:28,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:28,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:28,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:37:28,840 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1139302728, now seen corresponding path program 1 times [2022-02-20 16:37:28,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:28,841 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77832092] [2022-02-20 16:37:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:28,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 16:37:28,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:28,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {641#true} is VALID [2022-02-20 16:37:28,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {641#true} is VALID [2022-02-20 16:37:28,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:37:28,936 INFO L290 TraceCheckUtils]: 3: Hoare triple {641#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {641#true} is VALID [2022-02-20 16:37:28,936 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {641#true} is VALID [2022-02-20 16:37:28,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {641#true} is VALID [2022-02-20 16:37:28,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,938 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} assume true; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,939 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3); {641#true} is VALID [2022-02-20 16:37:28,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);main_~y~0#1 := ~someBinaryArithmeticDOUBLEoperation(0.0, 0.0);assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {641#true} is VALID [2022-02-20 16:37:28,940 INFO L272 TraceCheckUtils]: 2: Hoare triple {641#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:37:28,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {653#(and (= |old(#length)| |#length|) (= |old(#memory_real)| |#memory_real|) (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|))} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {641#true} is VALID [2022-02-20 16:37:28,941 INFO L290 TraceCheckUtils]: 4: Hoare triple {641#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem4 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {641#true} is VALID [2022-02-20 16:37:28,941 INFO L290 TraceCheckUtils]: 5: Hoare triple {641#true} goto; {641#true} is VALID [2022-02-20 16:37:28,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {641#true} assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); {641#true} is VALID [2022-02-20 16:37:28,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {641#true} assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); {641#true} is VALID [2022-02-20 16:37:28,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {641#true} assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); {641#true} is VALID [2022-02-20 16:37:28,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {641#true} assume (2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296);#res := 1; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,943 INFO L290 TraceCheckUtils]: 10: Hoare triple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} assume true; {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} is VALID [2022-02-20 16:37:28,944 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {654#(and (<= |__fpclassify_double_#res| 1) (<= 1 |__fpclassify_double_#res|))} {641#true} #69#return; {652#(= (+ (- 1) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume -2147483648 <= fmax_double_#t~ret6#1 && fmax_double_#t~ret6#1 <= 2147483647; {652#(= (+ (- 1) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} is VALID [2022-02-20 16:37:28,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {652#(= (+ (- 1) |ULTIMATE.start_fmax_double_#t~ret6#1|) 0)} assume 0 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {642#false} is VALID [2022-02-20 16:37:28,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if ~someBinaryDOUBLEComparisonOperation(isnan_double_~x#1, isnan_double_~x#1) then 1 else 0); {642#false} is VALID [2022-02-20 16:37:28,945 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true;assume -2147483648 <= main_#t~ret10#1 && main_#t~ret10#1 <= 2147483647; {642#false} is VALID [2022-02-20 16:37:28,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#false} assume 0 == main_#t~ret10#1;havoc main_#t~ret10#1; {642#false} is VALID [2022-02-20 16:37:28,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 16:37:28,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:28,946 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:37:28,946 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77832092] [2022-02-20 16:37:28,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77832092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:28,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:28,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:37:28,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281534490] [2022-02-20 16:37:28,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:28,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2022-02-20 16:37:28,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:28,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 16:37:28,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:28,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:37:28,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:37:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:37:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:28,965 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 16:37:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:29,073 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2022-02-20 16:37:29,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:37:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2022-02-20 16:37:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:29,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 16:37:29,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 16:37:29,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-02-20 16:37:29,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-02-20 16:37:29,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:29,127 INFO L225 Difference]: With dead ends: 37 [2022-02-20 16:37:29,127 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:37:29,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:37:29,129 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:29,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 117 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:37:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2022-02-20 16:37:29,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:29,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:29,133 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:29,133 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:29,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:29,135 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:29,135 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:29,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:29,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:29,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:29,136 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 32 states. [2022-02-20 16:37:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:29,138 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-02-20 16:37:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-02-20 16:37:29,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:29,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:29,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:29,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-02-20 16:37:29,141 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2022-02-20 16:37:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:29,141 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-02-20 16:37:29,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 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-02-20 16:37:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:29,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 16:37:29,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:29,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:29,143 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:37:29,143 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:29,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:29,144 INFO L85 PathProgramCache]: Analyzing trace with hash 1348210105, now seen corresponding path program 1 times [2022-02-20 16:37:29,144 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:37:29,144 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841701469] [2022-02-20 16:37:29,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:29,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:37:29,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:29,172 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:37:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:37:29,235 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:37:29,236 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:37:29,237 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:29,239 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:37:29,242 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:37:29,244 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:29,259 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret6 := __fpclassify_double(~x); [2022-02-20 16:37:29,260 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getProgramExecutionAsString(UnprovableResult.java:132) at de.uni_freiburg.informatik.ultimate.core.lib.results.UnprovableResult.getLongDescription(UnprovableResult.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:37:29,264 INFO L158 Benchmark]: Toolchain (without parser) took 2999.27ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 40.9MB in the beginning and 48.6MB in the end (delta: -7.7MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:29,264 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:29,264 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.53ms. Allocated memory is still 94.4MB. Free memory was 40.6MB in the beginning and 69.3MB in the end (delta: -28.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2022-02-20 16:37:29,265 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.08ms. Allocated memory is still 94.4MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:29,265 INFO L158 Benchmark]: Boogie Preprocessor took 27.29ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 66.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:29,265 INFO L158 Benchmark]: RCFGBuilder took 306.97ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 52.8MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:37:29,266 INFO L158 Benchmark]: TraceAbstraction took 2366.20ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.4MB in the beginning and 48.6MB in the end (delta: 3.7MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2022-02-20 16:37:29,267 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 94.4MB. Free memory is still 58.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.53ms. Allocated memory is still 94.4MB. Free memory was 40.6MB in the beginning and 69.3MB in the end (delta: -28.7MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.08ms. Allocated memory is still 94.4MB. Free memory was 69.1MB in the beginning and 67.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.29ms. Allocated memory is still 94.4MB. Free memory was 67.5MB in the beginning and 66.3MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 306.97ms. Allocated memory is still 94.4MB. Free memory was 66.0MB in the beginning and 52.8MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2366.20ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 52.4MB in the beginning and 48.6MB in the end (delta: 3.7MB). Peak memory consumption was 23.5MB. 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 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:37:29,302 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 -ea -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/double_req_bl_1250.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 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:37:31,363 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:37:31,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:37:31,400 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:37:31,401 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:37:31,405 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:37:31,407 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:37:31,412 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:37:31,415 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:37:31,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:37:31,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:37:31,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:37:31,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:37:31,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:37:31,427 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:37:31,434 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:37:31,435 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:37:31,436 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:37:31,438 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:37:31,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:37:31,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:37:31,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:37:31,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:37:31,449 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:37:31,454 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:37:31,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:37:31,455 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:37:31,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:37:31,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:37:31,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:37:31,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:37:31,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:37:31,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:37:31,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:37:31,463 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:37:31,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:37:31,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:37:31,464 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:37:31,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:37:31,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:37:31,467 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:37:31,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:37:31,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:37:31,509 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:37:31,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:37:31,510 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:37:31,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:37:31,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:37:31,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:37:31,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:37:31,513 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:37:31,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:37:31,514 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:37:31,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:37:31,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:37:31,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:37:31,515 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:37:31,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:37:31,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:37:31,516 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:37:31,516 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:37:31,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:37:31,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:37:31,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:31,523 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:37:31,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:37:31,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:37:31,523 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:37:31,524 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:37:31,524 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:37:31,524 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:37:31,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:37:31,525 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:37:31,525 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 -> 358b07b46b4639b5c555cb2780810d0868bad1e2d0b3519866cd72c195065fc2 [2022-02-20 16:37:31,832 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:37:31,859 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:37:31,862 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:37:31,863 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:37:31,864 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:37:31,866 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2022-02-20 16:37:31,943 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaead1dc/3ec425791b4c4cb7a8e943cf5a7cfdfd/FLAG81244545d [2022-02-20 16:37:32,384 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:37:32,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2022-02-20 16:37:32,398 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaead1dc/3ec425791b4c4cb7a8e943cf5a7cfdfd/FLAG81244545d [2022-02-20 16:37:32,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfaead1dc/3ec425791b4c4cb7a8e943cf5a7cfdfd [2022-02-20 16:37:32,816 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:37:32,818 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:37:32,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:32,822 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:37:32,825 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:37:32,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:32" (1/1) ... [2022-02-20 16:37:32,830 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fc43e58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:32, skipping insertion in model container [2022-02-20 16:37:32,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:37:32" (1/1) ... [2022-02-20 16:37:32,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:37:32,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:37:33,040 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/double_req_bl_1250.c[1965,1978] [2022-02-20 16:37:33,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:33,063 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:37:33,137 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/double_req_bl_1250.c[1965,1978] [2022-02-20 16:37:33,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:37:33,164 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:37:33,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33 WrapperNode [2022-02-20 16:37:33,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:37:33,166 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:33,166 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:37:33,167 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:37:33,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,191 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,215 INFO L137 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 48 [2022-02-20 16:37:33,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:37:33,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:37:33,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:37:33,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:37:33,224 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,275 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:37:33,278 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:37:33,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:37:33,279 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:37:33,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (1/1) ... [2022-02-20 16:37:33,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:37:33,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:37:33,317 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-02-20 16:37:33,344 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-02-20 16:37:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:37:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:37:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:37:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:37:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2022-02-20 16:37:33,361 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2022-02-20 16:37:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:37:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:37:33,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:37:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:37:33,451 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:37:33,452 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:37:33,683 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:37:33,706 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:37:33,707 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 16:37:33,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:33 BoogieIcfgContainer [2022-02-20 16:37:33,708 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:37:33,710 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:37:33,710 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:37:33,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:37:33,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:37:32" (1/3) ... [2022-02-20 16:37:33,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e49b3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:33, skipping insertion in model container [2022-02-20 16:37:33,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:37:33" (2/3) ... [2022-02-20 16:37:33,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e49b3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:37:33, skipping insertion in model container [2022-02-20 16:37:33,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:33" (3/3) ... [2022-02-20 16:37:33,714 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2022-02-20 16:37:33,718 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:37:33,719 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:37:33,779 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:37:33,789 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:37:33,789 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:37:33,808 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:33,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:37:33,813 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:33,814 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:33,814 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:33,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:33,825 INFO L85 PathProgramCache]: Analyzing trace with hash 369317884, now seen corresponding path program 1 times [2022-02-20 16:37:33,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:33,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480315661] [2022-02-20 16:37:33,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:33,838 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:33,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:33,843 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-02-20 16:37:33,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:37:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:33,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:37:33,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:33,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:34,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {28#true} is VALID [2022-02-20 16:37:34,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {28#true} is VALID [2022-02-20 16:37:34,117 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {28#true} is VALID [2022-02-20 16:37:34,117 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {28#true} is VALID [2022-02-20 16:37:34,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-02-20 16:37:34,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {29#false} is VALID [2022-02-20 16:37:34,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 16:37:34,120 INFO L284 TraceCheckUtils]: 7: Hoare quadruple {29#false} {28#true} #67#return; {29#false} is VALID [2022-02-20 16:37:34,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {29#false} is VALID [2022-02-20 16:37:34,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {29#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {29#false} is VALID [2022-02-20 16:37:34,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {29#false} is VALID [2022-02-20 16:37:34,121 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {29#false} is VALID [2022-02-20 16:37:34,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 16:37:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:34,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:34,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:34,124 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480315661] [2022-02-20 16:37:34,124 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480315661] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:34,124 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:34,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:37:34,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599523780] [2022-02-20 16:37:34,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2022-02-20 16:37:34,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:34,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-20 16:37:34,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:34,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:37:34,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:34,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:37:34,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:37:34,201 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.55) internal successors, (31), 21 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-20 16:37:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:34,272 INFO L93 Difference]: Finished difference Result 47 states and 68 transitions. [2022-02-20 16:37:34,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:37:34,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2022-02-20 16:37:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:34,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-20 16:37:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:37:34,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-20 16:37:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2022-02-20 16:37:34,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2022-02-20 16:37:34,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:34,376 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:37:34,377 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:37:34,380 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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-02-20 16:37:34,383 INFO L933 BasicCegarLoop]: 32 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, 32 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-02-20 16:37:34,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:37:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:37:34,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:34,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:34,415 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:34,416 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:34,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:34,420 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:37:34,420 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:34,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:34,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:34,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:37:34,430 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 22 states. [2022-02-20 16:37:34,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:34,433 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-02-20 16:37:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:34,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:34,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:34,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:34,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:34,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2022-02-20 16:37:34,439 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 13 [2022-02-20 16:37:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:34,439 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2022-02-20 16:37:34,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-02-20 16:37:34,440 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2022-02-20 16:37:34,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:37:34,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:34,441 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:34,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:34,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:34,652 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:34,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:34,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1711341929, now seen corresponding path program 1 times [2022-02-20 16:37:34,653 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:34,653 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130288125] [2022-02-20 16:37:34,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:34,654 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:34,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:34,655 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-02-20 16:37:34,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:37:34,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:34,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:34,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:34,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {200#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {200#true} is VALID [2022-02-20 16:37:34,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {200#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {200#true} is VALID [2022-02-20 16:37:34,818 INFO L272 TraceCheckUtils]: 2: Hoare triple {200#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {200#true} is VALID [2022-02-20 16:37:34,819 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {200#true} is VALID [2022-02-20 16:37:34,819 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {200#true} is VALID [2022-02-20 16:37:34,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {200#true} goto; {200#true} is VALID [2022-02-20 16:37:34,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {200#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {223#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:34,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {223#(= (_ bv2 32) |__fpclassify_double_#res|)} assume true; {223#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:34,821 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {223#(= (_ bv2 32) |__fpclassify_double_#res|)} {200#true} #67#return; {230#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv2 32))} is VALID [2022-02-20 16:37:34,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv2 32))} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {201#false} is VALID [2022-02-20 16:37:34,822 INFO L290 TraceCheckUtils]: 10: Hoare triple {201#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {201#false} is VALID [2022-02-20 16:37:34,823 INFO L290 TraceCheckUtils]: 11: Hoare triple {201#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {201#false} is VALID [2022-02-20 16:37:34,823 INFO L290 TraceCheckUtils]: 12: Hoare triple {201#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {201#false} is VALID [2022-02-20 16:37:34,823 INFO L290 TraceCheckUtils]: 13: Hoare triple {201#false} assume !false; {201#false} is VALID [2022-02-20 16:37:34,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:34,823 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:34,824 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:34,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130288125] [2022-02-20 16:37:34,824 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1130288125] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:34,824 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:34,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:34,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86913093] [2022-02-20 16:37:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:34,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 16:37:34,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:34,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-20 16:37:34,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:34,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:34,854 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:34,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:34,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:34,856 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-20 16:37:35,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,053 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2022-02-20 16:37:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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 14 [2022-02-20 16:37:35,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-20 16:37:35,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:35,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-20 16:37:35,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:35,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:35,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:35,114 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:35,114 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:37:35,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:35,116 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:35,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:37:35,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:37:35,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:37:35,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:35,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,122 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,122 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,125 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:37:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:35,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:35,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:35,126 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:37:35,127 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:37:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,129 INFO L93 Difference]: Finished difference Result 25 states and 33 transitions. [2022-02-20 16:37:35,130 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:35,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:35,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:35,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:35,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:35,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:35,133 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2022-02-20 16:37:35,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:35,134 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:35,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-02-20 16:37:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:35,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:37:35,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:35,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:35,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:35,346 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:35,347 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:35,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:35,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2061340999, now seen corresponding path program 1 times [2022-02-20 16:37:35,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:35,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768486645] [2022-02-20 16:37:35,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:35,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:35,351 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-02-20 16:37:35,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:37:35,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:35,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:35,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:35,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:35,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {364#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {364#true} is VALID [2022-02-20 16:37:35,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {364#true} is VALID [2022-02-20 16:37:35,490 INFO L272 TraceCheckUtils]: 2: Hoare triple {364#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {364#true} is VALID [2022-02-20 16:37:35,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {364#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {364#true} is VALID [2022-02-20 16:37:35,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {364#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {364#true} is VALID [2022-02-20 16:37:35,491 INFO L290 TraceCheckUtils]: 5: Hoare triple {364#true} goto; {364#true} is VALID [2022-02-20 16:37:35,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {364#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {364#true} is VALID [2022-02-20 16:37:35,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {364#true} assume (~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32));#res := 4bv32; {390#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:35,493 INFO L290 TraceCheckUtils]: 8: Hoare triple {390#(= (_ bv4 32) |__fpclassify_double_#res|)} assume true; {390#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:35,494 INFO L284 TraceCheckUtils]: 9: Hoare quadruple {390#(= (_ bv4 32) |__fpclassify_double_#res|)} {364#true} #67#return; {397#(= (_ bv4 32) |ULTIMATE.start_fmax_double_#t~ret6#1|)} is VALID [2022-02-20 16:37:35,494 INFO L290 TraceCheckUtils]: 10: Hoare triple {397#(= (_ bv4 32) |ULTIMATE.start_fmax_double_#t~ret6#1|)} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {365#false} is VALID [2022-02-20 16:37:35,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {365#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {365#false} is VALID [2022-02-20 16:37:35,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {365#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {365#false} is VALID [2022-02-20 16:37:35,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {365#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {365#false} is VALID [2022-02-20 16:37:35,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {365#false} assume !false; {365#false} is VALID [2022-02-20 16:37:35,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:35,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:35,496 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:35,496 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768486645] [2022-02-20 16:37:35,496 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768486645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:35,497 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:35,497 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:35,497 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927109731] [2022-02-20 16:37:35,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:35,498 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-02-20 16:37:35,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:35,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:37:35,517 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:35,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:35,518 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:35,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:35,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:35,519 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:37:35,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,676 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:35,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:35,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-02-20 16:37:35,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:35,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:37:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:37:35,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:35,680 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:35,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:35,731 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:35,731 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:35,731 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:35,733 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:35,733 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:35,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:35,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:35,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:35,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,738 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,738 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,741 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:35,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:35,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:35,742 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:35,743 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:35,745 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:35,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:35,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:35,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:35,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:35,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:35,748 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2022-02-20 16:37:35,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:35,749 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:35,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:37:35,749 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:35,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 16:37:35,750 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:35,750 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:35,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:35,961 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:35,962 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:35,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:35,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1645103533, now seen corresponding path program 1 times [2022-02-20 16:37:35,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:35,963 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244529037] [2022-02-20 16:37:35,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:35,964 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:35,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:35,965 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-02-20 16:37:35,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:37:36,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:36,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:36,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {540#true} is VALID [2022-02-20 16:37:36,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {540#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {540#true} is VALID [2022-02-20 16:37:36,089 INFO L272 TraceCheckUtils]: 2: Hoare triple {540#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {540#true} is VALID [2022-02-20 16:37:36,089 INFO L290 TraceCheckUtils]: 3: Hoare triple {540#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {540#true} is VALID [2022-02-20 16:37:36,089 INFO L290 TraceCheckUtils]: 4: Hoare triple {540#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {540#true} is VALID [2022-02-20 16:37:36,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {540#true} goto; {540#true} is VALID [2022-02-20 16:37:36,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {540#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {540#true} is VALID [2022-02-20 16:37:36,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {540#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {540#true} is VALID [2022-02-20 16:37:36,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {540#true} assume ~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32));#res := 3bv32; {569#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:36,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {569#(= (_ bv3 32) |__fpclassify_double_#res|)} assume true; {569#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:36,092 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {569#(= (_ bv3 32) |__fpclassify_double_#res|)} {540#true} #67#return; {576#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv3 32))} is VALID [2022-02-20 16:37:36,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {576#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv3 32))} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {541#false} is VALID [2022-02-20 16:37:36,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {541#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {541#false} is VALID [2022-02-20 16:37:36,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {541#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {541#false} is VALID [2022-02-20 16:37:36,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {541#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {541#false} is VALID [2022-02-20 16:37:36,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {541#false} assume !false; {541#false} is VALID [2022-02-20 16:37:36,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:36,094 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:36,094 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:36,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244529037] [2022-02-20 16:37:36,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244529037] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:36,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:36,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:36,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609579956] [2022-02-20 16:37:36,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:36,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-02-20 16:37:36,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:36,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02-20 16:37:36,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,116 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:36,116 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:36,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:36,117 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02-20 16:37:36,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,259 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:36,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:36,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-02-20 16:37:36,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02-20 16:37:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:36,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02-20 16:37:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:36,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:36,314 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,315 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:36,316 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:36,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:36,317 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:36,318 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:36,321 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:36,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,322 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,322 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,324 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:36,324 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:36,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:36,326 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,327 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:36,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:36,328 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:36,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:36,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:36,330 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 16 [2022-02-20 16:37:36,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:36,331 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:36,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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-02-20 16:37:36,342 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:36,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:36,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:36,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:36,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:36,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:36,544 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:36,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:36,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1049630069, now seen corresponding path program 1 times [2022-02-20 16:37:36,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:36,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778185319] [2022-02-20 16:37:36,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:36,545 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:36,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:36,547 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-02-20 16:37:36,549 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:37:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:36,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:36,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {719#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {719#true} is VALID [2022-02-20 16:37:36,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {719#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {719#true} is VALID [2022-02-20 16:37:36,689 INFO L272 TraceCheckUtils]: 2: Hoare triple {719#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {719#true} is VALID [2022-02-20 16:37:36,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {719#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {719#true} is VALID [2022-02-20 16:37:36,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {719#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {719#true} is VALID [2022-02-20 16:37:36,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {719#true} goto; {719#true} is VALID [2022-02-20 16:37:36,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {719#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {719#true} is VALID [2022-02-20 16:37:36,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {719#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {719#true} is VALID [2022-02-20 16:37:36,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {719#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {719#true} is VALID [2022-02-20 16:37:36,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {719#true} assume (2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 1bv32; {751#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:36,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {751#(= |__fpclassify_double_#res| (_ bv1 32))} assume true; {751#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:36,694 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {751#(= |__fpclassify_double_#res| (_ bv1 32))} {719#true} #67#return; {758#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv1 32))} is VALID [2022-02-20 16:37:36,694 INFO L290 TraceCheckUtils]: 12: Hoare triple {758#(= |ULTIMATE.start_fmax_double_#t~ret6#1| (_ bv1 32))} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {720#false} is VALID [2022-02-20 16:37:36,694 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {720#false} is VALID [2022-02-20 16:37:36,695 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {720#false} is VALID [2022-02-20 16:37:36,695 INFO L290 TraceCheckUtils]: 15: Hoare triple {720#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {720#false} is VALID [2022-02-20 16:37:36,695 INFO L290 TraceCheckUtils]: 16: Hoare triple {720#false} assume !false; {720#false} is VALID [2022-02-20 16:37:36,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:36,695 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:36,696 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:36,696 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778185319] [2022-02-20 16:37:36,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778185319] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:36,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:36,698 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:36,698 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384137067] [2022-02-20 16:37:36,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:36,699 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:36,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:36,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 16:37:36,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:36,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:36,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:36,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:36,725 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 16:37:36,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,857 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2022-02-20 16:37:36,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:36,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:36,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:36,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 16:37:36,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:36,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 16:37:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-02-20 16:37:36,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-02-20 16:37:36,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:36,903 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:36,904 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:36,904 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:36,905 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:36,905 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:36,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:36,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:36,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,909 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,909 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,911 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:36,911 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:36,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,912 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:36,913 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:36,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:36,915 INFO L93 Difference]: Finished difference Result 28 states and 37 transitions. [2022-02-20 16:37:36,915 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2022-02-20 16:37:36,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:36,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:36,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:36,916 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:36,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:36,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2022-02-20 16:37:36,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 17 [2022-02-20 16:37:36,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:36,918 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2022-02-20 16:37:36,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 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-02-20 16:37:36,918 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2022-02-20 16:37:36,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:37:36,919 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:36,919 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:36,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:37,129 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:37,130 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:37,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1502526892, now seen corresponding path program 1 times [2022-02-20 16:37:37,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:37,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688367913] [2022-02-20 16:37:37,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:37,131 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:37,132 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-02-20 16:37:37,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:37:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:37,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:37:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:37,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:37,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {901#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {901#true} is VALID [2022-02-20 16:37:37,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {901#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {909#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:37,433 INFO L272 TraceCheckUtils]: 2: Hoare triple {909#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {901#true} is VALID [2022-02-20 16:37:37,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {901#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {901#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {901#true} goto; {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 6: Hoare triple {901#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {901#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {901#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {901#true} assume !((2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0));#res := 0bv32; {901#true} is VALID [2022-02-20 16:37:37,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {901#true} assume true; {901#true} is VALID [2022-02-20 16:37:37,436 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {901#true} {909#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} #67#return; {909#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:37,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {909#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} assume 0bv32 == fmax_double_#t~ret6#1;havoc fmax_double_#t~ret6#1;fmax_double_#res#1 := fmax_double_~y#1; {943#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} is VALID [2022-02-20 16:37:37,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {943#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {947#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:37,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {947#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {951#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:37,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {951#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {902#false} is VALID [2022-02-20 16:37:37,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {902#false} assume !false; {902#false} is VALID [2022-02-20 16:37:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:37:37,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:37,443 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:37,443 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688367913] [2022-02-20 16:37:37,443 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688367913] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:37,443 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:37,443 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:37:37,444 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099821946] [2022-02-20 16:37:37,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:37,444 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:37,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:37,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-20 16:37:37,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:37,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:37:37,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:37,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:37:37,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:37:37,478 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-20 16:37:37,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:37,752 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-02-20 16:37:37,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:37:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 17 [2022-02-20 16:37:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:37,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-20 16:37:37,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:37:37,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-20 16:37:37,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2022-02-20 16:37:37,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2022-02-20 16:37:37,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:37,822 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:37:37,822 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:37:37,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:37:37,823 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:37,823 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 113 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-02-20 16:37:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:37:37,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2022-02-20 16:37:37,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:37,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:37,827 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:37,827 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:37,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:37,829 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:37:37,829 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:37:37,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:37,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:37,830 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:37:37,830 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 30 states. [2022-02-20 16:37:37,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:37,831 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:37:37,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:37:37,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:37,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:37,832 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:37,832 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:37,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:37:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 16:37:37,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 17 [2022-02-20 16:37:37,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:37,834 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 16:37:37,834 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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-02-20 16:37:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 16:37:37,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:37:37,835 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:37,835 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:37,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:38,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:38,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:38,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:38,046 INFO L85 PathProgramCache]: Analyzing trace with hash -451389748, now seen corresponding path program 1 times [2022-02-20 16:37:38,046 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:38,046 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341705466] [2022-02-20 16:37:38,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:38,047 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:38,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:38,048 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-02-20 16:37:38,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:37:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:38,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:38,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:38,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {1092#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1092#true} is VALID [2022-02-20 16:37:38,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {1092#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {1092#true} is VALID [2022-02-20 16:37:38,210 INFO L272 TraceCheckUtils]: 2: Hoare triple {1092#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {1092#true} is VALID [2022-02-20 16:37:38,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {1092#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {1092#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {1092#true} goto; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L290 TraceCheckUtils]: 6: Hoare triple {1092#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {1092#true} assume true; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1092#true} {1092#true} #67#return; {1092#true} is VALID [2022-02-20 16:37:38,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#true} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {1092#true} is VALID [2022-02-20 16:37:38,212 INFO L272 TraceCheckUtils]: 10: Hoare triple {1092#true} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {1092#true} is VALID [2022-02-20 16:37:38,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1092#true} is VALID [2022-02-20 16:37:38,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1092#true} is VALID [2022-02-20 16:37:38,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#true} goto; {1092#true} is VALID [2022-02-20 16:37:38,219 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:38,219 INFO L290 TraceCheckUtils]: 15: Hoare triple {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} assume true; {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:38,220 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1139#(= (_ bv2 32) |__fpclassify_double_#res|)} {1092#true} #69#return; {1146#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv2 32))} is VALID [2022-02-20 16:37:38,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {1146#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv2 32))} assume 0bv32 == fmax_double_#t~ret7#1;havoc fmax_double_#t~ret7#1;fmax_double_#res#1 := fmax_double_~x#1; {1093#false} is VALID [2022-02-20 16:37:38,221 INFO L290 TraceCheckUtils]: 18: Hoare triple {1093#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1093#false} is VALID [2022-02-20 16:37:38,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1093#false} is VALID [2022-02-20 16:37:38,221 INFO L290 TraceCheckUtils]: 20: Hoare triple {1093#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1093#false} is VALID [2022-02-20 16:37:38,221 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#false} assume !false; {1093#false} is VALID [2022-02-20 16:37:38,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:37:38,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:38,222 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:38,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341705466] [2022-02-20 16:37:38,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341705466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:38,222 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:38,222 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:38,223 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930433420] [2022-02-20 16:37:38,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:38,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:37:38,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:38,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:38,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:38,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:38,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:38,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:38,247 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,379 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2022-02-20 16:37:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:38,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2022-02-20 16:37:38,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:38,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:38,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:38,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:38,422 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:38,422 INFO L226 Difference]: Without dead ends: 25 [2022-02-20 16:37:38,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:38,423 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:38,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:38,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-20 16:37:38,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-02-20 16:37:38,426 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:38,427 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,427 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,427 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,429 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:37:38,429 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:38,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:38,429 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:38,430 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:37:38,430 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 25 states. [2022-02-20 16:37:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,431 INFO L93 Difference]: Finished difference Result 25 states and 32 transitions. [2022-02-20 16:37:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:38,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:38,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:38,432 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:38,432 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:38,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:38,433 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 22 [2022-02-20 16:37:38,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:38,434 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:38,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,434 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:38,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 16:37:38,435 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:38,435 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:38,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:38,646 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:38,647 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:38,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:38,647 INFO L85 PathProgramCache]: Analyzing trace with hash 753455404, now seen corresponding path program 1 times [2022-02-20 16:37:38,647 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:38,647 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868067518] [2022-02-20 16:37:38,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:38,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:38,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:38,649 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-02-20 16:37:38,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:37:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:38,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:38,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {1280#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {1280#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L272 TraceCheckUtils]: 2: Hoare triple {1280#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {1280#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {1280#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {1280#true} goto; {1280#true} is VALID [2022-02-20 16:37:38,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {1280#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {1280#true} assume true; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1280#true} {1280#true} #67#return; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {1280#true} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L272 TraceCheckUtils]: 10: Hoare triple {1280#true} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {1280#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L290 TraceCheckUtils]: 12: Hoare triple {1280#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1280#true} is VALID [2022-02-20 16:37:38,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {1280#true} goto; {1280#true} is VALID [2022-02-20 16:37:38,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {1280#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {1280#true} is VALID [2022-02-20 16:37:38,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {1280#true} assume (~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32));#res := 4bv32; {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:38,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} assume true; {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:38,799 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1330#(= (_ bv4 32) |__fpclassify_double_#res|)} {1280#true} #69#return; {1337#(= (_ bv4 32) |ULTIMATE.start_fmax_double_#t~ret7#1|)} is VALID [2022-02-20 16:37:38,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#(= (_ bv4 32) |ULTIMATE.start_fmax_double_#t~ret7#1|)} assume 0bv32 == fmax_double_#t~ret7#1;havoc fmax_double_#t~ret7#1;fmax_double_#res#1 := fmax_double_~x#1; {1281#false} is VALID [2022-02-20 16:37:38,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {1281#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1281#false} is VALID [2022-02-20 16:37:38,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {1281#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1281#false} is VALID [2022-02-20 16:37:38,800 INFO L290 TraceCheckUtils]: 21: Hoare triple {1281#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1281#false} is VALID [2022-02-20 16:37:38,800 INFO L290 TraceCheckUtils]: 22: Hoare triple {1281#false} assume !false; {1281#false} is VALID [2022-02-20 16:37:38,800 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:37:38,800 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:38,801 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:38,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868067518] [2022-02-20 16:37:38,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1868067518] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:38,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:38,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:38,801 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518130483] [2022-02-20 16:37:38,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:37:38,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:38,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:38,824 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:38,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:38,825 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,929 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:38,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:38,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-02-20 16:37:38,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:38,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:38,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:38,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:38,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:38,971 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:38,972 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:38,972 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:38,972 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:38,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:37:38,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:38,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:38,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:38,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,976 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,976 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,977 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:38,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:38,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:38,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:38,978 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:38,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:38,980 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:38,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:38,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:38,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:38,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:38,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:38,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:38,982 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 23 [2022-02-20 16:37:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:38,982 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:38,982 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:38,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:38,983 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:38,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:39,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:39,194 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:39,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:39,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2125223496, now seen corresponding path program 1 times [2022-02-20 16:37:39,195 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:39,195 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702390024] [2022-02-20 16:37:39,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:39,196 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:39,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:39,197 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-02-20 16:37:39,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:37:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:39,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:39,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:39,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {1480#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {1480#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L272 TraceCheckUtils]: 2: Hoare triple {1480#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {1480#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {1480#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {1480#true} goto; {1480#true} is VALID [2022-02-20 16:37:39,345 INFO L290 TraceCheckUtils]: 6: Hoare triple {1480#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 7: Hoare triple {1480#true} assume true; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1480#true} {1480#true} #67#return; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 9: Hoare triple {1480#true} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L272 TraceCheckUtils]: 10: Hoare triple {1480#true} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 11: Hoare triple {1480#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {1480#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {1480#true} goto; {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {1480#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {1480#true} is VALID [2022-02-20 16:37:39,346 INFO L290 TraceCheckUtils]: 15: Hoare triple {1480#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {1480#true} is VALID [2022-02-20 16:37:39,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {1480#true} assume ~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32));#res := 3bv32; {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:39,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} assume true; {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} is VALID [2022-02-20 16:37:39,348 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1533#(= (_ bv3 32) |__fpclassify_double_#res|)} {1480#true} #69#return; {1540#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv3 32))} is VALID [2022-02-20 16:37:39,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {1540#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv3 32))} assume 0bv32 == fmax_double_#t~ret7#1;havoc fmax_double_#t~ret7#1;fmax_double_#res#1 := fmax_double_~x#1; {1481#false} is VALID [2022-02-20 16:37:39,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {1481#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1481#false} is VALID [2022-02-20 16:37:39,349 INFO L290 TraceCheckUtils]: 21: Hoare triple {1481#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1481#false} is VALID [2022-02-20 16:37:39,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {1481#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1481#false} is VALID [2022-02-20 16:37:39,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {1481#false} assume !false; {1481#false} is VALID [2022-02-20 16:37:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:37:39,349 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:39,349 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:39,349 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702390024] [2022-02-20 16:37:39,350 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702390024] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:39,350 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:39,350 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:39,350 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506939144] [2022-02-20 16:37:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:39,351 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:39,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:39,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:39,371 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:39,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:39,371 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:39,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:39,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:39,372 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:39,602 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2022-02-20 16:37:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:39,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:39,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:39,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:39,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:39,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 37 transitions. [2022-02-20 16:37:39,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 37 transitions. [2022-02-20 16:37:39,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:39,642 INFO L225 Difference]: With dead ends: 33 [2022-02-20 16:37:39,642 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:37:39,642 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:39,643 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:39,643 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 83 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:37:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:37:39,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:37:39,646 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:39,646 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:39,646 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:39,647 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:39,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:39,648 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:39,648 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:39,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:39,648 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:39,648 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:39,649 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 28 states. [2022-02-20 16:37:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:39,653 INFO L93 Difference]: Finished difference Result 28 states and 36 transitions. [2022-02-20 16:37:39,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-02-20 16:37:39,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:39,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:39,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:39,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:39,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:39,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2022-02-20 16:37:39,655 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 24 [2022-02-20 16:37:39,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:39,656 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2022-02-20 16:37:39,656 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:39,656 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2022-02-20 16:37:39,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:39,657 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:39,657 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:39,673 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:39,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:39,873 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:39,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:39,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1662794800, now seen corresponding path program 1 times [2022-02-20 16:37:39,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:39,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1546394615] [2022-02-20 16:37:39,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:39,874 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:39,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:39,875 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-02-20 16:37:39,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 16:37:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:39,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:37:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:39,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:40,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {1683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1683#true} is VALID [2022-02-20 16:37:40,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {1683#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:40,192 INFO L272 TraceCheckUtils]: 2: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {1683#true} is VALID [2022-02-20 16:37:40,192 INFO L290 TraceCheckUtils]: 3: Hoare triple {1683#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1683#true} is VALID [2022-02-20 16:37:40,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {1683#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1683#true} is VALID [2022-02-20 16:37:40,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {1683#true} goto; {1683#true} is VALID [2022-02-20 16:37:40,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {1683#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1683#true} is VALID [2022-02-20 16:37:40,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {1683#true} assume true; {1683#true} is VALID [2022-02-20 16:37:40,194 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1683#true} {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} #67#return; {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:40,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:40,194 INFO L272 TraceCheckUtils]: 10: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {1683#true} is VALID [2022-02-20 16:37:40,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {1683#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1683#true} is VALID [2022-02-20 16:37:40,195 INFO L290 TraceCheckUtils]: 12: Hoare triple {1683#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1683#true} is VALID [2022-02-20 16:37:40,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {1683#true} goto; {1683#true} is VALID [2022-02-20 16:37:40,195 INFO L290 TraceCheckUtils]: 14: Hoare triple {1683#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1683#true} is VALID [2022-02-20 16:37:40,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {1683#true} assume true; {1683#true} is VALID [2022-02-20 16:37:40,207 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1683#true} {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} #69#return; {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:40,208 INFO L290 TraceCheckUtils]: 17: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} assume !(0bv32 == fmax_double_#t~ret7#1);havoc fmax_double_#t~ret7#1; {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} is VALID [2022-02-20 16:37:40,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {1691#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|))} assume !~fp.gt~DOUBLE(fmax_double_~x#1, fmax_double_~y#1);fmax_double_#t~ite8#1 := fmax_double_~y#1; {1743#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#t~ite8#1|))} is VALID [2022-02-20 16:37:40,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {1743#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#t~ite8#1|))} fmax_double_#res#1 := fmax_double_#t~ite8#1;havoc fmax_double_#t~ite8#1; {1747#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} is VALID [2022-02-20 16:37:40,212 INFO L290 TraceCheckUtils]: 20: Hoare triple {1747#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1751#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:40,212 INFO L290 TraceCheckUtils]: 21: Hoare triple {1751#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1755#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:40,213 INFO L290 TraceCheckUtils]: 22: Hoare triple {1755#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1684#false} is VALID [2022-02-20 16:37:40,213 INFO L290 TraceCheckUtils]: 23: Hoare triple {1684#false} assume !false; {1684#false} is VALID [2022-02-20 16:37:40,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:37:40,213 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:40,213 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:40,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1546394615] [2022-02-20 16:37:40,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1546394615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:40,214 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:40,214 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 16:37:40,214 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448164466] [2022-02-20 16:37:40,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:40,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:40,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:40,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:40,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:40,246 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:37:40,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:40,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:37:40,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:37:40,247 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:40,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:40,475 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2022-02-20 16:37:40,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:37:40,476 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:40,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:40,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:37:40,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-02-20 16:37:40,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-02-20 16:37:40,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:40,529 INFO L225 Difference]: With dead ends: 32 [2022-02-20 16:37:40,529 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:37:40,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:37:40,530 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:40,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 127 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-02-20 16:37:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:37:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-02-20 16:37:40,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:40,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:40,533 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:40,534 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:40,535 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 16:37:40,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 16:37:40,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:40,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:40,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 26 states. [2022-02-20 16:37:40,536 INFO L87 Difference]: Start difference. First operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Second operand 26 states. [2022-02-20 16:37:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:40,537 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 16:37:40,537 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2022-02-20 16:37:40,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:40,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:40,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:40,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2022-02-20 16:37:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2022-02-20 16:37:40,544 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 24 [2022-02-20 16:37:40,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:40,544 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2022-02-20 16:37:40,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:40,544 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2022-02-20 16:37:40,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:37:40,545 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:40,545 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:40,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:40,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:40,757 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:40,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1605536498, now seen corresponding path program 1 times [2022-02-20 16:37:40,758 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:40,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1096065122] [2022-02-20 16:37:40,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:40,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:40,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:40,759 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-02-20 16:37:40,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 16:37:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:40,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:37:40,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:40,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:40,967 INFO L290 TraceCheckUtils]: 0: Hoare triple {1887#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {1887#true} is VALID [2022-02-20 16:37:40,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1887#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:40,970 INFO L272 TraceCheckUtils]: 2: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {1887#true} is VALID [2022-02-20 16:37:40,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {1887#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1887#true} is VALID [2022-02-20 16:37:40,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {1887#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1887#true} is VALID [2022-02-20 16:37:40,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {1887#true} goto; {1887#true} is VALID [2022-02-20 16:37:40,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1887#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1887#true} is VALID [2022-02-20 16:37:40,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-02-20 16:37:40,974 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1887#true} {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} #67#return; {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:40,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:40,975 INFO L272 TraceCheckUtils]: 10: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {1887#true} is VALID [2022-02-20 16:37:40,975 INFO L290 TraceCheckUtils]: 11: Hoare triple {1887#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {1887#true} is VALID [2022-02-20 16:37:40,975 INFO L290 TraceCheckUtils]: 12: Hoare triple {1887#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {1887#true} is VALID [2022-02-20 16:37:40,975 INFO L290 TraceCheckUtils]: 13: Hoare triple {1887#true} goto; {1887#true} is VALID [2022-02-20 16:37:40,975 INFO L290 TraceCheckUtils]: 14: Hoare triple {1887#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {1887#true} is VALID [2022-02-20 16:37:40,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {1887#true} assume true; {1887#true} is VALID [2022-02-20 16:37:40,976 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1887#true} {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} #69#return; {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:40,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} assume !(0bv32 == fmax_double_#t~ret7#1);havoc fmax_double_#t~ret7#1; {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:40,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {1895#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} assume ~fp.gt~DOUBLE(fmax_double_~x#1, fmax_double_~y#1);fmax_double_#t~ite8#1 := fmax_double_~x#1; {1888#false} is VALID [2022-02-20 16:37:40,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {1888#false} fmax_double_#res#1 := fmax_double_#t~ite8#1;havoc fmax_double_#t~ite8#1; {1888#false} is VALID [2022-02-20 16:37:40,982 INFO L290 TraceCheckUtils]: 20: Hoare triple {1888#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {1888#false} is VALID [2022-02-20 16:37:40,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {1888#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {1888#false} is VALID [2022-02-20 16:37:40,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {1888#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {1888#false} is VALID [2022-02-20 16:37:40,983 INFO L290 TraceCheckUtils]: 23: Hoare triple {1888#false} assume !false; {1888#false} is VALID [2022-02-20 16:37:40,983 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:37:40,983 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:40,983 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:40,983 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1096065122] [2022-02-20 16:37:40,983 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1096065122] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:40,983 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:40,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:37:40,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125644108] [2022-02-20 16:37:40,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:40,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:40,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:40,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:41,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:37:41,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:41,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:37:41,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:41,012 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,074 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-02-20 16:37:41,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:37:41,075 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-02-20 16:37:41,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 16:37:41,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2022-02-20 16:37:41,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2022-02-20 16:37:41,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:41,132 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:41,133 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 16:37:41,133 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:37:41,133 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:41,134 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 1 Unchecked, 0.0s Time] [2022-02-20 16:37:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 16:37:41,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 16:37:41,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:41,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,136 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,136 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,137 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:41,137 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:41,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,138 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:37:41,138 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 22 states. [2022-02-20 16:37:41,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,140 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:41,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:41,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:41,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:41,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:37:41,142 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 24 [2022-02-20 16:37:41,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:41,142 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:37:41,142 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:41,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:37:41,142 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:41,143 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:41,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:41,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,343 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:41,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 81668136, now seen corresponding path program 1 times [2022-02-20 16:37:41,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:41,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871684492] [2022-02-20 16:37:41,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:41,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:41,345 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-02-20 16:37:41,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 16:37:41,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:37:41,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:41,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:41,490 INFO L290 TraceCheckUtils]: 0: Hoare triple {2071#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2071#true} is VALID [2022-02-20 16:37:41,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {2071#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {2071#true} is VALID [2022-02-20 16:37:41,491 INFO L272 TraceCheckUtils]: 2: Hoare triple {2071#true} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {2071#true} is VALID [2022-02-20 16:37:41,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {2071#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2071#true} is VALID [2022-02-20 16:37:41,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {2071#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {2071#true} goto; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {2071#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {2071#true} assume true; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2071#true} {2071#true} #67#return; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {2071#true} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {2071#true} is VALID [2022-02-20 16:37:41,492 INFO L272 TraceCheckUtils]: 10: Hoare triple {2071#true} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {2071#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 12: Hoare triple {2071#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {2071#true} goto; {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {2071#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 15: Hoare triple {2071#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {2071#true} is VALID [2022-02-20 16:37:41,493 INFO L290 TraceCheckUtils]: 16: Hoare triple {2071#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {2071#true} is VALID [2022-02-20 16:37:41,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {2071#true} assume (2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 1bv32; {2127#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:41,495 INFO L290 TraceCheckUtils]: 18: Hoare triple {2127#(= |__fpclassify_double_#res| (_ bv1 32))} assume true; {2127#(= |__fpclassify_double_#res| (_ bv1 32))} is VALID [2022-02-20 16:37:41,496 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2127#(= |__fpclassify_double_#res| (_ bv1 32))} {2071#true} #69#return; {2134#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv1 32))} is VALID [2022-02-20 16:37:41,496 INFO L290 TraceCheckUtils]: 20: Hoare triple {2134#(= |ULTIMATE.start_fmax_double_#t~ret7#1| (_ bv1 32))} assume 0bv32 == fmax_double_#t~ret7#1;havoc fmax_double_#t~ret7#1;fmax_double_#res#1 := fmax_double_~x#1; {2072#false} is VALID [2022-02-20 16:37:41,496 INFO L290 TraceCheckUtils]: 21: Hoare triple {2072#false} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {2072#false} is VALID [2022-02-20 16:37:41,496 INFO L290 TraceCheckUtils]: 22: Hoare triple {2072#false} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {2072#false} is VALID [2022-02-20 16:37:41,497 INFO L290 TraceCheckUtils]: 23: Hoare triple {2072#false} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {2072#false} is VALID [2022-02-20 16:37:41,497 INFO L290 TraceCheckUtils]: 24: Hoare triple {2072#false} assume !false; {2072#false} is VALID [2022-02-20 16:37:41,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 16:37:41,498 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:41,498 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:41,498 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871684492] [2022-02-20 16:37:41,498 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871684492] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:41,499 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:41,499 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:37:41,499 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456478520] [2022-02-20 16:37:41,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:41,501 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:37:41,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:41,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:41,527 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:37:41,527 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:41,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:37:41,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:41,529 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,675 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-02-20 16:37:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:37:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:37:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:41,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:37:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 16:37:41,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 16:37:41,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:41,717 INFO L225 Difference]: With dead ends: 30 [2022-02-20 16:37:41,717 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:37:41,717 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:37:41,717 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:41,718 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 70 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:37:41,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:37:41,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-02-20 16:37:41,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:41,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,720 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,720 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,721 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:37:41,721 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:37:41,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:37:41,722 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Second operand 24 states. [2022-02-20 16:37:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:41,723 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-02-20 16:37:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-02-20 16:37:41,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:41,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:41,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:41,723 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:41,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-02-20 16:37:41,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2022-02-20 16:37:41,724 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 25 [2022-02-20 16:37:41,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:41,724 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2022-02-20 16:37:41,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:41,724 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-02-20 16:37:41,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:37:41,728 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:37:41,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:41,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:41,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,942 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:37:41,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:37:41,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1824478471, now seen corresponding path program 1 times [2022-02-20 16:37:41,943 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:37:41,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580976799] [2022-02-20 16:37:41,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:37:41,943 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:37:41,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:37:41,944 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:37:41,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 16:37:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:42,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:37:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:37:42,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:37:42,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {2263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {2263#true} is VALID [2022-02-20 16:37:42,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {2263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret9#1, main_#t~ret10#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());main_~y~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~DOUBLE(), ~Pluszero~DOUBLE());assume { :begin_inline_fmax_double } true;fmax_double_#in~x#1, fmax_double_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmax_double_#res#1;havoc fmax_double_#t~ret6#1, fmax_double_#t~ret7#1, fmax_double_#t~ite8#1, fmax_double_~x#1, fmax_double_~y#1;fmax_double_~x#1 := fmax_double_#in~x#1;fmax_double_~y#1 := fmax_double_#in~y#1; {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:42,226 INFO L272 TraceCheckUtils]: 2: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} call fmax_double_#t~ret6#1 := __fpclassify_double(fmax_double_~x#1); {2263#true} is VALID [2022-02-20 16:37:42,227 INFO L290 TraceCheckUtils]: 3: Hoare triple {2263#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2263#true} is VALID [2022-02-20 16:37:42,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {2263#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2263#true} is VALID [2022-02-20 16:37:42,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {2263#true} goto; {2263#true} is VALID [2022-02-20 16:37:42,227 INFO L290 TraceCheckUtils]: 6: Hoare triple {2263#true} assume (0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0);#res := 2bv32; {2263#true} is VALID [2022-02-20 16:37:42,227 INFO L290 TraceCheckUtils]: 7: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-02-20 16:37:42,228 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {2263#true} {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} #67#return; {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:42,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} assume !(0bv32 == fmax_double_#t~ret6#1);havoc fmax_double_#t~ret6#1; {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:42,228 INFO L272 TraceCheckUtils]: 10: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} call fmax_double_#t~ret7#1 := __fpclassify_double(fmax_double_~y#1); {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 11: Hoare triple {2263#true} ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 12: Hoare triple {2263#true} call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.allocOnStack(8bv32);call write~intFLOATTYPE8(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8bv32);call #t~mem4 := read~intINTTYPE4(~#ew_u~0.base, ~bvadd32(4bv32, ~#ew_u~0.offset), 4bv32);~msw~0 := #t~mem4;havoc #t~mem4;call #t~mem5 := read~intINTTYPE4(~#ew_u~0.base, ~#ew_u~0.offset, 4bv32);~lsw~0 := #t~mem5;havoc #t~mem5;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {2263#true} goto; {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {2263#true} assume !((0bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (2147483648bv32 == ~msw~0 && 0bv32 == ~lsw~0)); {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 15: Hoare triple {2263#true} assume !((~bvuge32(~msw~0, 1048576bv32) && ~bvule32(~msw~0, 2146435071bv32)) || (~bvuge32(~msw~0, 2148532224bv32) && ~bvule32(~msw~0, 4293918719bv32))); {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {2263#true} assume !(~bvule32(~msw~0, 1048575bv32) || (~bvuge32(~msw~0, 2147483648bv32) && ~bvule32(~msw~0, 2148532223bv32))); {2263#true} is VALID [2022-02-20 16:37:42,229 INFO L290 TraceCheckUtils]: 17: Hoare triple {2263#true} assume !((2146435072bv32 == ~msw~0 && 0bv32 == ~lsw~0) || (4293918720bv32 == ~msw~0 && 0bv32 == ~lsw~0));#res := 0bv32; {2263#true} is VALID [2022-02-20 16:37:42,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {2263#true} assume true; {2263#true} is VALID [2022-02-20 16:37:42,231 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {2263#true} {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} #69#return; {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} is VALID [2022-02-20 16:37:42,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {2271#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))} assume 0bv32 == fmax_double_#t~ret7#1;havoc fmax_double_#t~ret7#1;fmax_double_#res#1 := fmax_double_~x#1; {2329#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} is VALID [2022-02-20 16:37:42,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {2329#(exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|))} main_#t~ret9#1 := fmax_double_#res#1;assume { :end_inline_fmax_double } true;main_~res~0#1 := main_#t~ret9#1;havoc main_#t~ret9#1;assume { :begin_inline_isnan_double } true;isnan_double_#in~x#1 := main_~res~0#1;havoc isnan_double_#res#1;havoc isnan_double_~x#1;isnan_double_~x#1 := isnan_double_#in~x#1;isnan_double_#res#1 := (if !~fp.eq~DOUBLE(isnan_double_~x#1, isnan_double_~x#1) then 1bv32 else 0bv32); {2333#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} is VALID [2022-02-20 16:37:42,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {2333#(= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|)} main_#t~ret10#1 := isnan_double_#res#1;assume { :end_inline_isnan_double } true; {2337#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} is VALID [2022-02-20 16:37:42,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {2337#(= |ULTIMATE.start_main_#t~ret10#1| (_ bv1 32))} assume 0bv32 == main_#t~ret10#1;havoc main_#t~ret10#1; {2264#false} is VALID [2022-02-20 16:37:42,239 INFO L290 TraceCheckUtils]: 24: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2022-02-20 16:37:42,239 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-02-20 16:37:42,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:37:42,239 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:37:42,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580976799] [2022-02-20 16:37:42,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580976799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:37:42,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:37:42,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:37:42,240 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227741122] [2022-02-20 16:37:42,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:37:42,240 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:37:42,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:37:42,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:42,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:42,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:37:42,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:37:42,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:37:42,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:37:42,278 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:42,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,656 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 16:37:42,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:37:42,656 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-02-20 16:37:42,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:37:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:42,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:37:42,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:42,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2022-02-20 16:37:42,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 24 transitions. [2022-02-20 16:37:42,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:37:42,694 INFO L225 Difference]: With dead ends: 22 [2022-02-20 16:37:42,694 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:37:42,695 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:37:42,695 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 1 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:37:42,696 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 89 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 5 Unchecked, 0.2s Time] [2022-02-20 16:37:42,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:37:42,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:37:42,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:37:42,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second 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-02-20 16:37:42,697 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second 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-02-20 16:37:42,697 INFO L87 Difference]: Start difference. First operand 0 states. Second 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-02-20 16:37:42,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,697 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:42,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:42,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:42,697 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 0 states. [2022-02-20 16:37:42,697 INFO L87 Difference]: Start difference. First 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) Second operand 0 states. [2022-02-20 16:37:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:37:42,698 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:37:42,698 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:42,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:42,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:37:42,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:37:42,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:37:42,699 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-02-20 16:37:42,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:37:42,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2022-02-20 16:37:42,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:37:42,699 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:37:42,699 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:37:42,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:37:42,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:37:42,702 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:37:42,715 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 16:37:42,902 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:37:42,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:37:42,948 INFO L858 garLoopResultBuilder]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L861 garLoopResultBuilder]: At program point L31-2(lines 31 36) the Hoare annotation is: true [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleFINAL(lines 28 53) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 52) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L44(lines 44 52) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L861 garLoopResultBuilder]: At program point __fpclassify_doubleENTRY(lines 28 53) the Hoare annotation is: true [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point __fpclassify_doubleEXIT(lines 28 53) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 52) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L62-2(line 62) no Hoare annotation was computed. [2022-02-20 16:37:42,949 INFO L854 garLoopResultBuilder]: At program point L62-3(lines 55 63) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_#res#1|)) [2022-02-20 16:37:42,949 INFO L861 garLoopResultBuilder]: At program point L77(lines 65 78) the Hoare annotation is: true [2022-02-20 16:37:42,949 INFO L858 garLoopResultBuilder]: For program point L73(lines 73 76) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L854 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))) [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point L59-1(lines 59 60) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~y#1|)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) |ULTIMATE.start_fmax_double_~x#1|))) [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point L57-1(lines 57 58) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2022-02-20 16:37:42,950 INFO L854 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res#1|) [2022-02-20 16:37:42,950 INFO L858 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2022-02-20 16:37:42,954 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:37:42,955 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:37:42,958 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:37:42,958 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:37:42,958 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:37:42,958 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L31-1 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L31-3 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: __fpclassify_doubleFINAL has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:37:42,959 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: L57-1 has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: __fpclassify_doubleEXIT has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:37:42,960 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:37:42,963 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L59-1 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L62 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L73 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L62-2 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: L74 has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:42,964 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:37:42,964 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:37:42,970 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:42,971 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:42,972 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:37:42 BoogieIcfgContainer [2022-02-20 16:37:42,972 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:37:42,973 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:37:42,973 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:37:42,973 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:37:42,974 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:37:33" (3/4) ... [2022-02-20 16:37:42,977 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:37:42,982 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __fpclassify_double [2022-02-20 16:37:42,986 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-02-20 16:37:42,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-02-20 16:37:42,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:37:42,987 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:37:43,008 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) [2022-02-20 16:37:43,009 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: 1bv32 == \result [2022-02-20 16:37:43,018 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:37:43,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:37:43,019 INFO L158 Benchmark]: Toolchain (without parser) took 10201.18ms. Allocated memory was 52.4MB in the beginning and 92.3MB in the end (delta: 39.8MB). Free memory was 29.9MB in the beginning and 36.3MB in the end (delta: -6.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,019 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:43,019 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.87ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.6MB in the beginning and 45.0MB in the end (delta: -15.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,020 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.73ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:37:43,020 INFO L158 Benchmark]: Boogie Preprocessor took 60.59ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 41.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,020 INFO L158 Benchmark]: RCFGBuilder took 429.97ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 42.6MB in the end (delta: -827.9kB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,021 INFO L158 Benchmark]: TraceAbstraction took 9263.04ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 42.1MB in the beginning and 39.0MB in the end (delta: 3.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,021 INFO L158 Benchmark]: Witness Printer took 44.99ms. Allocated memory is still 92.3MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:37:43,022 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 52.4MB. Free memory is still 34.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.87ms. Allocated memory was 52.4MB in the beginning and 62.9MB in the end (delta: 10.5MB). Free memory was 29.6MB in the beginning and 45.0MB in the end (delta: -15.4MB). Peak memory consumption was 9.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.73ms. Allocated memory is still 62.9MB. Free memory was 45.0MB in the beginning and 43.4MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.59ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 41.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 429.97ms. Allocated memory is still 62.9MB. Free memory was 41.7MB in the beginning and 42.6MB in the end (delta: -827.9kB). Peak memory consumption was 14.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9263.04ms. Allocated memory was 62.9MB in the beginning and 92.3MB in the end (delta: 29.4MB). Free memory was 42.1MB in the beginning and 39.0MB in the end (delta: 3.1MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. * Witness Printer took 44.99ms. Allocated memory is still 92.3MB. Free memory was 39.0MB in the beginning and 36.3MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. 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] * 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: 74]: 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 2 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 13, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11 mSDsluCounter, 1049 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 30 IncrementalHoareTripleChecker+Unchecked, 686 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 87 IncrementalHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 363 mSDtfsCounter, 87 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 26 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 43 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 246 ConstructedInterpolants, 20 QuantifiedInterpolants, 426 SizeOfPredicates, 32 NumberOfNonLiveVariables, 965 ConjunctsInSsa, 60 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 42/42 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: 18]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant [2022-02-20 16:37:43,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-02-20 16:37:43,029 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == \result) - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:37:43,061 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