./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1210.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/float_req_bl_1210.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 72a09b82a82aabea0c4a084a3d99a9a83ff3f66f3965fc10414482ebb802703c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:29,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:29,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:29,678 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:29,679 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:29,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:29,683 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:29,685 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:29,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:29,691 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:29,692 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:29,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:29,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:29,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:29,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:29,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:29,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:29,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:29,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:29,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:29,706 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:29,707 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:29,708 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:29,709 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:29,713 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:29,713 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:29,713 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:29,714 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:29,715 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:29,715 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:29,716 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:29,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:29,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:29,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:29,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:29,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:29,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:29,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:29,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:29,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:29,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:29,722 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:46:29,748 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:29,748 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:29,748 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:29,749 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:29,749 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:29,749 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:29,750 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:29,750 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:29,750 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:29,750 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:29,751 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:29,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:29,751 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:29,752 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:29,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:29,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:29,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:29,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:29,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:29,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:29,754 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:29,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:29,755 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 -> 72a09b82a82aabea0c4a084a3d99a9a83ff3f66f3965fc10414482ebb802703c [2022-02-20 16:46:29,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:29,979 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:29,981 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:29,982 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:29,982 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:29,983 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2022-02-20 16:46:30,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570d6d464/e875642315c8434e8d00c949d172b1be/FLAG30504ebc6 [2022-02-20 16:46:30,405 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:30,406 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2022-02-20 16:46:30,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570d6d464/e875642315c8434e8d00c949d172b1be/FLAG30504ebc6 [2022-02-20 16:46:30,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/570d6d464/e875642315c8434e8d00c949d172b1be [2022-02-20 16:46:30,430 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:30,432 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:30,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:30,433 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:30,436 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:30,437 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,437 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@116f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30, skipping insertion in model container [2022-02-20 16:46:30,437 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:30,457 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:30,618 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c[2159,2172] [2022-02-20 16:46:30,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:30,625 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:30,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c[2159,2172] [2022-02-20 16:46:30,643 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:30,652 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:30,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30 WrapperNode [2022-02-20 16:46:30,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:30,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:30,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:30,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:30,658 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:46:30" (1/1) ... [2022-02-20 16:46:30,664 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:46:30" (1/1) ... [2022-02-20 16:46:30,686 INFO L137 Inliner]: procedures = 16, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 145 [2022-02-20 16:46:30,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:30,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:30,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:30,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:30,692 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,692 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,704 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,705 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,721 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,732 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,734 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:30,741 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:30,741 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:30,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:30,742 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (1/1) ... [2022-02-20 16:46:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:30,755 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:30,765 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:46:30,768 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:46:30,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-02-20 16:46:30,794 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:30,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:30,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:30,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:30,849 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:30,850 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:31,225 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:31,229 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:31,230 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:31,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:31 BoogieIcfgContainer [2022-02-20 16:46:31,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:31,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:31,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:31,235 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:31,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:30" (1/3) ... [2022-02-20 16:46:31,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f6befe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:30" (2/3) ... [2022-02-20 16:46:31,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77f6befe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:31, skipping insertion in model container [2022-02-20 16:46:31,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:31" (3/3) ... [2022-02-20 16:46:31,240 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2022-02-20 16:46:31,244 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:31,245 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:31,286 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:31,293 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:46:31,293 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:31,310 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 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:46:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:31,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:31,316 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:46:31,317 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:31,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:31,322 INFO L85 PathProgramCache]: Analyzing trace with hash -218345182, now seen corresponding path program 1 times [2022-02-20 16:46:31,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:31,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673691204] [2022-02-20 16:46:31,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:31,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:31,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-02-20 16:46:31,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {42#true} is VALID [2022-02-20 16:46:31,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume true; {42#true} is VALID [2022-02-20 16:46:31,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42#true} {43#false} #130#return; {43#false} is VALID [2022-02-20 16:46:31,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#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(20, 2);call #Ultimate.allocInit(12, 3);~one_modf~0 := 1.0; {42#true} is VALID [2022-02-20 16:46:31,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {42#true} is VALID [2022-02-20 16:46:31,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume !true; {43#false} is VALID [2022-02-20 16:46:31,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {43#false} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {43#false} is VALID [2022-02-20 16:46:31,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {43#false} assume !(modf_float_~j0~0#1 < 23);havoc modf_float_~ix~1#1;call write~real(~someBinaryArithmeticFLOAToperation(modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4); {43#false} is VALID [2022-02-20 16:46:31,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-02-20 16:46:31,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-02-20 16:46:31,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#false} modf_float_#res#1 := modf_float_~x#1; {43#false} is VALID [2022-02-20 16:46:31,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#false} main_#t~ret12#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;call main_#t~mem13#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4); {43#false} is VALID [2022-02-20 16:46:31,488 INFO L272 TraceCheckUtils]: 9: Hoare triple {43#false} call main_#t~ret14#1 := isnan_float(main_#t~mem13#1); {42#true} is VALID [2022-02-20 16:46:31,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {42#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {42#true} is VALID [2022-02-20 16:46:31,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#true} assume true; {42#true} is VALID [2022-02-20 16:46:31,489 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {42#true} {43#false} #130#return; {43#false} is VALID [2022-02-20 16:46:31,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;main_#t~short16#1 := 0 != main_#t~ret14#1; {43#false} is VALID [2022-02-20 16:46:31,490 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume !main_#t~short16#1; {43#false} is VALID [2022-02-20 16:46:31,490 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume main_#t~short16#1;havoc main_#t~mem13#1;havoc main_#t~ret14#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {43#false} is VALID [2022-02-20 16:46:31,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-02-20 16:46:31,490 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:46:31,491 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:31,491 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673691204] [2022-02-20 16:46:31,492 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673691204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:31,492 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:31,492 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:31,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031049808] [2022-02-20 16:46:31,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:31,497 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:31,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,532 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:46:31,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:31,534 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:31,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:31,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:31,555 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 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 7.5) internal successors, (15), 2 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:46:31,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:31,631 INFO L93 Difference]: Finished difference Result 76 states and 114 transitions. [2022-02-20 16:46:31,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:31,632 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:31,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:46:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:46:31,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2022-02-20 16:46:31,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:31,778 INFO L225 Difference]: With dead ends: 76 [2022-02-20 16:46:31,778 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:46:31,781 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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:46:31,784 INFO L933 BasicCegarLoop]: 43 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, 43 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:46:31,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:31,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:46:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:46:31,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:31,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:31,825 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:31,826 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:31,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:31,829 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 16:46:31,829 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:31,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:31,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:31,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 36 states. [2022-02-20 16:46:31,831 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 36 states. [2022-02-20 16:46:31,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:31,835 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 16:46:31,835 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:31,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:31,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:31,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:31,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:31,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:31,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-02-20 16:46:31,844 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2022-02-20 16:46:31,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:31,845 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-20 16:46:31,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:31,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:31,850 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:31,851 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:31,851 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:31,851 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:31,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:31,853 INFO L85 PathProgramCache]: Analyzing trace with hash -667427839, now seen corresponding path program 1 times [2022-02-20 16:46:31,854 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:31,854 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27960136] [2022-02-20 16:46:31,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:31,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:31,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 16:46:31,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,980 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {262#true} is VALID [2022-02-20 16:46:31,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 16:46:31,981 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #130#return; {262#true} is VALID [2022-02-20 16:46:31,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {262#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(20, 2);call #Ultimate.allocInit(12, 3);~one_modf~0 := 1.0; {262#true} is VALID [2022-02-20 16:46:31,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticFLOAToperation(0.0, 0.0);call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {262#true} is VALID [2022-02-20 16:46:31,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~real(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);call modf_float_#t~mem4#1 := read~int(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4);modf_float_~i0~0#1 := (if modf_float_#t~mem4#1 % 4294967296 % 4294967296 <= 2147483647 then modf_float_#t~mem4#1 % 4294967296 % 4294967296 else modf_float_#t~mem4#1 % 4294967296 % 4294967296 - 4294967296);havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {262#true} is VALID [2022-02-20 16:46:31,982 INFO L290 TraceCheckUtils]: 3: Hoare triple {262#true} goto; {262#true} is VALID [2022-02-20 16:46:31,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {262#true} modf_float_~j0~0#1 := (if 0 == modf_float_~i0~0#1 / 8388608 then 0 else (if 1 == modf_float_~i0~0#1 / 8388608 then 1 else ~bitwiseAnd(modf_float_~i0~0#1 / 8388608, 255))) - 127; {262#true} is VALID [2022-02-20 16:46:31,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} assume modf_float_~j0~0#1 < 23; {262#true} is VALID [2022-02-20 16:46:31,983 INFO L290 TraceCheckUtils]: 6: Hoare triple {262#true} assume modf_float_~j0~0#1 < 0; {262#true} is VALID [2022-02-20 16:46:31,983 INFO L290 TraceCheckUtils]: 7: Hoare triple {262#true} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4);call write~int((if 0 == modf_float_~i0~0#1 then 0 else (if 1 == modf_float_~i0~0#1 then 0 else ~bitwiseAnd(modf_float_~i0~0#1, 2147483648))), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call modf_float_#t~mem5#1 := read~real(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4);call write~real(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {262#true} is VALID [2022-02-20 16:46:31,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {262#true} goto; {262#true} is VALID [2022-02-20 16:46:31,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {262#true} modf_float_#res#1 := modf_float_~x#1; {262#true} is VALID [2022-02-20 16:46:31,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {262#true} main_#t~ret12#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;call main_#t~mem13#1 := read~real(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4); {262#true} is VALID [2022-02-20 16:46:31,984 INFO L272 TraceCheckUtils]: 11: Hoare triple {262#true} call main_#t~ret14#1 := isnan_float(main_#t~mem13#1); {262#true} is VALID [2022-02-20 16:46:31,984 INFO L290 TraceCheckUtils]: 12: Hoare triple {262#true} ~x := #in~x;#res := (if ~someBinaryFLOATComparisonOperation(~x, ~x) then 1 else 0); {262#true} is VALID [2022-02-20 16:46:31,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {262#true} assume true; {262#true} is VALID [2022-02-20 16:46:31,984 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {262#true} {262#true} #130#return; {262#true} is VALID [2022-02-20 16:46:31,984 INFO L290 TraceCheckUtils]: 15: Hoare triple {262#true} assume -2147483648 <= main_#t~ret14#1 && main_#t~ret14#1 <= 2147483647;main_#t~short16#1 := 0 != main_#t~ret14#1; {262#true} is VALID [2022-02-20 16:46:31,985 INFO L290 TraceCheckUtils]: 16: Hoare triple {262#true} assume !main_#t~short16#1; {267#(not |ULTIMATE.start_main_#t~short16#1|)} is VALID [2022-02-20 16:46:31,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {267#(not |ULTIMATE.start_main_#t~short16#1|)} assume main_#t~short16#1;havoc main_#t~mem13#1;havoc main_#t~ret14#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {263#false} is VALID [2022-02-20 16:46:31,986 INFO L290 TraceCheckUtils]: 18: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-02-20 16:46:31,986 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:46:31,986 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:31,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27960136] [2022-02-20 16:46:31,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27960136] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:31,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:31,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:31,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445331717] [2022-02-20 16:46:31,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:31,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-02-20 16:46:31,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:31,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:32,003 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:46:32,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:32,004 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:32,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:32,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:32,005 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,053 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-02-20 16:46:32,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-02-20 16:46:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:32,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 16:46:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:32,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2022-02-20 16:46:32,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 42 transitions. [2022-02-20 16:46:32,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:32,089 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:46:32,089 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:46:32,092 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:46:32,094 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:32,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:32,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:46:32,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:46:32,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:32,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:46:32,101 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:46:32,101 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:46:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,108 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 16:46:32,108 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 16:46:32,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:32,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:32,109 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 36 states. [2022-02-20 16:46:32,109 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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 36 states. [2022-02-20 16:46:32,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:32,113 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-02-20 16:46:32,113 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 16:46:32,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:32,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:32,114 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:32,114 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 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:46:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-02-20 16:46:32,119 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 19 [2022-02-20 16:46:32,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:32,120 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-02-20 16:46:32,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:46:32,120 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-02-20 16:46:32,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:46:32,123 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:32,124 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:32,125 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:32,125 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:32,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1080249032, now seen corresponding path program 1 times [2022-02-20 16:46:32,125 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:32,125 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769321536] [2022-02-20 16:46:32,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:32,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:32,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:32,166 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:32,204 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:32,204 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:32,205 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:32,206 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:46:32,208 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:32,210 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:32,222 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret14 := isnan_float(#t~mem13); [2022-02-20 16:46:32,222 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:46:32,227 INFO L158 Benchmark]: Toolchain (without parser) took 1795.28ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 64.5MB in the beginning and 61.8MB in the end (delta: 2.8MB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,229 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:32,230 INFO L158 Benchmark]: CACSL2BoogieTranslator took 219.61ms. Allocated memory is still 96.5MB. Free memory was 64.4MB in the beginning and 70.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,231 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.72ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,231 INFO L158 Benchmark]: Boogie Preprocessor took 54.10ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,231 INFO L158 Benchmark]: RCFGBuilder took 490.16ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 95.9MB in the end (delta: -29.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,232 INFO L158 Benchmark]: TraceAbstraction took 993.72ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 61.8MB in the end (delta: 33.6MB). Peak memory consumption was 34.4MB. Max. memory is 16.1GB. [2022-02-20 16:46:32,233 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.16ms. Allocated memory is still 96.5MB. Free memory was 51.8MB in the beginning and 51.7MB in the end (delta: 45.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 219.61ms. Allocated memory is still 96.5MB. Free memory was 64.4MB in the beginning and 70.8MB in the end (delta: -6.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.72ms. Allocated memory is still 96.5MB. Free memory was 70.8MB in the beginning and 68.3MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.10ms. Allocated memory is still 96.5MB. Free memory was 68.3MB in the beginning and 66.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 490.16ms. Allocated memory was 96.5MB in the beginning and 119.5MB in the end (delta: 23.1MB). Free memory was 66.5MB in the beginning and 95.9MB in the end (delta: -29.4MB). Peak memory consumption was 23.3MB. Max. memory is 16.1GB. * TraceAbstraction took 993.72ms. Allocated memory is still 119.5MB. Free memory was 95.4MB in the beginning and 61.8MB in the end (delta: 33.6MB). Peak memory consumption was 34.4MB. 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:46:32,261 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/float_req_bl_1210.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 72a09b82a82aabea0c4a084a3d99a9a83ff3f66f3965fc10414482ebb802703c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:33,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:33,908 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:33,939 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:33,940 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:33,942 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:33,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:33,948 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:33,950 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:33,953 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:33,954 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:33,955 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:33,956 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:33,957 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:33,958 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:33,962 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:33,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:33,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:33,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:33,970 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:33,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:33,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:33,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:33,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:33,979 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:33,979 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:33,980 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:33,981 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:33,981 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:33,982 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:33,982 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:33,983 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:33,984 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:33,984 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:33,985 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:33,985 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:33,986 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:33,986 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:33,986 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:33,987 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:33,988 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:33,991 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:46:34,024 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:34,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:34,025 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:34,026 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:34,026 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:34,026 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:34,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:34,028 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:34,028 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:34,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:34,029 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:34,029 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:34,029 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:34,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:34,030 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:34,031 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:34,031 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:34,031 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:34,031 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:34,031 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:34,031 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:34,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:34,032 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:34,032 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:34,032 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:34,032 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:34,032 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:34,033 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:34,033 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:34,033 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:34,033 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:34,034 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 -> 72a09b82a82aabea0c4a084a3d99a9a83ff3f66f3965fc10414482ebb802703c [2022-02-20 16:46:34,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:34,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:34,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:34,302 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:34,302 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:34,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2022-02-20 16:46:34,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cd0591/86d3f9df0c02477186385078eff314eb/FLAGea60284c9 [2022-02-20 16:46:34,628 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:34,629 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c [2022-02-20 16:46:34,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cd0591/86d3f9df0c02477186385078eff314eb/FLAGea60284c9 [2022-02-20 16:46:35,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad0cd0591/86d3f9df0c02477186385078eff314eb [2022-02-20 16:46:35,086 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:35,087 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:35,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:35,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:35,091 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:35,092 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6624d9a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,101 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:35,114 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:35,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c[2159,2172] [2022-02-20 16:46:35,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:35,239 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:35,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1210.c[2159,2172] [2022-02-20 16:46:35,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:35,289 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:35,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35 WrapperNode [2022-02-20 16:46:35,293 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:35,294 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:35,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:35,294 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:35,298 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:46:35" (1/1) ... [2022-02-20 16:46:35,305 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:46:35" (1/1) ... [2022-02-20 16:46:35,326 INFO L137 Inliner]: procedures = 19, calls = 48, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 144 [2022-02-20 16:46:35,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:35,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:35,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:35,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:35,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,349 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:35,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:35,354 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:35,354 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:35,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (1/1) ... [2022-02-20 16:46:35,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:35,392 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:46:35,405 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:46:35,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:35,421 INFO L130 BoogieDeclarations]: Found specification of procedure isnan_float [2022-02-20 16:46:35,421 INFO L138 BoogieDeclarations]: Found implementation of procedure isnan_float [2022-02-20 16:46:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:35,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:35,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:35,476 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:35,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:35,839 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:35,844 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:35,844 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:46:35,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35 BoogieIcfgContainer [2022-02-20 16:46:35,846 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:35,847 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:35,847 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:35,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:35,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:35" (1/3) ... [2022-02-20 16:46:35,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e7365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:35" (2/3) ... [2022-02-20 16:46:35,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595e7365 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:35, skipping insertion in model container [2022-02-20 16:46:35,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:35" (3/3) ... [2022-02-20 16:46:35,852 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1210.c [2022-02-20 16:46:35,855 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:35,855 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:35,884 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:35,889 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:46:35,889 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 39 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 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:46:35,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:46:35,905 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:35,906 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:46:35,906 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -218345182, now seen corresponding path program 1 times [2022-02-20 16:46:35,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:35,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958087607] [2022-02-20 16:46:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:35,919 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:35,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:35,921 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:46:35,923 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:46:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:36,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:36,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {42#true} is VALID [2022-02-20 16:46:36,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {42#true} is VALID [2022-02-20 16:46:36,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {42#true} assume !true; {43#false} is VALID [2022-02-20 16:46:36,164 INFO L290 TraceCheckUtils]: 3: Hoare triple {43#false} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {43#false} is VALID [2022-02-20 16:46:36,165 INFO L290 TraceCheckUtils]: 4: Hoare triple {43#false} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {43#false} is VALID [2022-02-20 16:46:36,165 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-02-20 16:46:36,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {43#false} assume !true; {43#false} is VALID [2022-02-20 16:46:36,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#false} modf_float_#res#1 := modf_float_~x#1; {43#false} is VALID [2022-02-20 16:46:36,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#false} main_#t~ret12#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;call main_#t~mem13#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32); {43#false} is VALID [2022-02-20 16:46:36,166 INFO L272 TraceCheckUtils]: 9: Hoare triple {43#false} call main_#t~ret14#1 := isnan_float(main_#t~mem13#1); {43#false} is VALID [2022-02-20 16:46:36,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {43#false} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {43#false} is VALID [2022-02-20 16:46:36,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {43#false} assume true; {43#false} is VALID [2022-02-20 16:46:36,167 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {43#false} {43#false} #130#return; {43#false} is VALID [2022-02-20 16:46:36,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#false} main_#t~short16#1 := 0bv32 != main_#t~ret14#1; {43#false} is VALID [2022-02-20 16:46:36,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {43#false} assume !main_#t~short16#1; {43#false} is VALID [2022-02-20 16:46:36,167 INFO L290 TraceCheckUtils]: 15: Hoare triple {43#false} assume main_#t~short16#1;havoc main_#t~mem13#1;havoc main_#t~ret14#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {43#false} is VALID [2022-02-20 16:46:36,168 INFO L290 TraceCheckUtils]: 16: Hoare triple {43#false} assume !false; {43#false} is VALID [2022-02-20 16:46:36,168 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:46:36,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:36,169 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:36,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958087607] [2022-02-20 16:46:36,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958087607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:36,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:36,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:36,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664032854] [2022-02-20 16:46:36,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:36,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,178 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:36,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,224 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:46:36,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:36,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:36,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:36,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:36,240 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.588235294117647) internal successors, (54), 35 states have internal predecessors, (54), 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 7.5) internal successors, (15), 2 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:46:36,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,351 INFO L93 Difference]: Finished difference Result 76 states and 114 transitions. [2022-02-20 16:46:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:36,351 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:36,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:46:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 114 transitions. [2022-02-20 16:46:36,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 114 transitions. [2022-02-20 16:46:36,516 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:36,522 INFO L225 Difference]: With dead ends: 76 [2022-02-20 16:46:36,522 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:46:36,524 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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:46:36,527 INFO L933 BasicCegarLoop]: 43 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, 43 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:46:36,527 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:36,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:46:36,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:46:36,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:36,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:36,547 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:36,548 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:36,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,551 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 16:46:36,551 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:36,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:36,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:36,552 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 36 states. [2022-02-20 16:46:36,557 INFO L87 Difference]: Start difference. First operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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 36 states. [2022-02-20 16:46:36,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:36,560 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-02-20 16:46:36,560 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:36,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:36,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:36,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:36,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:36,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 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:46:36,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-02-20 16:46:36,564 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 17 [2022-02-20 16:46:36,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:36,564 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-02-20 16:46:36,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:46:36,565 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-02-20 16:46:36,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:46:36,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:36,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:36,591 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:46:36,778 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:46:36,778 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:36,779 INFO L85 PathProgramCache]: Analyzing trace with hash -667427839, now seen corresponding path program 1 times [2022-02-20 16:46:36,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:36,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283750778] [2022-02-20 16:46:36,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:36,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:36,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:36,783 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:46:36,785 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:46:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:36,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:36,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:37,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {307#true} is VALID [2022-02-20 16:46:37,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {315#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:37,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {315#(exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_modf_float_~x#1| (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {319#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:37,112 INFO L290 TraceCheckUtils]: 3: Hoare triple {319#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} goto; {319#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} is VALID [2022-02-20 16:46:37,114 INFO L290 TraceCheckUtils]: 4: Hoare triple {319#(exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {326#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} is VALID [2022-02-20 16:46:37,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {326#(exists ((|ULTIMATE.start_modf_float_~i0~0#1| (_ BitVec 32))) (and (= (bvadd (bvand (bvashr |ULTIMATE.start_modf_float_~i0~0#1| (_ bv23 32)) (_ bv255 32)) (_ bv4294967169 32)) |ULTIMATE.start_modf_float_~j0~0#1|) (exists ((currentRoundingMode RoundingMode)) (= (fp ((_ extract 31 31) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 30 23) |ULTIMATE.start_modf_float_~i0~0#1|) ((_ extract 22 0) |ULTIMATE.start_modf_float_~i0~0#1|)) (fp.div currentRoundingMode (_ +zero 8 24) (_ +zero 8 24))))))} assume ~bvslt32(modf_float_~j0~0#1, 23bv32); {308#false} is VALID [2022-02-20 16:46:37,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {308#false} assume ~bvslt32(modf_float_~j0~0#1, 0bv32); {308#false} is VALID [2022-02-20 16:46:37,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {308#false} call modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~i0~0#1), modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call modf_float_#t~mem5#1 := read~intFLOATTYPE4(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, 4bv32);call write~intFLOATTYPE4(modf_float_#t~mem5#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32);havoc modf_float_#t~mem5#1;call ULTIMATE.dealloc(modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset);havoc modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset; {308#false} is VALID [2022-02-20 16:46:37,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {308#false} goto; {308#false} is VALID [2022-02-20 16:46:37,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {308#false} modf_float_#res#1 := modf_float_~x#1; {308#false} is VALID [2022-02-20 16:46:37,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {308#false} main_#t~ret12#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;call main_#t~mem13#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32); {308#false} is VALID [2022-02-20 16:46:37,120 INFO L272 TraceCheckUtils]: 11: Hoare triple {308#false} call main_#t~ret14#1 := isnan_float(main_#t~mem13#1); {308#false} is VALID [2022-02-20 16:46:37,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {308#false} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {308#false} is VALID [2022-02-20 16:46:37,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {308#false} assume true; {308#false} is VALID [2022-02-20 16:46:37,121 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {308#false} {308#false} #130#return; {308#false} is VALID [2022-02-20 16:46:37,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {308#false} main_#t~short16#1 := 0bv32 != main_#t~ret14#1; {308#false} is VALID [2022-02-20 16:46:37,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {308#false} assume !main_#t~short16#1; {308#false} is VALID [2022-02-20 16:46:37,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {308#false} assume main_#t~short16#1;havoc main_#t~mem13#1;havoc main_#t~ret14#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {308#false} is VALID [2022-02-20 16:46:37,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {308#false} assume !false; {308#false} is VALID [2022-02-20 16:46:37,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:46:37,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:37,123 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:37,123 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283750778] [2022-02-20 16:46:37,123 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283750778] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:37,123 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:37,124 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:37,124 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075998965] [2022-02-20 16:46:37,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2022-02-20 16:46:37,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:37,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:46:37,163 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:46:37,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:37,164 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:37,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:37,167 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:46:37,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:37,314 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2022-02-20 16:46:37,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:37,314 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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 19 [2022-02-20 16:46:37,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:37,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:46:37,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:46:37,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:37,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:46:37,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:37,407 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:46:37,407 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:37,408 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 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:46:37,409 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:37,409 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 77 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-02-20 16:46:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:37,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:37,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:37,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:37,412 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:37,412 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:37,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:37,414 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 16:46:37,414 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 16:46:37,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:37,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:37,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 23 states. [2022-02-20 16:46:37,415 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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 23 states. [2022-02-20 16:46:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:37,417 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 16:46:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 16:46:37,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:37,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:37,417 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:37,417 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:37,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 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:46:37,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 16:46:37,419 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-02-20 16:46:37,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:37,419 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 16:46:37,420 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 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:46:37,420 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 16:46:37,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 16:46:37,420 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:37,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:37,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:46:37,628 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:46:37,629 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:37,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:37,630 INFO L85 PathProgramCache]: Analyzing trace with hash 971993530, now seen corresponding path program 1 times [2022-02-20 16:46:37,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:37,630 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309366195] [2022-02-20 16:46:37,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:37,630 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:37,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:37,632 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:46:37,633 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:46:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:37,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:46:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:37,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:37,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {504#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(20bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_modf~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0)); {504#true} is VALID [2022-02-20 16:46:37,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {504#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret12#1, main_#t~mem13#1, main_#t~ret14#1, main_#t~ret15#1, main_#t~short16#1, main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset, main_~res~0#1;main_~x~0#1 := ~fp.div~FLOAT(currentRoundingMode, ~Pluszero~FLOAT(), ~Pluszero~FLOAT());call main_~#iptr~0#1.base, main_~#iptr~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_modf_float } true;modf_float_#in~x#1, modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset := main_~x~0#1, main_~#iptr~0#1.base, main_~#iptr~0#1.offset;havoc modf_float_#res#1;havoc modf_float_#t~mem4#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, modf_float_#t~mem5#1, modf_float_~#sf_u~0#1.base, modf_float_~#sf_u~0#1.offset, modf_float_#t~mem6#1, modf_float_~#gf_u~1#1.base, modf_float_~#gf_u~1#1.offset, modf_float_#t~mem7#1, modf_float_~#sf_u~1#1.base, modf_float_~#sf_u~1#1.offset, modf_float_~ix~0#1, modf_float_#t~mem8#1, modf_float_~#sf_u~2#1.base, modf_float_~#sf_u~2#1.offset, modf_float_#t~mem9#1, modf_float_#t~mem10#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, modf_float_#t~mem11#1, modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, modf_float_~ix~1#1, modf_float_~x#1, modf_float_~iptr#1.base, modf_float_~iptr#1.offset, modf_float_~i0~0#1, modf_float_~j0~0#1, modf_float_~i~0#1;modf_float_~x#1 := modf_float_#in~x#1;modf_float_~iptr#1.base, modf_float_~iptr#1.offset := modf_float_#in~iptr#1.base, modf_float_#in~iptr#1.offset;havoc modf_float_~i0~0#1;havoc modf_float_~j0~0#1;havoc modf_float_~i~0#1; {504#true} is VALID [2022-02-20 16:46:37,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {504#true} call modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);call modf_float_#t~mem4#1 := read~intINTTYPE4(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset, 4bv32);modf_float_~i0~0#1 := modf_float_#t~mem4#1;havoc modf_float_#t~mem4#1;call ULTIMATE.dealloc(modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset);havoc modf_float_~#gf_u~0#1.base, modf_float_~#gf_u~0#1.offset; {504#true} is VALID [2022-02-20 16:46:37,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {504#true} goto; {504#true} is VALID [2022-02-20 16:46:37,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {504#true} modf_float_~j0~0#1 := ~bvsub32(~bvand32(255bv32, ~bvashr32(modf_float_~i0~0#1, 23bv32)), 127bv32); {504#true} is VALID [2022-02-20 16:46:37,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {504#true} assume !~bvslt32(modf_float_~j0~0#1, 23bv32);havoc modf_float_~ix~1#1;call write~intFLOATTYPE4(~fp.mul~FLOAT(currentRoundingMode, modf_float_~x#1, ~one_modf~0), modf_float_~iptr#1.base, modf_float_~iptr#1.offset, 4bv32); {504#true} is VALID [2022-02-20 16:46:37,806 INFO L290 TraceCheckUtils]: 6: Hoare triple {504#true} call modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(modf_float_~x#1, modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);call modf_float_#t~mem10#1 := read~intINTTYPE4(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset, 4bv32);modf_float_~ix~1#1 := modf_float_#t~mem10#1;havoc modf_float_#t~mem10#1;call ULTIMATE.dealloc(modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset);havoc modf_float_~#gf_u~2#1.base, modf_float_~#gf_u~2#1.offset; {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 7: Hoare triple {504#true} goto; {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {504#true} call modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset := #Ultimate.allocOnStack(4bv32);call write~intINTTYPE4(~bvand32(2147483648bv32, modf_float_~ix~1#1), modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);call modf_float_#t~mem11#1 := read~intFLOATTYPE4(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset, 4bv32);modf_float_~x#1 := modf_float_#t~mem11#1;havoc modf_float_#t~mem11#1;call ULTIMATE.dealloc(modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset);havoc modf_float_~#sf_u~3#1.base, modf_float_~#sf_u~3#1.offset; {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {504#true} goto; {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 10: Hoare triple {504#true} modf_float_#res#1 := modf_float_~x#1; {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 11: Hoare triple {504#true} main_#t~ret12#1 := modf_float_#res#1;assume { :end_inline_modf_float } true;main_~res~0#1 := main_#t~ret12#1;havoc main_#t~ret12#1;call main_#t~mem13#1 := read~intFLOATTYPE4(main_~#iptr~0#1.base, main_~#iptr~0#1.offset, 4bv32); {504#true} is VALID [2022-02-20 16:46:37,807 INFO L272 TraceCheckUtils]: 12: Hoare triple {504#true} call main_#t~ret14#1 := isnan_float(main_#t~mem13#1); {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 13: Hoare triple {504#true} ~x := #in~x;#res := (if !~fp.eq~FLOAT(~x, ~x) then 1bv32 else 0bv32); {504#true} is VALID [2022-02-20 16:46:37,807 INFO L290 TraceCheckUtils]: 14: Hoare triple {504#true} assume true; {504#true} is VALID [2022-02-20 16:46:37,808 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {504#true} {504#true} #130#return; {504#true} is VALID [2022-02-20 16:46:37,808 INFO L290 TraceCheckUtils]: 16: Hoare triple {504#true} main_#t~short16#1 := 0bv32 != main_#t~ret14#1; {504#true} is VALID [2022-02-20 16:46:37,808 INFO L290 TraceCheckUtils]: 17: Hoare triple {504#true} assume !main_#t~short16#1; {560#(not |ULTIMATE.start_main_#t~short16#1|)} is VALID [2022-02-20 16:46:37,809 INFO L290 TraceCheckUtils]: 18: Hoare triple {560#(not |ULTIMATE.start_main_#t~short16#1|)} assume main_#t~short16#1;havoc main_#t~mem13#1;havoc main_#t~ret14#1;havoc main_#t~ret15#1;havoc main_#t~short16#1; {505#false} is VALID [2022-02-20 16:46:37,809 INFO L290 TraceCheckUtils]: 19: Hoare triple {505#false} assume !false; {505#false} is VALID [2022-02-20 16:46:37,809 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:46:37,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:37,809 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:37,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309366195] [2022-02-20 16:46:37,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [309366195] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:37,810 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:37,810 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:46:37,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901294552] [2022-02-20 16:46:37,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:37,811 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-02-20 16:46:37,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:37,811 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:37,851 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:46:37,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:46:37,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:37,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:46:37,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:46:37,852 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:38,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,038 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2022-02-20 16:46:38,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:46:38,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 20 [2022-02-20 16:46:38,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:38,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 16:46:38,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:38,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 16:46:38,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 16:46:38,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:38,087 INFO L225 Difference]: With dead ends: 26 [2022-02-20 16:46:38,087 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:46:38,088 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:46:38,088 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:38,089 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:46:38,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:46:38,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:46:38,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:38,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:38,091 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:38,091 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:38,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,093 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 16:46:38,093 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 16:46:38,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 23 states. [2022-02-20 16:46:38,093 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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 23 states. [2022-02-20 16:46:38,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:38,095 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2022-02-20 16:46:38,095 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 16:46:38,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:38,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:38,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:38,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:38,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.0) internal successors, (19), 19 states have internal predecessors, (19), 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:46:38,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-02-20 16:46:38,096 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2022-02-20 16:46:38,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:38,097 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-02-20 16:46:38,097 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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:46:38,097 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-02-20 16:46:38,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:46:38,097 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:38,098 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:38,117 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:46:38,315 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:46:38,316 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:38,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:38,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1443547935, now seen corresponding path program 1 times [2022-02-20 16:46:38,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:38,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509610086] [2022-02-20 16:46:38,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:38,317 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:38,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:38,318 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:46:38,322 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:46:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:38,442 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:38,564 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 16:46:38,565 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:38,565 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:38,579 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:46:38,767 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:46:38,769 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:46:38,771 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:38,793 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call #t~ret14 := isnan_float(#t~mem13); [2022-02-20 16:46:38,794 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.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) 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:46:38,796 INFO L158 Benchmark]: Toolchain (without parser) took 3709.00ms. Allocated memory was 56.6MB in the beginning and 83.9MB in the end (delta: 27.3MB). Free memory was 35.5MB in the beginning and 55.1MB in the end (delta: -19.6MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,796 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:38,796 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.03ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.3MB in the beginning and 51.4MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,797 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.98ms. Allocated memory is still 69.2MB. Free memory was 51.4MB in the beginning and 49.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,797 INFO L158 Benchmark]: Boogie Preprocessor took 26.46ms. Allocated memory is still 69.2MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,797 INFO L158 Benchmark]: RCFGBuilder took 491.50ms. Allocated memory is still 69.2MB. Free memory was 47.0MB in the beginning and 48.1MB in the end (delta: -1.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,797 INFO L158 Benchmark]: TraceAbstraction took 2948.54ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 55.1MB in the end (delta: -7.7MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:38,799 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.19ms. Allocated memory is still 56.6MB. Free memory was 38.3MB in the beginning and 38.2MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.03ms. Allocated memory was 56.6MB in the beginning and 69.2MB in the end (delta: 12.6MB). Free memory was 35.3MB in the beginning and 51.4MB in the end (delta: -16.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.98ms. Allocated memory is still 69.2MB. Free memory was 51.4MB in the beginning and 49.1MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.46ms. Allocated memory is still 69.2MB. Free memory was 49.1MB in the beginning and 47.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 491.50ms. Allocated memory is still 69.2MB. Free memory was 47.0MB in the beginning and 48.1MB in the end (delta: -1.1MB). Peak memory consumption was 16.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2948.54ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 47.5MB in the beginning and 55.1MB in the end (delta: -7.7MB). Peak memory consumption was 7.0MB. 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:46:38,834 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: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator