./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0981.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0981.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 58ac0589d73c462785a1e0525d17b3b74f7db66a56b5cb7df3664daf67476919 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:38,084 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:38,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:38,130 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:38,130 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:38,133 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:38,134 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:38,137 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:38,138 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:38,142 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:38,143 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:38,144 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:38,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:38,147 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:38,148 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:38,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:38,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:38,152 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:38,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:38,160 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:38,161 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:38,162 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:38,163 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:38,164 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:38,166 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:38,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:38,166 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:38,167 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:38,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:38,168 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:38,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:38,169 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:38,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:38,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:38,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:38,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:38,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:38,173 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:38,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:38,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:38,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:38,176 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:35:38,206 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:38,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:38,207 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:38,208 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:38,208 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:38,209 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:38,209 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:38,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:38,209 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:38,210 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:38,210 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:38,211 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:38,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:38,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:38,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:38,212 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:38,212 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:38,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:38,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:38,214 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:38,214 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:38,214 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:38,214 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:38,214 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:35:38,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:35:38,215 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:38,215 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:38,215 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:38,215 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 -> 58ac0589d73c462785a1e0525d17b3b74f7db66a56b5cb7df3664daf67476919 [2022-02-20 16:35:38,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:38,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:38,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:38,471 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:38,471 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:38,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0981.c [2022-02-20 16:35:38,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ac58114/0037d668dfe0491fb52d0b2df94957ae/FLAG90ea61875 [2022-02-20 16:35:38,990 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:38,991 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c [2022-02-20 16:35:39,009 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ac58114/0037d668dfe0491fb52d0b2df94957ae/FLAG90ea61875 [2022-02-20 16:35:39,513 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7ac58114/0037d668dfe0491fb52d0b2df94957ae [2022-02-20 16:35:39,515 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:39,516 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:39,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:39,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:39,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:39,524 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,525 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31fbd779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39, skipping insertion in model container [2022-02-20 16:35:39,526 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:39,555 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:39,747 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c[4783,4796] [2022-02-20 16:35:39,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:39,761 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:39,810 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c[4783,4796] [2022-02-20 16:35:39,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:39,832 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:39,839 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39 WrapperNode [2022-02-20 16:35:39,840 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:39,841 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:39,842 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:39,842 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:39,848 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:35:39" (1/1) ... [2022-02-20 16:35:39,857 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:35:39" (1/1) ... [2022-02-20 16:35:39,916 INFO L137 Inliner]: procedures = 18, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 259 [2022-02-20 16:35:39,916 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:39,917 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:39,917 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:39,917 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:39,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,925 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,930 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,953 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,972 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:39,974 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:39,974 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:39,974 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:39,977 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (1/1) ... [2022-02-20 16:35:39,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:39,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:40,008 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:35:40,022 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:35:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:35:40,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-02-20 16:35:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:35:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-02-20 16:35:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:40,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:40,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:35:40,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:40,185 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:40,187 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:35:40,872 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:35:40,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:35:40,887 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:35:40,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:40 BoogieIcfgContainer [2022-02-20 16:35:40,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:35:40,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:35:40,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:35:40,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:35:40,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:39" (1/3) ... [2022-02-20 16:35:40,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3254cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:40, skipping insertion in model container [2022-02-20 16:35:40,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:39" (2/3) ... [2022-02-20 16:35:40,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3254cb5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:35:40, skipping insertion in model container [2022-02-20 16:35:40,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:40" (3/3) ... [2022-02-20 16:35:40,908 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0981.c [2022-02-20 16:35:40,912 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:35:40,913 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:35:40,982 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:35:40,987 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:35:40,987 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:35:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 54 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 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:35:41,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:35:41,009 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:41,009 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:41,010 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:41,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:41,015 INFO L85 PathProgramCache]: Analyzing trace with hash 936364278, now seen corresponding path program 1 times [2022-02-20 16:35:41,024 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:41,024 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894936892] [2022-02-20 16:35:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:41,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:35:41,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);~ln2_hi_log~0 := 0.6931471803691238;~ln2_lo_log~0 := 1.9082149292705877E-10;~two54_log~0 := 1.8014398509481984E16;~Lg1_log~0 := 0.6666666666666735;~Lg2_log~0 := 0.3999999999940942;~Lg3_log~0 := 0.2857142874366239;~Lg4_log~0 := 0.22222198432149784;~Lg5_log~0 := 0.1818357216161805;~Lg6_log~0 := 0.15313837699209373;~Lg7_log~0 := 0.14798198605116586;~zero~0 := 0.0;~two54_log10~0 := 1.8014398509481984E16;~ivln10_log10~0 := 0.4342944819032518;~log10_2hi_log10~0 := 0.30102999566361177;~log10_2lo_log10~0 := 3.694239077158931E-13;~zero_log10~0 := 0.0; {57#true} is VALID [2022-02-20 16:35:41,261 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~ret17#1, main_#t~ret18#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~someBinaryArithmeticDOUBLEoperation(1.0, 0.0);assume { :begin_inline___ieee754_log10 } true;__ieee754_log10_#in~x#1 := main_~x~0#1;havoc __ieee754_log10_#res#1;havoc __ieee754_log10_#t~mem9#1, __ieee754_log10_#t~mem10#1, __ieee754_log10_~#ew_u~1#1.base, __ieee754_log10_~#ew_u~1#1.offset, __ieee754_log10_#t~mem11#1, __ieee754_log10_~#gh_u~1#1.base, __ieee754_log10_~#gh_u~1#1.offset, __ieee754_log10_#t~mem13#1, __ieee754_log10_~#sh_u~1#1.base, __ieee754_log10_~#sh_u~1#1.offset, __ieee754_log10_#t~ret14#1, __ieee754_log10_~x#1, __ieee754_log10_~y~0#1, __ieee754_log10_~z~1#1, __ieee754_log10_~i~1#1, __ieee754_log10_~k~1#1, __ieee754_log10_~hx~1#1, __ieee754_log10_~lx~1#1, __ieee754_log10_#t~nondet12#1;__ieee754_log10_~x#1 := __ieee754_log10_#in~x#1;havoc __ieee754_log10_~y~0#1;havoc __ieee754_log10_~z~1#1;havoc __ieee754_log10_~i~1#1;havoc __ieee754_log10_~k~1#1;havoc __ieee754_log10_~hx~1#1;havoc __ieee754_log10_~lx~1#1; {57#true} is VALID [2022-02-20 16:35:41,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {57#true} assume !true; {58#false} is VALID [2022-02-20 16:35:41,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {58#false} __ieee754_log10_~k~1#1 := 0; {58#false} is VALID [2022-02-20 16:35:41,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {58#false} assume __ieee754_log10_~hx~1#1 < 1048576; {58#false} is VALID [2022-02-20 16:35:41,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {58#false} assume 0 == (if (1 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647)))) && 0 == __ieee754_log10_~lx~1#1 then (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))) else (if 0 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))) && (1 == __ieee754_log10_~lx~1#1 || 0 == __ieee754_log10_~lx~1#1) then __ieee754_log10_~lx~1#1 else (if (1 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))) && (1 == __ieee754_log10_~lx~1#1 || 0 == __ieee754_log10_~lx~1#1)) || ((1 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))) || 0 == (if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647)))) && 1 == __ieee754_log10_~lx~1#1) then 1 else ~bitwiseOr((if 0 == __ieee754_log10_~hx~1#1 then 0 else (if 1 == __ieee754_log10_~hx~1#1 then 1 else ~bitwiseAnd(__ieee754_log10_~hx~1#1, 2147483647))), __ieee754_log10_~lx~1#1)))) % 4294967296;__ieee754_log10_#res#1 := ~someBinaryArithmeticDOUBLEoperation(~someUnaryDOUBLEoperation(~two54_log10~0), ~zero_log10~0); {58#false} is VALID [2022-02-20 16:35:41,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {58#false} main_#t~ret17#1 := __ieee754_log10_#res#1;assume { :end_inline___ieee754_log10 } true;main_~res~0#1 := main_#t~ret17#1;havoc main_#t~ret17#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~res~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem15#1, isinf_double_#t~mem16#1, isinf_double_~#ew_u~2#1.base, isinf_double_~#ew_u~2#1.offset, isinf_double_~x#1, isinf_double_~hx~2#1, isinf_double_~lx~2#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~2#1;havoc isinf_double_~lx~2#1; {58#false} is VALID [2022-02-20 16:35:41,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {58#false} assume !true; {58#false} is VALID [2022-02-20 16:35:41,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {58#false} isinf_double_~hx~2#1 := (if 0 == isinf_double_~hx~2#1 then 0 else (if 1 == isinf_double_~hx~2#1 then 1 else ~bitwiseAnd(isinf_double_~hx~2#1, 2147483647)));isinf_double_~hx~2#1 := (if (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 <= 2147483647 then (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 else (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) else (if (1 == isinf_double_~hx~2#1 && (1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1) || 0 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1)) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, (if (if (1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 0 == -isinf_double_~lx~2#1 then isinf_double_~lx~2#1 else (if 0 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1) then -isinf_double_~lx~2#1 else (if (1 == isinf_double_~lx~2#1 && (1 == -isinf_double_~lx~2#1 || 0 == -isinf_double_~lx~2#1)) || ((1 == isinf_double_~lx~2#1 || 0 == isinf_double_~lx~2#1) && 1 == -isinf_double_~lx~2#1) then 1 else ~bitwiseOr(isinf_double_~lx~2#1, -isinf_double_~lx~2#1)))) >= 0 then 0 else 1))))) % 4294967296 % 4294967296 - 4294967296);isinf_double_~hx~2#1 := 2146435072 - isinf_double_~hx~2#1;isinf_double_#res#1 := 1 - (if (if (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == -isinf_double_~hx~2#1 then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1) then -isinf_double_~hx~2#1 else (if (1 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1)) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == -isinf_double_~hx~2#1) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, -isinf_double_~hx~2#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 <= 2147483647 then (if (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == -isinf_double_~hx~2#1 then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1) then -isinf_double_~hx~2#1 else (if (1 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1)) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == -isinf_double_~hx~2#1) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, -isinf_double_~hx~2#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 else (if (if (1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 0 == -isinf_double_~hx~2#1 then isinf_double_~hx~2#1 else (if 0 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1) then -isinf_double_~hx~2#1 else (if (1 == isinf_double_~hx~2#1 && (1 == -isinf_double_~hx~2#1 || 0 == -isinf_double_~hx~2#1)) || ((1 == isinf_double_~hx~2#1 || 0 == isinf_double_~hx~2#1) && 1 == -isinf_double_~hx~2#1) then 1 else ~bitwiseOr(isinf_double_~hx~2#1, -isinf_double_~hx~2#1)))) >= 0 then 0 else 1) % 4294967296 % 4294967296 - 4294967296); {58#false} is VALID [2022-02-20 16:35:41,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {58#false} main_#t~ret18#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true;assume -2147483648 <= main_#t~ret18#1 && main_#t~ret18#1 <= 2147483647; {58#false} is VALID [2022-02-20 16:35:41,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {58#false} assume 0 == main_#t~ret18#1;havoc main_#t~ret18#1; {58#false} is VALID [2022-02-20 16:35:41,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {58#false} assume !false; {58#false} is VALID [2022-02-20 16:35:41,274 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:35:41,275 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:35:41,275 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894936892] [2022-02-20 16:35:41,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894936892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:35:41,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:35:41,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:35:41,279 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362005136] [2022-02-20 16:35:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:35:41,285 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:35:41,290 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,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:35:41,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:35:41,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:35:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:35:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:35:41,344 INFO L87 Difference]: Start difference. First operand has 54 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 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 6.0) internal successors, (12), 2 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:35:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:41,444 INFO L93 Difference]: Finished difference Result 106 states and 180 transitions. [2022-02-20 16:35:41,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:35:41,444 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:35:41,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2022-02-20 16:35:41,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2022-02-20 16:35:41,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 180 transitions. [2022-02-20 16:35:41,683 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:35:41,699 INFO L225 Difference]: With dead ends: 106 [2022-02-20 16:35:41,701 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:35:41,704 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:35:41,709 INFO L933 BasicCegarLoop]: 74 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, 74 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:35:41,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:35:41,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:35:41,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 16:35:41,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:35:41,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,739 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,739 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:41,742 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-02-20 16:35:41,743 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-02-20 16:35:41,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:41,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:41,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,744 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:35:41,747 INFO L93 Difference]: Finished difference Result 51 states and 71 transitions. [2022-02-20 16:35:41,747 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-02-20 16:35:41,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:35:41,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:35:41,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:35:41,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:35:41,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.42) internal successors, (71), 50 states have internal predecessors, (71), 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:35:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 71 transitions. [2022-02-20 16:35:41,752 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 71 transitions. Word has length 12 [2022-02-20 16:35:41,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:35:41,752 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 71 transitions. [2022-02-20 16:35:41,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:35:41,753 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 71 transitions. [2022-02-20 16:35:41,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:35:41,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:35:41,754 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:35:41,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:35:41,754 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:35:41,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:35:41,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1795959685, now seen corresponding path program 1 times [2022-02-20 16:35:41,756 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:35:41,756 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144303637] [2022-02-20 16:35:41,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:35:41,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:35:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:42,183 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:35:42,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:35:42,398 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:35:42,398 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:35:42,400 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:35:42,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:35:42,405 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:35:42,408 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:35:42,458 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:35:42,458 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:35:42,458 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2022-02-20 16:35:42,458 WARN L170 areAnnotationChecker]: L123-2 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L123-1 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L123-3 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L131 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:35:42,459 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L157 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L134 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:35:42,460 WARN L170 areAnnotationChecker]: L148 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L163-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L138-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L148-8 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L148-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L148-2 has no Hoare annotation [2022-02-20 16:35:42,461 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L163-1 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L163-3 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L138-1 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L150-2 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L150-2 has no Hoare annotation [2022-02-20 16:35:42,462 WARN L170 areAnnotationChecker]: L148-4 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L148-4 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L150-1 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L150-3 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L148-6 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L148-6 has no Hoare annotation [2022-02-20 16:35:42,463 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L187 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L188 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L192 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 16:35:42,464 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L43 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2022-02-20 16:35:42,465 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L43-1 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L60 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:35:42,466 WARN L170 areAnnotationChecker]: L50-2 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L61-1 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L60-2 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L50-1 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:42,467 WARN L170 areAnnotationChecker]: L61 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L61-2 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L60-4 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L69 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2022-02-20 16:35:42,468 WARN L170 areAnnotationChecker]: L60-6 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L70 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L96 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:35:42,469 WARN L170 areAnnotationChecker]: L79 has no Hoare annotation [2022-02-20 16:35:42,470 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:35:42,470 WARN L170 areAnnotationChecker]: L98 has no Hoare annotation [2022-02-20 16:35:42,470 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:35:42,470 WARN L170 areAnnotationChecker]: L104 has no Hoare annotation [2022-02-20 16:35:42,470 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:35:42,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:35:42 BoogieIcfgContainer [2022-02-20 16:35:42,471 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:35:42,472 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:35:42,472 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:35:42,472 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:35:42,473 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:35:40" (3/4) ... [2022-02-20 16:35:42,475 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:35:42,475 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:35:42,477 INFO L158 Benchmark]: Toolchain (without parser) took 2960.43ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.6MB in the beginning and 75.5MB in the end (delta: -17.9MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,477 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:42,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.83ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 67.4MB in the end (delta: -10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,478 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.92ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 60.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,478 INFO L158 Benchmark]: Boogie Preprocessor took 55.85ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 57.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,479 INFO L158 Benchmark]: RCFGBuilder took 915.59ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.0MB in the beginning and 72.0MB in the end (delta: -15.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,479 INFO L158 Benchmark]: TraceAbstraction took 1580.78ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 75.5MB in the end (delta: -3.9MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2022-02-20 16:35:42,479 INFO L158 Benchmark]: Witness Printer took 3.67ms. Allocated memory is still 117.4MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:35:42,481 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.18ms. Allocated memory is still 96.5MB. Free memory is still 74.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.83ms. Allocated memory is still 96.5MB. Free memory was 57.4MB in the beginning and 67.4MB in the end (delta: -10.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.92ms. Allocated memory is still 96.5MB. Free memory was 67.4MB in the beginning and 60.8MB in the end (delta: 6.6MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.85ms. Allocated memory is still 96.5MB. Free memory was 60.8MB in the beginning and 57.3MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 915.59ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.0MB in the beginning and 72.0MB in the end (delta: -15.1MB). Peak memory consumption was 27.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1580.78ms. Allocated memory is still 117.4MB. Free memory was 71.6MB in the beginning and 75.5MB in the end (delta: -3.9MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. * Witness Printer took 3.67ms. Allocated memory is still 117.4MB. Free memory is still 75.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 188]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 170, overapproximation of someBinaryArithmeticDOUBLEoperation at line 133, overapproximation of bitwiseAnd at line 169. Possible FailurePath: [L17-L26] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L28] static const double zero = 0.0; [L111-L114] static const double two54_log10 = 1.80143985094819840000e+16, ivln10_log10 = 4.34294481903251816668e-01, log10_2hi_log10 = 3.01029995663611771306e-01, log10_2lo_log10 = 3.69423907715893078616e-13; [L116] static const double zero_log10 = 0.0; VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, zero=0, zero_log10=0] [L183] double x = 1.0 / 0.0; [L184] CALL, EXPR __ieee754_log10(x) [L119] double y, z; [L120] __int32_t i, k, hx; [L121] __uint32_t lx; VAL [\old(x)=18014398509481986, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481986, zero=0, zero_log10=0] [L124] ieee_double_shape_type ew_u; [L125] ew_u.value = (x) [L126] EXPR ew_u.parts.msw [L126] (hx) = ew_u.parts.msw [L127] EXPR ew_u.parts.lsw [L127] (lx) = ew_u.parts.lsw [L130] k = 0 VAL [\old(x)=18014398509481986, hx=-2, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=0, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481986, zero=0, zero_log10=0] [L131] COND TRUE hx < 0x00100000 VAL [\old(x)=18014398509481986, hx=-2, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=0, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481986, zero=0, zero_log10=0] [L132] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L133] return -two54_log10 / zero_log10; VAL [\old(x)=18014398509481986, hx=-2, ivln10_log10=108573620475812954167/250000000000000000000, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=0, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481986, zero=0, zero_log10=0] [L184] RET, EXPR __ieee754_log10(x) [L184] double res = __ieee754_log10(x); [L187] CALL, EXPR isinf_double(res) [L162] __int32_t hx, lx; VAL [\old(x)=18014398509481985, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481985, zero=0, zero_log10=0] [L164] ieee_double_shape_type ew_u; [L165] ew_u.value = (x) [L166] EXPR ew_u.parts.msw [L166] (hx) = ew_u.parts.msw [L167] EXPR ew_u.parts.lsw [L167] (lx) = ew_u.parts.lsw [L169] hx &= 0x7fffffff [L170] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L171] hx = 0x7ff00000 - hx [L172] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [\old(x)=18014398509481985, \result=0, hx=-1, ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, lx=-1, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481985, zero=0, zero_log10=0] [L187] RET, EXPR isinf_double(res) [L187] COND TRUE !isinf_double(res) [L188] reach_error() VAL [ivln10_log10=108573620475812954167/250000000000000000000, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, log10_2hi_log10=150514997831805885653/500000000000000000000, log10_2lo_log10=46177988464486634827/125000000000000000000000000000000, res=18014398509481985, two54_log=18014398509481984, two54_log10=18014398509481984, x=18014398509481986, zero=0, zero_log10=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 54 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, 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, 74 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, 74 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.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 11 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:35:42,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_0981.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 58ac0589d73c462785a1e0525d17b3b74f7db66a56b5cb7df3664daf67476919 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:35:44,447 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:35:44,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:35:44,487 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:35:44,488 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:35:44,491 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:35:44,492 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:35:44,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:35:44,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:35:44,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:35:44,504 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:35:44,505 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:35:44,505 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:35:44,507 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:35:44,508 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:35:44,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:35:44,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:35:44,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:35:44,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:35:44,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:35:44,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:35:44,524 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:35:44,525 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:35:44,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:35:44,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:35:44,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:35:44,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:35:44,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:35:44,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:35:44,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:35:44,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:35:44,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:35:44,544 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:35:44,544 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:35:44,545 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:35:44,545 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:35:44,546 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:35:44,546 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:35:44,547 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:35:44,548 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:35:44,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:35:44,549 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:35:44,584 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:35:44,584 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:35:44,585 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:35:44,585 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:35:44,586 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:35:44,586 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:35:44,587 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:35:44,588 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:35:44,588 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:35:44,588 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:35:44,589 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:35:44,589 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:35:44,589 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:35:44,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:35:44,590 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:35:44,590 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:35:44,590 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:35:44,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:35:44,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:35:44,591 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:35:44,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:35:44,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:35:44,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:35:44,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:35:44,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:35:44,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:35:44,593 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:44,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:35:44,593 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:35:44,593 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:35:44,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:35:44,594 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:35:44,594 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:35:44,594 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:35:44,594 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:35:44,595 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:35:44,595 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 -> 58ac0589d73c462785a1e0525d17b3b74f7db66a56b5cb7df3664daf67476919 [2022-02-20 16:35:44,929 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:35:44,956 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:35:44,958 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:35:44,959 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:35:44,960 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:35:44,961 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0981.c [2022-02-20 16:35:45,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e70f42/beb8dfa4488440a3b58c80093ee12a7a/FLAGbbb54f26d [2022-02-20 16:35:45,417 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:35:45,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c [2022-02-20 16:35:45,424 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e70f42/beb8dfa4488440a3b58c80093ee12a7a/FLAGbbb54f26d [2022-02-20 16:35:45,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e70f42/beb8dfa4488440a3b58c80093ee12a7a [2022-02-20 16:35:45,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:35:45,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:35:45,807 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:45,807 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:35:45,810 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:35:45,811 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:45" (1/1) ... [2022-02-20 16:35:45,812 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cd14d09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:45, skipping insertion in model container [2022-02-20 16:35:45,813 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:35:45" (1/1) ... [2022-02-20 16:35:45,819 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:35:45,853 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:35:46,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c[4783,4796] [2022-02-20 16:35:46,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:46,078 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:35:46,135 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0981.c[4783,4796] [2022-02-20 16:35:46,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:35:46,164 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:35:46,164 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46 WrapperNode [2022-02-20 16:35:46,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:35:46,165 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:46,165 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:35:46,165 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:35:46,170 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:35:46" (1/1) ... [2022-02-20 16:35:46,180 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:35:46" (1/1) ... [2022-02-20 16:35:46,241 INFO L137 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 235 [2022-02-20 16:35:46,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:35:46,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:35:46,243 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:35:46,243 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:35:46,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,272 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,277 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,311 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,314 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,321 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:35:46,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:35:46,330 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:35:46,330 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:35:46,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (1/1) ... [2022-02-20 16:35:46,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:35:46,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:35:46,360 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:35:46,367 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:35:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:35:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-02-20 16:35:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-02-20 16:35:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:35:46,391 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:35:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:35:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:35:46,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:35:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:35:46,392 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:35:46,484 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:35:46,485 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:36:17,478 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:36:17,483 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:36:17,484 INFO L299 CfgBuilder]: Removed 14 assume(true) statements. [2022-02-20 16:36:17,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:17 BoogieIcfgContainer [2022-02-20 16:36:17,486 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:36:17,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:36:17,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:36:17,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:36:17,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:35:45" (1/3) ... [2022-02-20 16:36:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c672baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:17, skipping insertion in model container [2022-02-20 16:36:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:35:46" (2/3) ... [2022-02-20 16:36:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c672baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:36:17, skipping insertion in model container [2022-02-20 16:36:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:36:17" (3/3) ... [2022-02-20 16:36:17,492 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0981.c [2022-02-20 16:36:17,496 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:36:17,496 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:36:17,530 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:36:17,536 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:36:17,536 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:36:17,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 44 states have internal predecessors, (74), 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:36:17,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:36:17,573 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:36:17,573 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:36:17,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:36:17,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:36:17,578 INFO L85 PathProgramCache]: Analyzing trace with hash -306140874, now seen corresponding path program 1 times [2022-02-20 16:36:17,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:36:17,589 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099401830] [2022-02-20 16:36:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:36:17,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:36:17,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:36:17,591 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:36:17,592 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:36:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:18,337 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:36:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:36:18,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:36:18,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {48#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);~ln2_hi_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6931471803691238);~ln2_lo_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.9082149292705877E-10);~two54_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~Lg1_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.6666666666666735);~Lg2_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.3999999999940942);~Lg3_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.2857142874366239);~Lg4_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.22222198432149784);~Lg5_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.1818357216161805);~Lg6_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.15313837699209373);~Lg7_log~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.14798198605116586);~zero~0 := ~Pluszero~DOUBLE();~two54_log10~0 := ~to_fp~DOUBLE(currentRoundingMode, 1.8014398509481984E16);~ivln10_log10~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.4342944819032518);~log10_2hi_log10~0 := ~to_fp~DOUBLE(currentRoundingMode, 0.30102999566361177);~log10_2lo_log10~0 := ~to_fp~DOUBLE(currentRoundingMode, 3.694239077158931E-13);~zero_log10~0 := ~Pluszero~DOUBLE(); {48#true} is VALID [2022-02-20 16:36:18,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {48#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret15#1, main_#t~ret16#1, main_~x~0#1, main_~res~0#1;main_~x~0#1 := ~fp.div~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 1.0), ~Pluszero~DOUBLE());assume { :begin_inline___ieee754_log10 } true;__ieee754_log10_#in~x#1 := main_~x~0#1;havoc __ieee754_log10_#res#1;havoc __ieee754_log10_#t~mem8#1, __ieee754_log10_#t~mem9#1, __ieee754_log10_~#ew_u~1#1.base, __ieee754_log10_~#ew_u~1#1.offset, __ieee754_log10_#t~mem10#1, __ieee754_log10_~#gh_u~1#1.base, __ieee754_log10_~#gh_u~1#1.offset, __ieee754_log10_#t~mem11#1, __ieee754_log10_~#sh_u~1#1.base, __ieee754_log10_~#sh_u~1#1.offset, __ieee754_log10_#t~ret12#1, __ieee754_log10_~x#1, __ieee754_log10_~y~0#1, __ieee754_log10_~z~1#1, __ieee754_log10_~i~1#1, __ieee754_log10_~k~1#1, __ieee754_log10_~hx~1#1, __ieee754_log10_~lx~1#1;__ieee754_log10_~x#1 := __ieee754_log10_#in~x#1;havoc __ieee754_log10_~y~0#1;havoc __ieee754_log10_~z~1#1;havoc __ieee754_log10_~i~1#1;havoc __ieee754_log10_~k~1#1;havoc __ieee754_log10_~hx~1#1;havoc __ieee754_log10_~lx~1#1; {48#true} is VALID [2022-02-20 16:36:18,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {48#true} assume !true; {49#false} is VALID [2022-02-20 16:36:18,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {49#false} __ieee754_log10_~k~1#1 := 0bv32; {49#false} is VALID [2022-02-20 16:36:18,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {49#false} assume ~bvslt32(__ieee754_log10_~hx~1#1, 1048576bv32); {49#false} is VALID [2022-02-20 16:36:18,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {49#false} assume 0bv32 == ~bvor32(~bvand32(2147483647bv32, __ieee754_log10_~hx~1#1), __ieee754_log10_~lx~1#1);__ieee754_log10_#res#1 := ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~two54_log10~0), ~zero_log10~0); {49#false} is VALID [2022-02-20 16:36:18,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {49#false} main_#t~ret15#1 := __ieee754_log10_#res#1;assume { :end_inline___ieee754_log10 } true;main_~res~0#1 := main_#t~ret15#1;havoc main_#t~ret15#1;assume { :begin_inline_isinf_double } true;isinf_double_#in~x#1 := main_~res~0#1;havoc isinf_double_#res#1;havoc isinf_double_#t~mem13#1, isinf_double_#t~mem14#1, isinf_double_~#ew_u~2#1.base, isinf_double_~#ew_u~2#1.offset, isinf_double_~x#1, isinf_double_~hx~2#1, isinf_double_~lx~2#1;isinf_double_~x#1 := isinf_double_#in~x#1;havoc isinf_double_~hx~2#1;havoc isinf_double_~lx~2#1; {49#false} is VALID [2022-02-20 16:36:18,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {49#false} assume !true; {49#false} is VALID [2022-02-20 16:36:18,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {49#false} isinf_double_~hx~2#1 := ~bvand32(2147483647bv32, isinf_double_~hx~2#1);isinf_double_~hx~2#1 := ~bvor32(isinf_double_~hx~2#1, ~bvlshr32(~bvor32(isinf_double_~lx~2#1, ~bvneg32(isinf_double_~lx~2#1)), 31bv32));isinf_double_~hx~2#1 := ~bvsub32(2146435072bv32, isinf_double_~hx~2#1);isinf_double_#res#1 := ~bvsub32(1bv32, ~bvlshr32(~bvor32(isinf_double_~hx~2#1, ~bvneg32(isinf_double_~hx~2#1)), 31bv32)); {49#false} is VALID [2022-02-20 16:36:18,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {49#false} main_#t~ret16#1 := isinf_double_#res#1;assume { :end_inline_isinf_double } true; {49#false} is VALID [2022-02-20 16:36:18,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {49#false} assume 0bv32 == main_#t~ret16#1;havoc main_#t~ret16#1; {49#false} is VALID [2022-02-20 16:36:18,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {49#false} assume !false; {49#false} is VALID [2022-02-20 16:36:18,627 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:36:18,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:36:18,628 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:36:18,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1099401830] [2022-02-20 16:36:18,629 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1099401830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:36:18,629 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:36:18,629 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:36:18,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227563621] [2022-02-20 16:36:18,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:36:18,635 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:36:18,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:36:18,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:36:19,402 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:36:19,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:36:19,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:36:19,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:36:19,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:36:19,427 INFO L87 Difference]: Start difference. First operand has 45 states, 43 states have (on average 1.7209302325581395) internal successors, (74), 44 states have internal predecessors, (74), 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 6.0) internal successors, (12), 2 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:36:53,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:36:53,628 INFO L93 Difference]: Finished difference Result 88 states and 146 transitions. [2022-02-20 16:36:53,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:36:53,628 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:36:53,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:36:53,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:36:53,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 146 transitions. [2022-02-20 16:36:53,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 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:36:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 146 transitions. [2022-02-20 16:36:53,643 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 146 transitions.