./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.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 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 ................................................................................................................................................................................................................................................ Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.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 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:10:15,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:10:15,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:10:15,124 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:10:15,124 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:10:15,125 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:10:15,127 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:10:15,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:10:15,130 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:10:15,131 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:10:15,132 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:10:15,133 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:10:15,133 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:10:15,134 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:10:15,135 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:10:15,136 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:10:15,137 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:10:15,138 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:10:15,139 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:10:15,141 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:10:15,142 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:10:15,143 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:10:15,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:10:15,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:10:15,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:10:15,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:10:15,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:10:15,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:10:15,152 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:10:15,153 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:10:15,153 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:10:15,154 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:10:15,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:10:15,161 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:10:15,161 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:10:15,162 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:10:15,162 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:10:15,162 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:10:15,162 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:10:15,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:10:15,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:10:15,165 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:10:15,195 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:10:15,195 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:10:15,196 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:10:15,196 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:10:15,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:10:15,198 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:10:15,198 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:10:15,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:10:15,199 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:10:15,199 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:10:15,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:10:15,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:10:15,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:10:15,200 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:10:15,200 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:10:15,201 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:10:15,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:10:15,201 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:10:15,201 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:10:15,201 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:10:15,201 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:10:15,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:10:15,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:10:15,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:10:15,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:10:15,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:10:15,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:10:15,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:10:15,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:10:15,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:10:15,210 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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2021-08-26 01:10:15,514 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:10:15,536 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:10:15,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:10:15,539 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:10:15,540 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:10:15,541 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:15,599 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c611eee63/1474eef5723045afb2d96c1f8824a4f5/FLAG7db78735b [2021-08-26 01:10:16,054 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:10:16,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:16,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c611eee63/1474eef5723045afb2d96c1f8824a4f5/FLAG7db78735b [2021-08-26 01:10:16,076 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c611eee63/1474eef5723045afb2d96c1f8824a4f5 [2021-08-26 01:10:16,079 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:10:16,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:10:16,082 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:10:16,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:10:16,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:10:16,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e3f4f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16, skipping insertion in model container [2021-08-26 01:10:16,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,095 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:10:16,106 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:10:16,205 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-08-26 01:10:16,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:10:16,215 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:10:16,232 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-08-26 01:10:16,233 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:10:16,242 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:10:16,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16 WrapperNode [2021-08-26 01:10:16,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:10:16,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:10:16,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:10:16,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:10:16,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,272 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:10:16,273 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:10:16,273 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:10:16,273 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:10:16,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,298 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,298 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,303 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,310 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,311 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:10:16,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:10:16,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:10:16,313 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:10:16,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (1/1) ... [2021-08-26 01:10:16,321 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:10:16,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:10:16,338 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) [2021-08-26 01:10:16,348 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 [2021-08-26 01:10:16,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:10:16,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:10:16,390 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:10:16,590 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:10:16,591 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 01:10:16,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:16 BoogieIcfgContainer [2021-08-26 01:10:16,593 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:10:16,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:10:16,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:10:16,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:10:16,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:10:16" (1/3) ... [2021-08-26 01:10:16,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a68ec8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:10:16, skipping insertion in model container [2021-08-26 01:10:16,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:16" (2/3) ... [2021-08-26 01:10:16,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a68ec8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:10:16, skipping insertion in model container [2021-08-26 01:10:16,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:16" (3/3) ... [2021-08-26 01:10:16,602 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:16,607 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:10:16,607 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:10:16,649 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:10:16,657 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-26 01:10:16,657 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:10:16,669 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:10:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 01:10:16,673 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:10:16,673 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 01:10:16,674 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:10:16,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:10:16,688 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-08-26 01:10:16,719 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:10:16,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669383859] [2021-08-26 01:10:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:10:16,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:10:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:10:16,821 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:10:16,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:10:16,879 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:10:16,880 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:10:16,881 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:10:16,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:10:16,888 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:10:16,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:10:16 BoogieIcfgContainer [2021-08-26 01:10:16,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:10:16,909 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:10:16,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:10:16,910 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:10:16,910 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:16" (3/4) ... [2021-08-26 01:10:16,913 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:10:16,913 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:10:16,916 INFO L168 Benchmark]: Toolchain (without parser) took 833.33 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 33.4 MB in the beginning and 44.3 MB in the end (delta: -10.8 MB). Peak memory consumption was 54.9 kB. Max. memory is 16.1 GB. [2021-08-26 01:10:16,917 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.4 MB in the end (delta: 46.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:10:16,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 160.51 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 37.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:10:16,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.60 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 37.6 MB in the beginning and 52.5 MB in the end (delta: -14.8 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:10:16,919 INFO L168 Benchmark]: Boogie Preprocessor took 38.55 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 51.5 MB in the end (delta: 976.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:10:16,920 INFO L168 Benchmark]: RCFGBuilder took 280.67 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 40.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:10:16,925 INFO L168 Benchmark]: TraceAbstraction took 311.65 ms. Allocated memory is still 69.2 MB. Free memory was 39.8 MB in the beginning and 44.6 MB in the end (delta: -4.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:10:16,925 INFO L168 Benchmark]: Witness Printer took 4.16 ms. Allocated memory is still 69.2 MB. Free memory was 44.6 MB in the beginning and 44.3 MB in the end (delta: 299.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:10:16,931 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 54.5 MB. Free memory was 36.5 MB in the beginning and 36.4 MB in the end (delta: 46.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 160.51 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 37.6 MB in the end (delta: -4.4 MB). Peak memory consumption was 9.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 28.60 ms. Allocated memory was 54.5 MB in the beginning and 69.2 MB in the end (delta: 14.7 MB). Free memory was 37.6 MB in the beginning and 52.5 MB in the end (delta: -14.8 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 38.55 ms. Allocated memory is still 69.2 MB. Free memory was 52.5 MB in the beginning and 51.5 MB in the end (delta: 976.1 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 280.67 ms. Allocated memory is still 69.2 MB. Free memory was 51.5 MB in the beginning and 40.4 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 311.65 ms. Allocated memory is still 69.2 MB. Free memory was 39.8 MB in the beginning and 44.6 MB in the end (delta: -4.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * Witness Printer took 4.16 ms. Allocated memory is still 69.2 MB. Free memory was 44.6 MB in the beginning and 44.3 MB in the end (delta: 299.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 12, overapproximation of someBinaryArithmeticDOUBLEoperation at line 10. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; VAL [__return_main=0] [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0] [L25] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0] [L27] reach_error() VAL [__return_main=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 238.4ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 6.1ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 12.8ms SsaConstructionTime, 39.2ms SatisfiabilityAnalysisTime, 0.0ms InterpolantComputationTime, 5 NumberOfCodeBlocks, 5 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 0 ConstructedInterpolants, 0 QuantifiedInterpolants, 0 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 0 InterpolantComputations, 0 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 [2021-08-26 01:10:16,973 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... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:10:18,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:10:18,700 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:10:18,744 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:10:18,745 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:10:18,748 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:10:18,749 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:10:18,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:10:18,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:10:18,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:10:18,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:10:18,764 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:10:18,764 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:10:18,767 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:10:18,768 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:10:18,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:10:18,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:10:18,773 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:10:18,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:10:18,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:10:18,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:10:18,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:10:18,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:10:18,783 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:10:18,789 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:10:18,790 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:10:18,790 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:10:18,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:10:18,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:10:18,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:10:18,793 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:10:18,793 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:10:18,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:10:18,795 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:10:18,796 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:10:18,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:10:18,797 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:10:18,797 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:10:18,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:10:18,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:10:18,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:10:18,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:10:18,839 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:10:18,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:10:18,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:10:18,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:10:18,842 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:10:18,842 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:10:18,842 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:10:18,843 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:10:18,843 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:10:18,843 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:10:18,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:10:18,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:10:18,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:10:18,844 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:10:18,844 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:10:18,845 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:10:18,845 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:10:18,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:10:18,845 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:10:18,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:10:18,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:10:18,846 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:10:18,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:10:18,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:10:18,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:10:18,846 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:10:18,847 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:10:18,848 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 -> 14286cb21d81f224a2bc0c145c98a5c3f3fcd807 [2021-08-26 01:10:19,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:10:19,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:10:19,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:10:19,170 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:10:19,171 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:10:19,172 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:19,218 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb5ec0ab/90a5398ba2e1451d8c849959c1ddc87a/FLAG755758679 [2021-08-26 01:10:19,569 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:10:19,570 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:19,574 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb5ec0ab/90a5398ba2e1451d8c849959c1ddc87a/FLAG755758679 [2021-08-26 01:10:19,586 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0eb5ec0ab/90a5398ba2e1451d8c849959c1ddc87a [2021-08-26 01:10:19,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:10:19,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:10:19,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:10:19,593 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:10:19,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:10:19,597 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40314ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19, skipping insertion in model container [2021-08-26 01:10:19,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:10:19,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:10:19,756 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-08-26 01:10:19,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:10:19,773 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:10:19,788 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/floats-esbmc-regression/Float_div_bad.i.p+cfa-reducer.c[699,712] [2021-08-26 01:10:19,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:10:19,808 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:10:19,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19 WrapperNode [2021-08-26 01:10:19,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:10:19,810 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:10:19,810 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:10:19,810 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:10:19,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,870 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,884 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:10:19,885 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:10:19,885 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:10:19,885 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:10:19,891 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,891 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:10:19,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:10:19,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:10:19,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:10:19,926 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (1/1) ... [2021-08-26 01:10:19,933 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:10:19,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:10:19,988 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) [2021-08-26 01:10:20,014 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 [2021-08-26 01:10:20,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:10:20,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:10:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:10:20,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:10:24,575 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:10:24,576 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2021-08-26 01:10:24,578 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:24 BoogieIcfgContainer [2021-08-26 01:10:24,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:10:24,581 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:10:24,581 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:10:24,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:10:24,586 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:10:19" (1/3) ... [2021-08-26 01:10:24,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4fffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:10:24, skipping insertion in model container [2021-08-26 01:10:24,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:10:19" (2/3) ... [2021-08-26 01:10:24,587 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4fffdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:10:24, skipping insertion in model container [2021-08-26 01:10:24,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:24" (3/3) ... [2021-08-26 01:10:24,588 INFO L111 eAbstractionObserver]: Analyzing ICFG Float_div_bad.i.p+cfa-reducer.c [2021-08-26 01:10:24,593 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:10:24,593 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:10:24,640 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:10:24,648 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, mConcurrency=FINITE_AUTOMATA, 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 [2021-08-26 01:10:24,648 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:10:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:10:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-26 01:10:24,670 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:10:24,671 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-26 01:10:24,672 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:10:24,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:10:24,677 INFO L82 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-08-26 01:10:24,685 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:10:24,686 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1198806043] [2021-08-26 01:10:24,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:10:24,687 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:10:24,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:10:24,692 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) [2021-08-26 01:10:24,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:10:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:10:25,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:10:25,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:10:32,318 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2021-08-26 01:10:32,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:10:32,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:10:38,893 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) .cse0))) is different from false [2021-08-26 01:10:41,037 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) .cse0))) is different from true [2021-08-26 01:10:41,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:10:41,038 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:10:41,038 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1198806043] [2021-08-26 01:10:41,039 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1198806043] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:10:41,039 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:10:41,039 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2021-08-26 01:10:41,040 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89164667] [2021-08-26 01:10:41,043 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:10:41,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:10:41,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:10:41,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=8, Unknown=3, NotChecked=10, Total=30 [2021-08-26 01:10:41,054 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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) [2021-08-26 01:10:43,218 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:10:45,375 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0)))) is different from true [2021-08-26 01:10:49,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:10:49,996 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-08-26 01:10:49,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:10:49,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 5 [2021-08-26 01:10:49,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:10:50,004 INFO L225 Difference]: With dead ends: 16 [2021-08-26 01:10:50,004 INFO L226 Difference]: Without dead ends: 7 [2021-08-26 01:10:50,006 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10820.9ms TimeCoverageRelationStatistics Valid=13, Invalid=10, Unknown=5, NotChecked=28, Total=56 [2021-08-26 01:10:50,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-08-26 01:10:50,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-08-26 01:10:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 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) [2021-08-26 01:10:50,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-08-26 01:10:50,028 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-08-26 01:10:50,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:10:50,029 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-08-26 01:10:50,029 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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) [2021-08-26 01:10:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-08-26 01:10:50,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-08-26 01:10:50,029 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:10:50,030 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-08-26 01:10:50,057 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 01:10:50,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:10:50,250 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:10:50,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:10:50,251 INFO L82 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2021-08-26 01:10:50,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:10:50,252 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1905897132] [2021-08-26 01:10:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:10:50,252 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:10:50,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:10:50,253 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:10:50,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:10:51,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:10:51,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-26 01:10:51,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:10:56,497 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:11:03,217 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2021-08-26 01:11:03,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-08-26 01:11:03,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:11:09,849 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2021-08-26 01:11:12,006 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2021-08-26 01:11:18,877 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-08-26 01:11:21,189 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-08-26 01:11:21,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2021-08-26 01:11:21,189 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:11:21,189 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1905897132] [2021-08-26 01:11:21,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1905897132] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:11:21,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:11:21,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2021-08-26 01:11:21,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971867791] [2021-08-26 01:11:21,191 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 01:11:21,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:11:21,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 01:11:21,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=9, Unknown=6, NotChecked=28, Total=56 [2021-08-26 01:11:21,192 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:11:23,533 WARN L860 $PredicateComparison]: unable to prove that (and (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:11:25,854 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:11:28,028 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0)) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2021-08-26 01:11:32,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:11:32,664 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2021-08-26 01:11:32,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 01:11:32,666 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-08-26 01:11:32,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:11:32,666 INFO L225 Difference]: With dead ends: 11 [2021-08-26 01:11:32,667 INFO L226 Difference]: Without dead ends: 8 [2021-08-26 01:11:32,667 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20117.8ms TimeCoverageRelationStatistics Valid=19, Invalid=12, Unknown=9, NotChecked=70, Total=110 [2021-08-26 01:11:32,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2021-08-26 01:11:32,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2021-08-26 01:11:32,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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) [2021-08-26 01:11:32,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2021-08-26 01:11:32,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2021-08-26 01:11:32,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:11:32,670 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2021-08-26 01:11:32,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.25) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:11:32,670 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2021-08-26 01:11:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-26 01:11:32,670 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:11:32,670 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2021-08-26 01:11:32,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:11:32,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:11:32,873 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:11:32,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:11:32,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1805796550, now seen corresponding path program 2 times [2021-08-26 01:11:32,874 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:11:32,875 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [407431277] [2021-08-26 01:11:32,875 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-26 01:11:32,875 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:11:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:11:32,877 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:11:32,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:11:34,924 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-26 01:11:34,924 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:11:35,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 01:11:35,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:11:40,548 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:11:45,726 WARN L207 SmtUtils]: Spent 5.14 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:11:48,077 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:11:58,423 WARN L207 SmtUtils]: Spent 5.75 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:12:00,908 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:12:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-08-26 01:12:01,004 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:12:12,540 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-08-26 01:12:14,720 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-08-26 01:12:24,852 WARN L207 SmtUtils]: Spent 5.20 s on a formula simplification that was a NOOP. DAG size: 10 [2021-08-26 01:12:27,185 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:12:29,505 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:12:34,949 WARN L207 SmtUtils]: Spent 5.43 s on a formula simplification that was a NOOP. DAG size: 17 [2021-08-26 01:12:40,660 WARN L207 SmtUtils]: Spent 5.71 s on a formula simplification that was a NOOP. DAG size: 15 [2021-08-26 01:12:43,131 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:12:45,589 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:12:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-08-26 01:12:45,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:12:45,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [407431277] [2021-08-26 01:12:45,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [407431277] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:12:45,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:12:45,590 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-08-26 01:12:45,590 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165918032] [2021-08-26 01:12:45,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-26 01:12:45,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:12:45,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-26 01:12:45,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=16, Unknown=9, NotChecked=66, Total=110 [2021-08-26 01:12:45,592 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:12:48,089 WARN L860 $PredicateComparison]: unable to prove that (and (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:12:50,583 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2021-08-26 01:12:53,064 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2021-08-26 01:12:55,559 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:12:58,081 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:13:02,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:13:02,771 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2021-08-26 01:13:02,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:13:02,772 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-26 01:13:02,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:13:02,772 INFO L225 Difference]: With dead ends: 12 [2021-08-26 01:13:02,772 INFO L226 Difference]: Without dead ends: 9 [2021-08-26 01:13:02,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 33700.6ms TimeCoverageRelationStatistics Valid=27, Invalid=19, Unknown=14, NotChecked=150, Total=210 [2021-08-26 01:13:02,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2021-08-26 01:13:02,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2021-08-26 01:13:02,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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) [2021-08-26 01:13:02,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2021-08-26 01:13:02,775 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2021-08-26 01:13:02,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:13:02,775 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2021-08-26 01:13:02,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:13:02,775 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2021-08-26 01:13:02,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 01:13:02,775 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:13:02,775 INFO L512 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1] [2021-08-26 01:13:02,820 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-08-26 01:13:02,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:13:02,976 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:13:02,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:13:02,977 INFO L82 PathProgramCache]: Analyzing trace with hash 145055718, now seen corresponding path program 3 times [2021-08-26 01:13:02,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:13:02,977 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205257867] [2021-08-26 01:13:02,978 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-26 01:13:02,978 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:13:02,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:13:02,979 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:13:02,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:13:05,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-08-26 01:13:05,827 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:13:05,966 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 13 conjunts are in the unsatisfiable core [2021-08-26 01:13:05,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:13:20,151 WARN L207 SmtUtils]: Spent 5.14 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:13:22,478 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:13:28,272 WARN L207 SmtUtils]: Spent 5.75 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:13:30,789 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:13:37,196 WARN L207 SmtUtils]: Spent 6.35 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:13:44,461 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from false [2021-08-26 01:13:47,133 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2021-08-26 01:13:47,240 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-08-26 01:13:47,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:13:58,619 WARN L838 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from false [2021-08-26 01:14:00,788 WARN L860 $PredicateComparison]: unable to prove that (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) is different from true [2021-08-26 01:14:05,800 WARN L207 SmtUtils]: Spent 5.01 s on a formula simplification that was a NOOP. DAG size: 12 [2021-08-26 01:14:11,054 WARN L207 SmtUtils]: Spent 5.25 s on a formula simplification that was a NOOP. DAG size: 10 [2021-08-26 01:14:13,402 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from false [2021-08-26 01:14:15,749 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)) (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))))) is different from true [2021-08-26 01:14:21,633 WARN L207 SmtUtils]: Spent 5.88 s on a formula simplification that was a NOOP. DAG size: 13 [2021-08-26 01:14:27,251 WARN L207 SmtUtils]: Spent 5.62 s on a formula simplification that was a NOOP. DAG size: 15 [2021-08-26 01:14:29,767 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-08-26 01:14:32,288 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-08-26 01:14:38,778 WARN L207 SmtUtils]: Spent 6.48 s on a formula simplification that was a NOOP. DAG size: 18 [2021-08-26 01:14:44,937 WARN L207 SmtUtils]: Spent 6.16 s on a formula simplification that was a NOOP. DAG size: 20 [2021-08-26 01:14:47,605 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from false [2021-08-26 01:14:50,297 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0))))) is different from true [2021-08-26 01:14:50,297 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2021-08-26 01:14:50,297 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:14:50,298 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205257867] [2021-08-26 01:14:50,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205257867] provided 0 perfect and 2 imperfect interpolant sequences [2021-08-26 01:14:50,298 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-26 01:14:50,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2021-08-26 01:14:50,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803244249] [2021-08-26 01:14:50,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:14:50,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:14:50,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:14:50,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=22, Unknown=12, NotChecked=98, Total=156 [2021-08-26 01:14:50,299 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2021-08-26 01:14:53,047 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse1))) .cse1))) .cse1)))) (or (fp.eq .cse0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))))) is different from true [2021-08-26 01:14:55,761 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0))) .cse0)))) (or (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:14:58,473 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from false [2021-08-26 01:15:01,193 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven) (let ((.cse1 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)))) (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse1) .cse0)) .cse1)) (fp.eq .cse1 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))))))) is different from true [2021-08-26 01:15:03,902 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (or (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0)) (fp.eq c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32)))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven))) is different from true [2021-08-26 01:15:06,670 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from false [2021-08-26 01:15:09,362 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (and (or (fp.eq c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (_ bv0 32))) (not (fp.eq c_ULTIMATE.start_main_~main__x1~0 c_ULTIMATE.start_main_~main__x~0))) (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x~0) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven) (= c_ULTIMATE.start_main_~main__x~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))))) is different from true [2021-08-26 01:15:14,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:15:14,113 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2021-08-26 01:15:14,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:15:14,114 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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 8 [2021-08-26 01:15:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:15:14,114 INFO L225 Difference]: With dead ends: 13 [2021-08-26 01:15:14,114 INFO L226 Difference]: Without dead ends: 10 [2021-08-26 01:15:14,115 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 55043.5ms TimeCoverageRelationStatistics Valid=34, Invalid=25, Unknown=19, NotChecked=228, Total=306 [2021-08-26 01:15:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-08-26 01:15:14,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-08-26 01:15:14,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:15:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-08-26 01:15:14,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2021-08-26 01:15:14,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:15:14,116 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-08-26 01:15:14,117 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 12 states have internal predecessors, (15), 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) [2021-08-26 01:15:14,117 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-08-26 01:15:14,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 01:15:14,117 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:15:14,117 INFO L512 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2021-08-26 01:15:14,170 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-08-26 01:15:14,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:15:14,318 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:15:14,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:15:14,318 INFO L82 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 4 times [2021-08-26 01:15:14,318 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:15:14,319 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1001071918] [2021-08-26 01:15:14,319 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 01:15:14,319 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:15:14,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:15:14,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:15:14,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:15:17,559 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 01:15:17,559 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:15:17,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:15:17,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:15:23,160 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0))))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:15:28,436 WARN L207 SmtUtils]: Spent 5.21 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:15:30,786 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:15:36,724 WARN L207 SmtUtils]: Spent 5.86 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:15:39,263 WARN L860 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_main_~main__x1~0 ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:15:45,790 WARN L207 SmtUtils]: Spent 6.46 s on a formula simplification that was a NOOP. DAG size: 3 [2021-08-26 01:15:48,509 WARN L860 $PredicateComparison]: unable to prove that (and (= ((_ to_fp 8 24) c_currentRoundingMode (let ((.cse0 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode 1.0))) .cse0))) .cse0))) .cse0))) .cse0))) c_ULTIMATE.start_main_~main__x1~0) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2021-08-26 01:15:55,342 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 800000011920929.0 500000000000000.0)))) (and (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) .cse0))) .cse0))) .cse0))) .cse0)) c_ULTIMATE.start_main_~main__x~0) (= ((_ to_fp 8 24) roundNearestTiesToEven (fp.div roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven c_ULTIMATE.start_main_~main__x~0) .cse0)) c_ULTIMATE.start_main_~main__x1~0))) is different from true [2021-08-26 01:15:55,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2021-08-26 01:15:55,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:16:02,199 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from false [2021-08-26 01:16:04,370 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) c_ULTIMATE.start_main_~main__x1~0)) is different from true [2021-08-26 01:16:11,433 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-08-26 01:16:13,782 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-08-26 01:16:18,839 WARN L207 SmtUtils]: Spent 5.05 s on a formula simplification that was a NOOP. DAG size: 15 [2021-08-26 01:16:21,372 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-08-26 01:16:23,893 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-08-26 01:16:29,366 WARN L207 SmtUtils]: Spent 5.47 s on a formula simplification that was a NOOP. DAG size: 18 [2021-08-26 01:16:32,086 WARN L838 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from false [2021-08-26 01:16:34,807 WARN L860 $PredicateComparison]: unable to prove that (not (let ((.cse1 ((_ to_fp 11 53) c_currentRoundingMode (/ 800000011920929.0 500000000000000.0)))) (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_ULTIMATE.start_main_~main__x1~0) .cse1))) .cse1))) .cse1)))) (fp.eq ((_ to_fp 8 24) c_currentRoundingMode (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) .cse0)))) is different from true [2021-08-26 01:16:37,003 WARN L224 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) stderr output: (error "out of memory") [2021-08-26 01:16:37,005 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:16:37,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1001071918] [2021-08-26 01:16:37,005 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") [2021-08-26 01:16:37,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1541041368] [2021-08-26 01:16:37,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 01:16:37,006 INFO L170 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-08-26 01:16:37,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-08-26 01:16:37,006 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 101 [2021-08-26 01:16:37,007 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-08-26 01:16:37,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2021-08-26 01:16:44,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 01:16:44,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:16:44,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 12 conjunts are in the unsatisfiable core [2021-08-26 01:16:44,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:16:44,774 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-08-26 01:16:44,774 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265247426] [2021-08-26 01:16:44,774 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-08-26 01:16:44,774 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 01:16:44,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:16:44,776 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-26 01:16:44,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-08-26 01:20:06,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-08-26 01:20:06,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-26 01:20:06,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 01:20:06,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:20:06,860 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1) with exit command (exit)) Connection to SMT solver broken [2021-08-26 01:20:06,860 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:20:06,860 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2021-08-26 01:20:06,860 ERROR L172 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2021-08-26 01:20:06,860 INFO L626 BasicCegarLoop]: Counterexample might be feasible [2021-08-26 01:20:06,863 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:20:06,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2021-08-26 01:20:07,125 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2021-08-26 01:20:07,465 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forcibly destroying the process [2021-08-26 01:20:07,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 137 [2021-08-26 01:20:07,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-26 01:20:07,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:20:07,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:20:07 BoogieIcfgContainer [2021-08-26 01:20:07,543 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:20:07,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:20:07,544 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:20:07,544 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:20:07,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:10:24" (3/4) ... [2021-08-26 01:20:07,547 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:20:07,547 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:20:07,548 INFO L168 Benchmark]: Toolchain (without parser) took 587958.01 ms. Allocated memory was 65.0 MB in the beginning and 88.1 MB in the end (delta: 23.1 MB). Free memory was 46.1 MB in the beginning and 40.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 26.8 MB. Max. memory is 16.1 GB. [2021-08-26 01:20:07,549 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:20:07,549 INFO L168 Benchmark]: CACSL2BoogieTranslator took 216.84 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 36.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:20:07,550 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.94 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 48.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:20:07,550 INFO L168 Benchmark]: Boogie Preprocessor took 39.36 ms. Allocated memory is still 65.0 MB. Free memory was 48.4 MB in the beginning and 47.3 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:20:07,550 INFO L168 Benchmark]: RCFGBuilder took 4653.07 ms. Allocated memory is still 65.0 MB. Free memory was 47.3 MB in the beginning and 35.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-08-26 01:20:07,551 INFO L168 Benchmark]: TraceAbstraction took 582962.93 ms. Allocated memory was 65.0 MB in the beginning and 88.1 MB in the end (delta: 23.1 MB). Free memory was 35.2 MB in the beginning and 40.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:20:07,551 INFO L168 Benchmark]: Witness Printer took 3.15 ms. Allocated memory is still 88.1 MB. Free memory is still 40.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:20:07,553 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 216.84 ms. Allocated memory is still 65.0 MB. Free memory was 45.9 MB in the beginning and 36.0 MB in the end (delta: 9.9 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.94 ms. Allocated memory is still 65.0 MB. Free memory was 35.8 MB in the beginning and 48.4 MB in the end (delta: -12.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 39.36 ms. Allocated memory is still 65.0 MB. Free memory was 48.4 MB in the beginning and 47.3 MB in the end (delta: 1.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 4653.07 ms. Allocated memory is still 65.0 MB. Free memory was 47.3 MB in the beginning and 35.7 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 582962.93 ms. Allocated memory was 65.0 MB in the beginning and 88.1 MB in the end (delta: 23.1 MB). Free memory was 35.2 MB in the beginning and 40.8 MB in the end (delta: -5.6 MB). Peak memory consumption was 19.6 MB. Max. memory is 16.1 GB. * Witness Printer took 3.15 ms. Allocated memory is still 88.1 MB. Free memory is still 40.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 27]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L1] int __return_main; [L9] float main__x = 1.0; [L10] float main__x1 = main__x / 1.600000023841858; [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 1.600000023841858 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 1.600000023841858 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 1.600000023841858 [L12] COND TRUE main__x1 != main__x [L14] main__x = main__x1 [L15] main__x1 = main__x / 1.600000023841858 [L12] COND FALSE !(main__x1 != main__x) [L21] int __tmp_1; [L22] __tmp_1 = main__x == 0 [L23] int __VERIFIER_assert__cond; [L24] __VERIFIER_assert__cond = __tmp_1 [L25] COND TRUE __VERIFIER_assert__cond == 0 [L27] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 582896.4ms, OverallIterations: 5, TraceHistogramMax: 4, EmptinessCheckTime: 14.8ms, AutomataDifference: 61435.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 8.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 23 SDtfs, 0 SDslu, 30 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 8 SolverUnknown, 0 SolverNotchecked, 18086.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 33 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 119683.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10occurred in iteration=4, InterpolantAutomatonStates: 22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 15.9ms AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 63.9ms SsaConstructionTime, 6673.9ms SatisfiabilityAnalysisTime, 220387.8ms InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 831 SizeOfPredicates, 20 NumberOfNonLiveVariables, 138 ConjunctsInSsa, 34 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/20 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 Received shutdown request...