./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1121b.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_1121b.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 16c784491c1bbafa07f396e2da5c8acc0901ffa28fc7d85f1b184d422e9c5e0e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:21,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:21,961 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:21,994 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:21,994 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:21,997 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:21,998 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:22,000 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:22,002 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:22,005 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:22,005 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:22,006 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:22,007 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:22,009 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:22,010 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:22,012 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:22,013 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:22,014 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:22,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:22,020 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:22,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:22,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:22,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:22,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:22,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:22,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:22,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:22,033 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:22,033 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:22,034 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:22,034 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:22,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:22,036 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:22,037 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:22,038 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:22,038 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:22,038 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:22,039 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:22,039 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:22,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:22,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:22,042 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:22,065 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:22,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:22,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:22,066 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:22,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:22,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:22,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:22,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:22,068 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:22,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:22,070 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:22,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:46:22,070 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:22,070 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:22,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:22,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:22,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:22,071 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:22,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:22,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:22,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:22,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:22,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:22,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:22,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:22,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:22,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:22,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:22,073 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:46:22,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:46:22,074 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:22,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:22,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:22,074 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 -> 16c784491c1bbafa07f396e2da5c8acc0901ffa28fc7d85f1b184d422e9c5e0e [2022-02-20 16:46:22,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:22,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:22,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:22,296 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:22,296 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:22,297 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1121b.c [2022-02-20 16:46:22,350 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ef8b78c/f8586b913c534aa48b4aa8b868db5fd9/FLAG3725fc623 [2022-02-20 16:46:22,728 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:22,729 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1121b.c [2022-02-20 16:46:22,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ef8b78c/f8586b913c534aa48b4aa8b868db5fd9/FLAG3725fc623 [2022-02-20 16:46:23,150 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70ef8b78c/f8586b913c534aa48b4aa8b868db5fd9 [2022-02-20 16:46:23,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:23,153 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:23,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:23,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:23,156 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:23,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4756357b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23, skipping insertion in model container [2022-02-20 16:46:23,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,162 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:23,176 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:23,356 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_1121b.c[2700,2713] [2022-02-20 16:46:23,359 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:23,368 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:23,407 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_1121b.c[2700,2713] [2022-02-20 16:46:23,407 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:23,433 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:23,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23 WrapperNode [2022-02-20 16:46:23,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:23,434 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:23,434 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:23,434 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:23,439 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:23" (1/1) ... [2022-02-20 16:46:23,445 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:23" (1/1) ... [2022-02-20 16:46:23,468 INFO L137 Inliner]: procedures = 18, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 205 [2022-02-20 16:46:23,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:23,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:23,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:23,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:23,475 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:23" (1/1) ... [2022-02-20 16:46:23,475 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:23" (1/1) ... [2022-02-20 16:46:23,478 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:23" (1/1) ... [2022-02-20 16:46:23,478 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:23" (1/1) ... [2022-02-20 16:46:23,485 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:23" (1/1) ... [2022-02-20 16:46:23,489 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:23" (1/1) ... [2022-02-20 16:46:23,491 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:23" (1/1) ... [2022-02-20 16:46:23,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:23,494 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:23,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:23,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:23,496 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (1/1) ... [2022-02-20 16:46:23,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:23,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:23,550 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:23,560 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:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:46:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:23,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:46:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:46:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:46:23,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:23,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:46:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-02-20 16:46:23,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:23,643 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:23,644 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:24,028 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:24,037 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:24,039 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:24,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:24 BoogieIcfgContainer [2022-02-20 16:46:24,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:24,042 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:24,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:24,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:24,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:23" (1/3) ... [2022-02-20 16:46:24,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9bee23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:24, skipping insertion in model container [2022-02-20 16:46:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:23" (2/3) ... [2022-02-20 16:46:24,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c9bee23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:46:24, skipping insertion in model container [2022-02-20 16:46:24,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:24" (3/3) ... [2022-02-20 16:46:24,048 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1121b.c [2022-02-20 16:46:24,052 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:24,053 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:24,093 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:24,099 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:24,100 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 16:46:24,118 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:24,119 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:24,119 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:24,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:24,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1366069876, now seen corresponding path program 1 times [2022-02-20 16:46:24,130 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:24,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29009207] [2022-02-20 16:46:24,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:24,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:24,259 INFO L290 TraceCheckUtils]: 0: Hoare triple {57#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~one_fmod~0 := 1.0;~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4, 0;call #Ultimate.allocInit(8, 4);call write~init~real(0.0, ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4);call write~init~real(~someUnaryDOUBLEoperation(0.0), ~#Zero_fmod~0.base, 4 + ~#Zero_fmod~0.offset, 4); {57#true} is VALID [2022-02-20 16:46:24,259 INFO L290 TraceCheckUtils]: 1: Hoare triple {57#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet15#1, main_#t~ret16#1, main_#t~ret17#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;main_~y~0#1 := ~someUnaryFLOAToperation(0.0);assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem7#1, fmod_float_#t~mem11#1, fmod_float_#t~post10#1, fmod_float_#t~mem12#1, fmod_float_#t~mem13#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem14#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1, fmod_float_#t~nondet6#1, fmod_float_#t~nondet8#1, fmod_float_#t~nondet9#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {57#true} is VALID [2022-02-20 16:46:24,260 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:46:24,260 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} assume !true; {58#false} is VALID [2022-02-20 16:46:24,260 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume 0 == fmod_float_~hx~0#1;fmod_float_~sx~0#1 := 0; {58#false} is VALID [2022-02-20 16:46:24,261 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#false} fmod_float_~hx~0#1 := (if (1 == fmod_float_~hx~0#1 || 0 == fmod_float_~hx~0#1) && (1 == fmod_float_~sx~0#1 || 0 == fmod_float_~sx~0#1) then (if fmod_float_~hx~0#1 == fmod_float_~sx~0#1 then 0 else 1) else (if 0 == fmod_float_~hx~0#1 then fmod_float_~sx~0#1 else (if 0 == fmod_float_~sx~0#1 then fmod_float_~hx~0#1 else ~bitwiseXOr(fmod_float_~hx~0#1, fmod_float_~sx~0#1))));fmod_float_~hy~0#1 := (if 0 == fmod_float_~hy~0#1 then 0 else (if 1 == fmod_float_~hy~0#1 then 1 else ~bitwiseAnd(fmod_float_~hy~0#1, 2147483647))); {58#false} is VALID [2022-02-20 16:46:24,261 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#false} assume (0 == fmod_float_~hy~0#1 || !(fmod_float_~hx~0#1 < 2139095040)) || fmod_float_~hy~0#1 > 2139095040;fmod_float_#res#1 := ~someBinaryArithmeticFLOAToperation(~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1), ~someBinaryArithmeticFLOAToperation(fmod_float_~x#1, fmod_float_~y#1)); {58#false} is VALID [2022-02-20 16:46:24,261 INFO L290 TraceCheckUtils]: 7: Hoare triple {58#false} main_#t~ret16#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret16#1;havoc main_#t~ret16#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if ~someBinaryFLOATComparisonOperation(isnan_float_~x#1, isnan_float_~x#1) then 1 else 0); {58#false} is VALID [2022-02-20 16:46:24,262 INFO L290 TraceCheckUtils]: 8: Hoare triple {58#false} main_#t~ret17#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true;assume -2147483648 <= main_#t~ret17#1 && main_#t~ret17#1 <= 2147483647; {58#false} is VALID [2022-02-20 16:46:24,262 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#false} assume 0 == main_#t~ret17#1;havoc main_#t~ret17#1; {58#false} is VALID [2022-02-20 16:46:24,263 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:46:24,264 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:24,264 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:46:24,264 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29009207] [2022-02-20 16:46:24,265 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29009207] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:24,266 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:24,266 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:24,269 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909850871] [2022-02-20 16:46:24,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:24,273 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:24,274 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:24,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:24,293 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:46:24,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:24,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:24,313 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.8076923076923077) internal successors, (94), 53 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,409 INFO L93 Difference]: Finished difference Result 106 states and 186 transitions. [2022-02-20 16:46:24,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:24,409 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 16:46:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 186 transitions. [2022-02-20 16:46:24,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 186 transitions. [2022-02-20 16:46:24,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:24,572 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:46:24,572 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:46:24,574 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:24,577 INFO L933 BasicCegarLoop]: 73 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, 73 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:24,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 73 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:24,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:46:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:46:24,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:24,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,599 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,599 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,602 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:24,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:46:24,603 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:46:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:24,605 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-02-20 16:46:24,605 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:24,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:24,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:24,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:24,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.4) internal successors, (70), 50 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-02-20 16:46:24,609 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 11 [2022-02-20 16:46:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:24,610 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-02-20 16:46:24,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-02-20 16:46:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:24,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:24,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:24,611 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:46:24,611 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:24,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:24,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1947332695, now seen corresponding path program 1 times [2022-02-20 16:46:24,612 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:46:24,612 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203738622] [2022-02-20 16:46:24,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:24,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:46:24,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:24,655 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:46:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:46:24,701 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:46:24,701 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:46:24,703 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:24,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:46:24,707 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:46:24,709 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:24,726 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:24,727 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L32-7 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:24,728 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L32-3 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L106 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L32-5 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L110 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:46:24,729 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L128 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:24,730 WARN L170 areAnnotationChecker]: L43-3 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L49-3 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:24,731 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L54 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L55-2 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:46:24,732 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L55-4 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L69-2 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:24,733 WARN L170 areAnnotationChecker]: L55-6 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L61-4 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L61-6 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:46:24,734 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L84-2 has no Hoare annotation [2022-02-20 16:46:24,735 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L90-2 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L99-2 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:24,736 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:46:24,737 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:46:24,737 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:46:24,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:46:24 BoogieIcfgContainer [2022-02-20 16:46:24,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:46:24,738 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:46:24,738 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:46:24,738 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:46:24,739 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:24" (3/4) ... [2022-02-20 16:46:24,741 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:46:24,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:46:24,742 INFO L158 Benchmark]: Toolchain (without parser) took 1588.92ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 81.6MB in the beginning and 117.8MB in the end (delta: -36.2MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,742 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 111.1MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:46:24,742 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.62ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 82.0MB in the end (delta: -659.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.98ms. Allocated memory is still 111.1MB. Free memory was 82.0MB in the beginning and 78.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,743 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 111.1MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,744 INFO L158 Benchmark]: RCFGBuilder took 545.98ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 76.6MB in the beginning and 125.6MB in the end (delta: -49.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,744 INFO L158 Benchmark]: TraceAbstraction took 696.01ms. Allocated memory is still 153.1MB. Free memory was 125.6MB in the beginning and 118.8MB in the end (delta: 6.7MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,744 INFO L158 Benchmark]: Witness Printer took 2.95ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 117.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:46:24,746 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.14ms. Allocated memory is still 111.1MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.62ms. Allocated memory is still 111.1MB. Free memory was 81.3MB in the beginning and 82.0MB in the end (delta: -659.2kB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.98ms. Allocated memory is still 111.1MB. Free memory was 82.0MB in the beginning and 78.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 111.1MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 545.98ms. Allocated memory was 111.1MB in the beginning and 153.1MB in the end (delta: 41.9MB). Free memory was 76.6MB in the beginning and 125.6MB in the end (delta: -49.0MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * TraceAbstraction took 696.01ms. Allocated memory is still 153.1MB. Free memory was 125.6MB in the beginning and 118.8MB in the end (delta: 6.7MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * Witness Printer took 2.95ms. Allocated memory is still 153.1MB. Free memory was 118.8MB in the beginning and 117.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 124]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 110, overapproximation of someUnaryDOUBLEoperation at line 16, overapproximation of bitwiseAnd at line 34, overapproximation of someUnaryFLOAToperation at line 119, overapproximation of bitwiseXOr at line 33, overapproximation of someBinaryArithmeticFLOAToperation at line 37. Possible FailurePath: [L14-L17] static const float one_fmod = 1.0, Zero_fmod[] = { 0.0, -0.0, }; VAL [one_fmod=1, Zero_fmod={4:0}] [L118] float x = __VERIFIER_nondet_float(); [L119] float y = -0.0f; [L120] CALL, EXPR fmod_float(x, y) [L20] __int32_t n, hx, hy, hz, ix, iy, sx, i; VAL [\old(x)=4294967299, \old(y)=4294967297, one_fmod=1, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L23] ieee_float_shape_type gf_u; [L24] gf_u.value = (x) [L25] EXPR gf_u.word [L25] (hx) = gf_u.word [L28] ieee_float_shape_type gf_u; [L29] gf_u.value = (y) [L30] EXPR gf_u.word [L30] (hy) = gf_u.word [L32] sx = hx & 0x80000000 VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=-1, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L33] hx ^= sx [L34] hy &= 0x7fffffff VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L36] COND TRUE ((hy) == 0) || !((hx) < 0x7f800000L) || ((hy) > 0x7f800000L) [L37] return (x * y) / (x * y); VAL [\old(x)=4294967299, \old(y)=4294967297, hx=0, hy=0, one_fmod=1, sx=0, x=4294967299, y=4294967297, Zero_fmod={4:0}] [L120] RET, EXPR fmod_float(x, y) [L120] float res = fmod_float(x, y); [L123] CALL, EXPR isnan_float(res) [L110] return x != x; VAL [\old(x)=4294967298, \result=0, one_fmod=1, x=4294967298, Zero_fmod={4:0}] [L123] RET, EXPR isnan_float(res) [L123] COND TRUE !isnan_float(res) [L124] reach_error() VAL [one_fmod=1, res=4294967298, x=4294967299, y=4294967297, Zero_fmod={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 73 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 73 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 10 ConstructedInterpolants, 0 QuantifiedInterpolants, 10 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:46:24,774 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1121b.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 16c784491c1bbafa07f396e2da5c8acc0901ffa28fc7d85f1b184d422e9c5e0e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:46:26,689 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:46:26,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:46:26,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:46:26,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:46:26,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:46:26,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:46:26,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:46:26,734 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:46:26,739 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:46:26,741 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:46:26,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:46:26,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:46:26,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:46:26,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:46:26,751 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:46:26,751 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:46:26,752 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:46:26,754 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:46:26,757 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:46:26,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:46:26,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:46:26,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:46:26,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:46:26,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:46:26,772 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:46:26,772 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:46:26,773 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:46:26,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:46:26,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:46:26,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:46:26,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:46:26,775 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:46:26,776 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:46:26,776 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:46:26,776 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:46:26,777 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:46:26,777 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:46:26,777 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:46:26,778 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:46:26,778 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:46:26,780 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:26,807 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:46:26,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:46:26,809 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:46:26,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:46:26,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:46:26,810 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:46:26,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:46:26,811 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:46:26,811 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:46:26,811 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:46:26,811 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:46:26,812 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:46:26,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:46:26,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:26,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:46:26,814 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:46:26,815 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:46:26,815 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:46:26,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:46:26,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:46:26,815 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 -> 16c784491c1bbafa07f396e2da5c8acc0901ffa28fc7d85f1b184d422e9c5e0e [2022-02-20 16:46:27,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:46:27,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:46:27,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:46:27,120 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:46:27,121 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:46:27,122 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1121b.c [2022-02-20 16:46:27,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b37ece9/5cc1c123e967441f9c6d40d0475429ea/FLAG891c84c16 [2022-02-20 16:46:27,516 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:46:27,517 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1121b.c [2022-02-20 16:46:27,522 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b37ece9/5cc1c123e967441f9c6d40d0475429ea/FLAG891c84c16 [2022-02-20 16:46:27,943 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b37ece9/5cc1c123e967441f9c6d40d0475429ea [2022-02-20 16:46:27,945 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:46:27,946 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:46:27,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:27,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:46:27,950 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:46:27,951 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:27" (1/1) ... [2022-02-20 16:46:27,952 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e3950b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:27, skipping insertion in model container [2022-02-20 16:46:27,952 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:46:27" (1/1) ... [2022-02-20 16:46:27,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:46:27,979 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:46:28,228 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_1121b.c[2700,2713] [2022-02-20 16:46:28,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:28,259 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:46:28,334 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_1121b.c[2700,2713] [2022-02-20 16:46:28,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:46:28,353 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:46:28,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28 WrapperNode [2022-02-20 16:46:28,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:46:28,372 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:28,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:46:28,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:46:28,377 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:28" (1/1) ... [2022-02-20 16:46:28,409 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:28" (1/1) ... [2022-02-20 16:46:28,455 INFO L137 Inliner]: procedures = 21, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-02-20 16:46:28,455 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:46:28,456 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:46:28,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:46:28,457 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:46:28,463 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:28" (1/1) ... [2022-02-20 16:46:28,463 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:28" (1/1) ... [2022-02-20 16:46:28,476 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:28" (1/1) ... [2022-02-20 16:46:28,479 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:28" (1/1) ... [2022-02-20 16:46:28,504 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:28" (1/1) ... [2022-02-20 16:46:28,513 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:28" (1/1) ... [2022-02-20 16:46:28,519 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:28" (1/1) ... [2022-02-20 16:46:28,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:46:28,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:46:28,543 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:46:28,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:46:28,545 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (1/1) ... [2022-02-20 16:46:28,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:46:28,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:46:28,592 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:28,648 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:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-02-20 16:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-02-20 16:46:28,661 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:46:28,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-02-20 16:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:46:28,662 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:46:28,786 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:46:28,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:46:31,326 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:46:31,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:46:31,331 INFO L299 CfgBuilder]: Removed 12 assume(true) statements. [2022-02-20 16:46:31,332 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,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:46:31,334 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:46:31,334 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:46:31,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:46:31,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:46:27" (1/3) ... [2022-02-20 16:46:31,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6facbcdc 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,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:46:28" (2/3) ... [2022-02-20 16:46:31,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6facbcdc 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,349 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,350 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1121b.c [2022-02-20 16:46:31,353 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:46:31,353 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:46:31,418 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:46:31,422 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,434 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:46:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:31,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:46:31,447 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:31,448 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:31,448 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:31,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash 666555284, now seen corresponding path program 1 times [2022-02-20 16:46:31,460 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:31,460 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1780615178] [2022-02-20 16:46:31,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:31,461 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:31,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:31,468 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:31,492 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:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:46:31,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:31,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:31,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {45#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {45#true} is VALID [2022-02-20 16:46:31,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {45#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {45#true} is VALID [2022-02-20 16:46:31,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {45#true} assume !true; {46#false} is VALID [2022-02-20 16:46:31,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#false} assume !true; {46#false} is VALID [2022-02-20 16:46:31,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#false} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {46#false} is VALID [2022-02-20 16:46:31,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {46#false} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {46#false} is VALID [2022-02-20 16:46:31,789 INFO L290 TraceCheckUtils]: 6: Hoare triple {46#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {46#false} is VALID [2022-02-20 16:46:31,790 INFO L290 TraceCheckUtils]: 7: Hoare triple {46#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {46#false} is VALID [2022-02-20 16:46:31,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {46#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {46#false} is VALID [2022-02-20 16:46:31,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {46#false} assume !false; {46#false} is VALID [2022-02-20 16:46:31,791 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,791 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:31,791 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:31,792 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1780615178] [2022-02-20 16:46:31,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1780615178] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:31,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:31,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:46:31,794 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045719948] [2022-02-20 16:46:31,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:31,797 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:31,812 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:31,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:32,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:32,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:46:32,094 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:32,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:46:32,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:32,116 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.75) internal successors, (70), 41 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:34,435 INFO L93 Difference]: Finished difference Result 82 states and 138 transitions. [2022-02-20 16:46:34,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:46:34,436 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:46:34,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:34,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:34,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 138 transitions. [2022-02-20 16:46:34,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 138 transitions. [2022-02-20 16:46:35,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:35,063 INFO L225 Difference]: With dead ends: 82 [2022-02-20 16:46:35,063 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:35,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:46:35,084 INFO L933 BasicCegarLoop]: 57 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, 57 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:35,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 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:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:35,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:35,114 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:35,115 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,116 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,117 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:35,125 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:35,125 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:35,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:35,128 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:35,130 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:35,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:35,135 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-02-20 16:46:35,135 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:35,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:35,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:35,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:35,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 38 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2022-02-20 16:46:35,139 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 10 [2022-02-20 16:46:35,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:35,139 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2022-02-20 16:46:35,139 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:35,140 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-02-20 16:46:35,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:46:35,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:35,143 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:35,154 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:35,347 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:35,348 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:35,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:35,349 INFO L85 PathProgramCache]: Analyzing trace with hash 131116369, now seen corresponding path program 1 times [2022-02-20 16:46:35,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:35,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125992250] [2022-02-20 16:46:35,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:35,350 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:35,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:35,354 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:35,366 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:35,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 16:46:35,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:35,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:39,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {309#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:46:39,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} goto; {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:46:39,673 INFO L290 TraceCheckUtils]: 7: Hoare triple {313#(and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven))} assume (0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32);fmod_float_#res#1 := ~fp.div~FLOAT(currentRoundingMode, ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1), ~fp.mul~FLOAT(currentRoundingMode, fmod_float_~x#1, fmod_float_~y#1)); {332#(exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24))) (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))) |ULTIMATE.start_fmod_float_#res#1|))} is VALID [2022-02-20 16:46:39,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#(exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (fp.div roundNearestTiesToEven (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24))) (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24)))) |ULTIMATE.start_fmod_float_#res#1|))} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} is VALID [2022-02-20 16:46:39,911 INFO L290 TraceCheckUtils]: 9: Hoare triple {336#(= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|)} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} is VALID [2022-02-20 16:46:39,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {340#(= |ULTIMATE.start_main_#t~ret14#1| (_ bv1 32))} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {305#false} is VALID [2022-02-20 16:46:39,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-02-20 16:46:39,912 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:39,912 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:39,913 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:39,913 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125992250] [2022-02-20 16:46:39,913 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125992250] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:39,913 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:39,913 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:46:39,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016676017] [2022-02-20 16:46:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:39,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:39,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:40,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:40,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:46:40,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:40,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:46:40,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:40,311 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:45,897 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:46:57,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,485 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-02-20 16:46:57,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:46:57,485 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:46:57,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:57,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:46:57,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 58 transitions. [2022-02-20 16:46:57,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 58 transitions. [2022-02-20 16:46:57,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:57,953 INFO L225 Difference]: With dead ends: 44 [2022-02-20 16:46:57,953 INFO L226 Difference]: Without dead ends: 39 [2022-02-20 16:46:57,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:46:57,954 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 93 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:57,954 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 191 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 1 Unknown, 10 Unchecked, 4.0s Time] [2022-02-20 16:46:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-20 16:46:57,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-20 16:46:57,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:57,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,958 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,959 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,960 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:57,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:57,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:57,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:57,961 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 39 states. [2022-02-20 16:46:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:57,962 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:57,962 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:57,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:57,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:57,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:57,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.394736842105263) internal successors, (53), 38 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2022-02-20 16:46:57,964 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 53 transitions. Word has length 12 [2022-02-20 16:46:57,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:57,965 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 53 transitions. [2022-02-20 16:46:57,965 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:57,965 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 53 transitions. [2022-02-20 16:46:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:46:57,966 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:46:57,966 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:46:57,978 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:58,171 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:58,172 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:46:58,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:46:58,172 INFO L85 PathProgramCache]: Analyzing trace with hash -302456811, now seen corresponding path program 1 times [2022-02-20 16:46:58,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:46:58,173 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [326866480] [2022-02-20 16:46:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:46:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:46:58,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:46:58,174 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:58,175 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:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:58,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 16:46:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:46:58,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:46:58,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {531#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~one_fmod~0 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0));~#Zero_fmod~0.base, ~#Zero_fmod~0.offset := 4bv32, 0bv32;call #Ultimate.allocInit(8bv32, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE()), ~#Zero_fmod~0.base, ~#Zero_fmod~0.offset, 4bv32);call write~init~intFLOATTYPE4(~convertDOUBLEToFLOAT(currentRoundingMode, ~fp.neg~DOUBLE(~Pluszero~DOUBLE())), ~#Zero_fmod~0.base, ~bvadd32(4bv32, ~#Zero_fmod~0.offset), 4bv32); {531#true} is VALID [2022-02-20 16:46:58,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {531#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet12#1, main_#t~ret13#1, main_#t~ret14#1, main_~x~0#1, main_~y~0#1, main_~res~0#1;main_~x~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;main_~y~0#1 := ~fp.neg~FLOAT(~Pluszero~FLOAT());assume { :begin_inline_fmod_float } true;fmod_float_#in~x#1, fmod_float_#in~y#1 := main_~x~0#1, main_~y~0#1;havoc fmod_float_#res#1;havoc fmod_float_#t~mem4#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, fmod_float_#t~mem5#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, fmod_float_#t~mem6#1, fmod_float_#t~mem8#1, fmod_float_#t~post7#1, fmod_float_#t~mem9#1, fmod_float_#t~mem10#1, fmod_float_~#sf_u~0#1.base, fmod_float_~#sf_u~0#1.offset, fmod_float_#t~mem11#1, fmod_float_~#sf_u~1#1.base, fmod_float_~#sf_u~1#1.offset, fmod_float_~x#1, fmod_float_~y#1, fmod_float_~n~0#1, fmod_float_~hx~0#1, fmod_float_~hy~0#1, fmod_float_~hz~0#1, fmod_float_~ix~0#1, fmod_float_~iy~0#1, fmod_float_~sx~0#1, fmod_float_~i~0#1;fmod_float_~x#1 := fmod_float_#in~x#1;fmod_float_~y#1 := fmod_float_#in~y#1;havoc fmod_float_~n~0#1;havoc fmod_float_~hx~0#1;havoc fmod_float_~hy~0#1;havoc fmod_float_~hz~0#1;havoc fmod_float_~ix~0#1;havoc fmod_float_~iy~0#1;havoc fmod_float_~sx~0#1;havoc fmod_float_~i~0#1; {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:58,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~x#1, fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);call fmod_float_#t~mem4#1 := read~intINTTYPE4(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset, 4bv32);fmod_float_~hx~0#1 := fmod_float_#t~mem4#1;havoc fmod_float_#t~mem4#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset);havoc fmod_float_~#gf_u~0#1.base, fmod_float_~#gf_u~0#1.offset; {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:58,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} goto; {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:58,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {539#(= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24)))} call fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset := #Ultimate.allocOnStack(4bv32);call write~intFLOATTYPE4(fmod_float_~y#1, fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);call fmod_float_#t~mem5#1 := read~intINTTYPE4(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset, 4bv32);fmod_float_~hy~0#1 := fmod_float_#t~mem5#1;havoc fmod_float_#t~mem5#1;call ULTIMATE.dealloc(fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset);havoc fmod_float_~#gf_u~1#1.base, fmod_float_~#gf_u~1#1.offset; {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:58,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.neg (_ +zero 8 24)))} goto; {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.neg (_ +zero 8 24)))} is VALID [2022-02-20 16:46:58,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {549#(= (fp ((_ extract 31 31) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 30 23) |ULTIMATE.start_fmod_float_~hy~0#1|) ((_ extract 22 0) |ULTIMATE.start_fmod_float_~hy~0#1|)) (fp.neg (_ +zero 8 24)))} fmod_float_~sx~0#1 := ~bvand32(2147483648bv32, fmod_float_~hx~0#1);fmod_float_~hx~0#1 := ~bvxor32(fmod_float_~hx~0#1, fmod_float_~sx~0#1);fmod_float_~hy~0#1 := ~bvand32(2147483647bv32, fmod_float_~hy~0#1); {556#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.neg (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} is VALID [2022-02-20 16:46:58,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {556#(exists ((|v_ULTIMATE.start_fmod_float_~hy~0#1_20| (_ BitVec 32))) (and (= (fp ((_ extract 31 31) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 30 23) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) ((_ extract 22 0) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|)) (fp.neg (_ +zero 8 24))) (= (bvand (_ bv2147483647 32) |v_ULTIMATE.start_fmod_float_~hy~0#1_20|) |ULTIMATE.start_fmod_float_~hy~0#1|)))} assume !((0bv32 == fmod_float_~hy~0#1 || !~bvslt32(fmod_float_~hx~0#1, 2139095040bv32)) || ~bvsgt32(fmod_float_~hy~0#1, 2139095040bv32)); {532#false} is VALID [2022-02-20 16:46:58,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {532#false} assume ~bvslt32(fmod_float_~hx~0#1, fmod_float_~hy~0#1);fmod_float_#res#1 := fmod_float_~x#1; {532#false} is VALID [2022-02-20 16:46:58,423 INFO L290 TraceCheckUtils]: 9: Hoare triple {532#false} main_#t~ret13#1 := fmod_float_#res#1;assume { :end_inline_fmod_float } true;main_~res~0#1 := main_#t~ret13#1;havoc main_#t~ret13#1;assume { :begin_inline_isnan_float } true;isnan_float_#in~x#1 := main_~res~0#1;havoc isnan_float_#res#1;havoc isnan_float_~x#1;isnan_float_~x#1 := isnan_float_#in~x#1;isnan_float_#res#1 := (if !~fp.eq~FLOAT(isnan_float_~x#1, isnan_float_~x#1) then 1bv32 else 0bv32); {532#false} is VALID [2022-02-20 16:46:58,424 INFO L290 TraceCheckUtils]: 10: Hoare triple {532#false} main_#t~ret14#1 := isnan_float_#res#1;assume { :end_inline_isnan_float } true; {532#false} is VALID [2022-02-20 16:46:58,424 INFO L290 TraceCheckUtils]: 11: Hoare triple {532#false} assume 0bv32 == main_#t~ret14#1;havoc main_#t~ret14#1; {532#false} is VALID [2022-02-20 16:46:58,424 INFO L290 TraceCheckUtils]: 12: Hoare triple {532#false} assume !false; {532#false} is VALID [2022-02-20 16:46:58,432 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:58,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:46:58,432 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:46:58,432 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [326866480] [2022-02-20 16:46:58,432 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [326866480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:46:58,433 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:46:58,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:46:58,433 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537588917] [2022-02-20 16:46:58,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:46:58,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:58,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:46:58,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:46:58,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:46:58,448 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:46:58,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:46:58,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:46:58,451 INFO L87 Difference]: Start difference. First operand 39 states and 53 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:58,601 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2022-02-20 16:46:58,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:46:58,601 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 16:46:58,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:46:58,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-02-20 16:46:58,603 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-02-20 16:46:58,672 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:58,672 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:46:58,672 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:46:58,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:46:58,673 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:46:58,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 13 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 2 Unchecked, 0.0s Time] [2022-02-20 16:46:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:46:58,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:46:58,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:46:58,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,674 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,674 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:58,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:58,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:58,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:58,675 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:58,675 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:46:58,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:46:58,675 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:46:58,675 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:58,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:58,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:46:58,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:46:58,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:46:58,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:46:58,676 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-02-20 16:46:58,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:46:58,676 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:46:58,676 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:46:58,676 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:46:58,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:46:58,678 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:46:58,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:46:58,890 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:58,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:46:59,873 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:59,874 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 60 65) no Hoare annotation was computed. [2022-02-20 16:46:59,874 INFO L858 garLoopResultBuilder]: For program point L27-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,874 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 31) no Hoare annotation was computed. [2022-02-20 16:46:59,875 INFO L854 garLoopResultBuilder]: At program point L110(line 110) the Hoare annotation is: (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res#1|) [2022-02-20 16:46:59,875 INFO L858 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2022-02-20 16:46:59,875 INFO L858 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-02-20 16:46:59,875 INFO L854 garLoopResultBuilder]: At program point L69-2(lines 67 76) the Hoare annotation is: false [2022-02-20 16:46:59,875 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:46:59,875 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:46:59,875 INFO L858 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L858 garLoopResultBuilder]: For program point L78-2(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L861 garLoopResultBuilder]: At program point L128(lines 112 129) the Hoare annotation is: true [2022-02-20 16:46:59,876 INFO L858 garLoopResultBuilder]: For program point L54-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L858 garLoopResultBuilder]: For program point L38(lines 38 39) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L858 garLoopResultBuilder]: For program point L88(lines 88 105) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L858 garLoopResultBuilder]: For program point L22-1(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:46:59,876 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 26) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L72(lines 72 73) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L48(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L854 garLoopResultBuilder]: At program point L106(lines 19 107) the Hoare annotation is: (and (= |ULTIMATE.start_fmod_float_~y#1| (fp.neg (_ +zero 8 24))) (exists ((|ULTIMATE.start_fmod_float_~x#1| (_ FloatingPoint 8 24))) (= (let ((.cse0 (fp.mul roundNearestTiesToEven |ULTIMATE.start_fmod_float_~x#1| (fp.neg (_ +zero 8 24))))) (fp.div roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start_fmod_float_#res#1|)) (= currentRoundingMode roundNearestTiesToEven)) [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 41) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L123(lines 123 126) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L858 garLoopResultBuilder]: For program point L90-1(lines 90 94) no Hoare annotation was computed. [2022-02-20 16:46:59,877 INFO L854 garLoopResultBuilder]: At program point L90-2(lines 90 94) the Hoare annotation is: false [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 124) no Hoare annotation was computed. [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point L49-2(lines 49 50) no Hoare annotation was computed. [2022-02-20 16:46:59,878 INFO L854 garLoopResultBuilder]: At program point L49-3(lines 49 50) the Hoare annotation is: false [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point L99-1(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:59,878 INFO L854 garLoopResultBuilder]: At program point L99-2(lines 99 103) the Hoare annotation is: false [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point L99-3(lines 99 103) no Hoare annotation was computed. [2022-02-20 16:46:59,878 INFO L858 garLoopResultBuilder]: For program point L124(line 124) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L42(lines 42 46) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L42-1(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L67-3(lines 67 76) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L854 garLoopResultBuilder]: At program point L84-2(lines 84 87) the Hoare annotation is: false [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L84-3(lines 19 107) no Hoare annotation was computed. [2022-02-20 16:46:59,879 INFO L858 garLoopResultBuilder]: For program point L43-2(lines 43 44) no Hoare annotation was computed. [2022-02-20 16:46:59,880 INFO L854 garLoopResultBuilder]: At program point L43-3(lines 43 44) the Hoare annotation is: false [2022-02-20 16:46:59,882 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 16:46:59,883 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:46:59,890 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:46:59,891 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:46:59,897 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:59,897 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:59,897 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:59,897 WARN L170 areAnnotationChecker]: L22-1 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L27-1 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:46:59,898 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:47:00,060 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L123 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L42 has no Hoare annotation [2022-02-20 16:47:00,061 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L124 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L42-1 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L43-2 has no Hoare annotation [2022-02-20 16:47:00,062 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:00,063 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:00,063 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:00,063 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:00,063 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:47:00,065 WARN L170 areAnnotationChecker]: L49-2 has no Hoare annotation [2022-02-20 16:47:00,065 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:00,065 WARN L170 areAnnotationChecker]: L54-1 has no Hoare annotation [2022-02-20 16:47:00,065 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 16:47:00,065 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:00,066 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:00,066 WARN L170 areAnnotationChecker]: L67-3 has no Hoare annotation [2022-02-20 16:47:00,066 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:00,066 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 16:47:00,066 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L78-2 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:00,067 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L84-3 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L90-1 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L88 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:00,068 WARN L170 areAnnotationChecker]: L99-1 has no Hoare annotation [2022-02-20 16:47:00,069 WARN L170 areAnnotationChecker]: L99-3 has no Hoare annotation [2022-02-20 16:47:00,069 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:47:00,089 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,090 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,093 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,093 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,094 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,094 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,098 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,098 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:47:00 BoogieIcfgContainer [2022-02-20 16:47:00,099 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:47:00,100 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:47:00,100 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:47:00,100 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:47:00,101 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:46:31" (3/4) ... [2022-02-20 16:47:00,115 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:47:00,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-02-20 16:47:00,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-02-20 16:47:00,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:47:00,124 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:47:00,168 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:47:00,169 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:47:00,170 INFO L158 Benchmark]: Toolchain (without parser) took 32223.25ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 42.2MB in the beginning and 35.6MB in the end (delta: 6.6MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,171 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:47:00,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 411.23ms. Allocated memory is still 58.7MB. Free memory was 41.9MB in the beginning and 37.0MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.92ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 34.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,171 INFO L158 Benchmark]: Boogie Preprocessor took 71.96ms. Allocated memory is still 58.7MB. Free memory was 34.6MB in the beginning and 32.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,172 INFO L158 Benchmark]: RCFGBuilder took 2803.83ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 28.7MB in the end (delta: 3.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,172 INFO L158 Benchmark]: TraceAbstraction took 28765.71ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.2MB in the beginning and 38.2MB in the end (delta: -10.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,172 INFO L158 Benchmark]: Witness Printer took 68.73ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 35.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:47:00,174 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.15ms. Allocated memory is still 48.2MB. Free memory was 28.6MB in the beginning and 28.6MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 411.23ms. Allocated memory is still 58.7MB. Free memory was 41.9MB in the beginning and 37.0MB in the end (delta: 4.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.92ms. Allocated memory is still 58.7MB. Free memory was 37.0MB in the beginning and 34.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 71.96ms. Allocated memory is still 58.7MB. Free memory was 34.6MB in the beginning and 32.4MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2803.83ms. Allocated memory is still 58.7MB. Free memory was 32.4MB in the beginning and 28.7MB in the end (delta: 3.7MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * TraceAbstraction took 28765.71ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 28.2MB in the beginning and 38.2MB in the end (delta: -10.0MB). Peak memory consumption was 5.9MB. Max. memory is 16.1GB. * Witness Printer took 68.73ms. Allocated memory is still 75.5MB. Free memory was 38.2MB in the beginning and 35.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 124]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 20.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 95 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 261 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 12 IncrementalHoareTripleChecker+Unchecked, 150 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 111 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 14 NumberOfFragments, 41 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 35 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 32 ConstructedInterpolants, 2 QuantifiedInterpolants, 137 SizeOfPredicates, 15 NumberOfNonLiveVariables, 180 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: 1bv32 == \result - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant [2022-02-20 16:47:00,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,188 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant [2022-02-20 16:47:00,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,192 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,192 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,193 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-02-20 16:47:00,194 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start_fmod_float_~x#1,QUANTIFIED] [2022-02-20 16:47:00,194 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (y == ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()) && (\exists ULTIMATE.start_fmod_float_~x#1 : C_FLOAT :: ~fp.div~FLOAT(~roundNearestTiesToEven, ~fp.mul~FLOAT(~roundNearestTiesToEven, ULTIMATE.start_fmod_float_~x#1, ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE())), ~fp.mul~FLOAT(~roundNearestTiesToEven, ULTIMATE.start_fmod_float_~x#1, ~fp.neg~FLOAT(~Pluszero~LONGDOUBLE()))) == \result)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-02-20 16:47:00,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE