./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1230.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1230.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 858612fdb9071600e83746a6e504d4acbbe533c1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1230.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 858612fdb9071600e83746a6e504d4acbbe533c1 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:05:42,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:05:42,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:05:42,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:05:42,115 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:05:42,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:05:42,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:05:42,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:05:42,123 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:05:42,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:05:42,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:05:42,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:05:42,129 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:05:42,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:05:42,132 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:05:42,133 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:05:42,135 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:05:42,143 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:05:42,146 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:05:42,148 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:05:42,150 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:05:42,152 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:05:42,154 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:05:42,155 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:05:42,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:05:42,159 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:05:42,159 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:05:42,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:05:42,161 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:05:42,163 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:05:42,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:05:42,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:05:42,165 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:05:42,166 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:05:42,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:05:42,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:05:42,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:05:42,170 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:05:42,170 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:05:42,172 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:05:42,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:05:42,174 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 15:05:42,202 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:05:42,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:05:42,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:05:42,205 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:05:42,206 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:05:42,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:05:42,208 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:05:42,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 15:05:42,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:05:42,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:05:42,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:05:42,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:05:42,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:05:42,213 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:05:42,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:05:42,214 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:05:42,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:05:42,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:05:42,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:05:42,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:05:42,214 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:05:42,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:05:42,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:05:42,215 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:05:42,215 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:05:42,215 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 15:05:42,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 15:05:42,216 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:05:42,216 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:05:42,216 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-2/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-2/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 -> 858612fdb9071600e83746a6e504d4acbbe533c1 [2020-10-24 15:05:42,648 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:05:42,689 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:05:42,693 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:05:42,694 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:05:42,696 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:05:42,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2020-10-24 15:05:42,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/29d0b59d4/0bcf5091a7fd488087465c4ca12c51e2/FLAGc0357aa6b [2020-10-24 15:05:43,486 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:05:43,487 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2020-10-24 15:05:43,497 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/29d0b59d4/0bcf5091a7fd488087465c4ca12c51e2/FLAGc0357aa6b [2020-10-24 15:05:43,845 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/29d0b59d4/0bcf5091a7fd488087465c4ca12c51e2 [2020-10-24 15:05:43,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:05:43,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:05:43,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:05:43,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:05:43,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:05:43,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:05:43" (1/1) ... [2020-10-24 15:05:43,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222c254b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:43, skipping insertion in model container [2020-10-24 15:05:43,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:05:43" (1/1) ... [2020-10-24 15:05:43,886 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:05:43,904 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:05:44,150 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:05:44,162 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:05:44,229 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:05:44,255 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:05:44,256 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44 WrapperNode [2020-10-24 15:05:44,256 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:05:44,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:05:44,260 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:05:44,260 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:05:44,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,302 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,358 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:05:44,359 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:05:44,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:05:44,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:05:44,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,374 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,383 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,383 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,412 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,423 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,425 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... [2020-10-24 15:05:44,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:05:44,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:05:44,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:05:44,437 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:05:44,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:05:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 15:05:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:05:44,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-24 15:05:44,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:05:44,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:05:44,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 15:05:44,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:05:45,228 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:05:45,229 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-10-24 15:05:45,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:05:45 BoogieIcfgContainer [2020-10-24 15:05:45,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:05:45,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:05:45,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:05:45,237 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:05:45,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:05:43" (1/3) ... [2020-10-24 15:05:45,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f8c0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:05:45, skipping insertion in model container [2020-10-24 15:05:45,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:44" (2/3) ... [2020-10-24 15:05:45,239 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f8c0c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:05:45, skipping insertion in model container [2020-10-24 15:05:45,239 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:05:45" (3/3) ... [2020-10-24 15:05:45,241 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-10-24 15:05:45,255 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:05:45,262 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 15:05:45,278 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 15:05:45,307 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:05:45,308 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:05:45,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:05:45,308 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:05:45,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:05:45,308 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:05:45,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:05:45,309 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:05:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-24 15:05:45,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 15:05:45,331 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:45,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:45,333 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:45,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:45,340 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-10-24 15:05:45,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:45,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178423524] [2020-10-24 15:05:45,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:45,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178423524] [2020-10-24 15:05:45,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:45,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 15:05:45,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574130750] [2020-10-24 15:05:45,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:05:45,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:05:45,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:05:45,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:05:45,533 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-10-24 15:05:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:45,556 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-10-24 15:05:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:05:45,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 15:05:45,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:45,569 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:05:45,570 INFO L226 Difference]: Without dead ends: 25 [2020-10-24 15:05:45,573 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:05:45,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-24 15:05:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-24 15:05:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:05:45,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-10-24 15:05:45,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-10-24 15:05:45,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:45,616 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-10-24 15:05:45,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:05:45,616 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-10-24 15:05:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 15:05:45,617 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:45,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:45,618 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 15:05:45,618 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:45,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:45,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-10-24 15:05:45,620 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:45,620 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130889221] [2020-10-24 15:05:45,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:45,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:45,745 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130889221] [2020-10-24 15:05:45,745 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:45,745 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:05:45,746 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310658331] [2020-10-24 15:05:45,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:05:45,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:05:45,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:05:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:05:45,749 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-10-24 15:05:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:45,835 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-24 15:05:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:05:45,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-24 15:05:45,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:45,837 INFO L225 Difference]: With dead ends: 41 [2020-10-24 15:05:45,837 INFO L226 Difference]: Without dead ends: 36 [2020-10-24 15:05:45,838 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:05:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-24 15:05:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2020-10-24 15:05:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:05:45,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:05:45,845 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-10-24 15:05:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:45,845 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:05:45,845 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:05:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:05:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 15:05:45,846 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:45,846 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:45,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 15:05:45,847 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:45,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2020-10-24 15:05:45,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:45,848 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564372863] [2020-10-24 15:05:45,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:45,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:45,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:45,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564372863] [2020-10-24 15:05:45,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:45,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:05:45,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676645070] [2020-10-24 15:05:45,908 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:05:45,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:05:45,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:05:45,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:05:45,910 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:05:45,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:45,972 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-10-24 15:05:45,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:05:45,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-24 15:05:45,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:45,973 INFO L225 Difference]: With dead ends: 43 [2020-10-24 15:05:45,974 INFO L226 Difference]: Without dead ends: 38 [2020-10-24 15:05:45,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:05:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-24 15:05:45,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-10-24 15:05:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:05:45,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:05:45,980 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2020-10-24 15:05:45,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:45,981 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:05:45,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:05:45,981 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:05:45,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 15:05:45,982 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:45,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:45,982 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 15:05:45,982 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:45,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:45,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2020-10-24 15:05:45,983 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:45,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254765592] [2020-10-24 15:05:45,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:46,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:46,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:46,108 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254765592] [2020-10-24 15:05:46,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:46,109 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:05:46,109 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344688073] [2020-10-24 15:05:46,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:05:46,110 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:05:46,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:05:46,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:05:46,111 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:05:46,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:46,176 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2020-10-24 15:05:46,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:05:46,178 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-24 15:05:46,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:46,179 INFO L225 Difference]: With dead ends: 45 [2020-10-24 15:05:46,179 INFO L226 Difference]: Without dead ends: 40 [2020-10-24 15:05:46,180 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:05:46,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-24 15:05:46,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2020-10-24 15:05:46,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:05:46,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:05:46,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2020-10-24 15:05:46,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:46,187 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:05:46,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:05:46,187 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:05:46,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:05:46,188 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:46,189 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:46,189 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 15:05:46,189 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:46,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:46,190 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2020-10-24 15:05:46,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:46,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864712476] [2020-10-24 15:05:46,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:46,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:46,262 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864712476] [2020-10-24 15:05:46,263 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:46,263 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:05:46,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511039184] [2020-10-24 15:05:46,263 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:05:46,264 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:05:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:05:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:05:46,265 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:05:46,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:46,322 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-10-24 15:05:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:05:46,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-24 15:05:46,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:46,323 INFO L225 Difference]: With dead ends: 43 [2020-10-24 15:05:46,324 INFO L226 Difference]: Without dead ends: 38 [2020-10-24 15:05:46,324 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:05:46,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-24 15:05:46,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-10-24 15:05:46,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:05:46,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:05:46,330 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2020-10-24 15:05:46,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:46,331 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:05:46,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:05:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:05:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:05:46,332 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:46,332 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:46,333 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 15:05:46,333 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:46,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:46,334 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-10-24 15:05:46,334 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:05:46,334 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101122831] [2020-10-24 15:05:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:05:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:05:46,366 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:05:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:05:46,403 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:05:46,432 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 15:05:46,432 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 15:05:46,433 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 15:05:46,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:05:46 BoogieIcfgContainer [2020-10-24 15:05:46,491 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:05:46,496 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:05:46,496 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:05:46,497 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:05:46,497 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:05:45" (3/4) ... [2020-10-24 15:05:46,501 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 15:05:46,502 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:05:46,506 INFO L168 Benchmark]: Toolchain (without parser) took 2652.18 ms. Allocated memory was 44.0 MB in the beginning and 67.1 MB in the end (delta: 23.1 MB). Free memory was 21.0 MB in the beginning and 45.2 MB in the end (delta: -24.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,510 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 44.0 MB. Free memory was 30.2 MB in the beginning and 30.2 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:05:46,514 INFO L168 Benchmark]: CACSL2BoogieTranslator took 398.68 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 37.6 MB in the end (delta: -17.4 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,522 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.66 ms. Allocated memory is still 54.5 MB. Free memory was 37.6 MB in the beginning and 35.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,522 INFO L168 Benchmark]: Boogie Preprocessor took 76.30 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 34.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,523 INFO L168 Benchmark]: RCFGBuilder took 794.94 ms. Allocated memory is still 54.5 MB. Free memory was 34.4 MB in the beginning and 27.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,526 INFO L168 Benchmark]: TraceAbstraction took 1258.07 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.5 MB in the beginning and 45.8 MB in the end (delta: -19.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:05:46,527 INFO L168 Benchmark]: Witness Printer took 5.91 ms. Allocated memory is still 67.1 MB. Free memory was 45.8 MB in the beginning and 45.2 MB in the end (delta: 508.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:05:46,542 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.33 ms. Allocated memory is still 44.0 MB. Free memory was 30.2 MB in the beginning and 30.2 MB in the end (delta: 29.3 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 398.68 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.3 MB in the beginning and 37.6 MB in the end (delta: -17.4 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 98.66 ms. Allocated memory is still 54.5 MB. Free memory was 37.6 MB in the beginning and 35.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.30 ms. Allocated memory is still 54.5 MB. Free memory was 35.9 MB in the beginning and 34.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 794.94 ms. Allocated memory is still 54.5 MB. Free memory was 34.4 MB in the beginning and 27.0 MB in the end (delta: 7.3 MB). Peak memory consumption was 9.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1258.07 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 26.5 MB in the beginning and 45.8 MB in the end (delta: -19.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.91 ms. Allocated memory is still 67.1 MB. Free memory was 45.8 MB in the beginning and 45.2 MB in the end (delta: 508.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryArithmeticDOUBLE_SMToperation at line 63, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 18. Possible FailurePath: [L63] double x = 0.0 / 0.0; [L64] double y = 0.0 / 0.0; [L20] __uint32_t msw, lsw; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; [L65] double res = fmin_double(x, y); [L18] return x != x; [L67] COND TRUE !isnan_double(res) [L3] __assert_fail("0", "double_req_bl_1230.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 206 SDtfs, 44 SDslu, 238 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 44 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:05:49,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:05:49,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:05:49,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:05:49,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:05:49,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:05:49,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:05:49,258 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:05:49,260 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:05:49,262 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:05:49,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:05:49,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:05:49,266 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:05:49,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:05:49,269 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:05:49,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:05:49,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:05:49,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:05:49,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:05:49,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:05:49,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:05:49,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:05:49,284 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:05:49,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:05:49,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:05:49,290 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:05:49,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:05:49,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:05:49,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:05:49,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:05:49,294 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:05:49,295 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:05:49,296 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:05:49,304 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:05:49,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:05:49,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:05:49,307 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:05:49,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:05:49,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:05:49,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:05:49,310 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:05:49,311 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 15:05:49,341 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:05:49,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:05:49,343 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:05:49,344 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:05:49,344 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:05:49,345 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:05:49,345 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:05:49,345 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:05:49,345 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:05:49,346 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:05:49,346 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:05:49,346 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:05:49,347 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 15:05:49,347 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 15:05:49,347 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:05:49,347 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:05:49,348 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:05:49,348 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:05:49,348 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:05:49,348 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:05:49,349 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:05:49,349 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:05:49,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:05:49,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:05:49,350 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:05:49,350 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:05:49,350 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 15:05:49,351 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 15:05:49,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:05:49,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:05:49,352 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 15:05:49,352 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-2/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-2/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 -> 858612fdb9071600e83746a6e504d4acbbe533c1 [2020-10-24 15:05:49,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:05:49,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:05:49,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:05:49,857 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:05:49,858 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:05:49,859 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2020-10-24 15:05:49,961 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/55d4fe5cf/dcd64f95575543d3a6fc2e88b0af5a1b/FLAGd23445005 [2020-10-24 15:05:50,613 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:05:50,613 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1230.c [2020-10-24 15:05:50,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/55d4fe5cf/dcd64f95575543d3a6fc2e88b0af5a1b/FLAGd23445005 [2020-10-24 15:05:50,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/55d4fe5cf/dcd64f95575543d3a6fc2e88b0af5a1b [2020-10-24 15:05:50,999 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:05:51,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:05:51,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:05:51,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:05:51,018 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:05:51,019 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:05:50" (1/1) ... [2020-10-24 15:05:51,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25fa2b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51, skipping insertion in model container [2020-10-24 15:05:51,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:05:50" (1/1) ... [2020-10-24 15:05:51,034 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:05:51,060 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:05:51,302 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:05:51,329 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:05:51,380 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:05:51,406 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:05:51,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51 WrapperNode [2020-10-24 15:05:51,407 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:05:51,408 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:05:51,409 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:05:51,409 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:05:51,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,431 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:05:51,464 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:05:51,465 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:05:51,465 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:05:51,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,482 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,494 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... [2020-10-24 15:05:51,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:05:51,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:05:51,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:05:51,516 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:05:51,517 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:05:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 15:05:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-10-24 15:05:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 15:05:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:05:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-24 15:05:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:05:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:05:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:05:52,258 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:05:52,258 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-10-24 15:05:52,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:05:52 BoogieIcfgContainer [2020-10-24 15:05:52,261 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:05:52,263 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:05:52,263 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:05:52,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:05:52,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:05:50" (1/3) ... [2020-10-24 15:05:52,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a720b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:05:52, skipping insertion in model container [2020-10-24 15:05:52,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:05:51" (2/3) ... [2020-10-24 15:05:52,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@518a720b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:05:52, skipping insertion in model container [2020-10-24 15:05:52,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:05:52" (3/3) ... [2020-10-24 15:05:52,272 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1230.c [2020-10-24 15:05:52,285 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:05:52,291 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 15:05:52,306 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 15:05:52,364 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:05:52,364 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:05:52,364 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:05:52,364 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:05:52,365 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:05:52,365 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:05:52,366 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:05:52,366 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:05:52,380 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-24 15:05:52,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 15:05:52,386 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:52,387 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:52,388 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-10-24 15:05:52,410 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:05:52,410 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281704518] [2020-10-24 15:05:52,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 15:05:54,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:54,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 15:05:54,429 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:05:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:54,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:05:54,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:54,453 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281704518] [2020-10-24 15:05:54,453 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:54,454 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 15:05:54,455 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171960176] [2020-10-24 15:05:54,459 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:05:54,460 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:05:54,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:05:54,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:05:54,477 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-10-24 15:05:54,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:54,499 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-10-24 15:05:54,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:05:54,500 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 15:05:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:54,517 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:05:54,518 INFO L226 Difference]: Without dead ends: 25 [2020-10-24 15:05:54,522 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:05:54,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-24 15:05:54,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-24 15:05:54,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:05:54,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-10-24 15:05:54,571 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-10-24 15:05:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:54,572 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-10-24 15:05:54,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:05:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-10-24 15:05:54,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 15:05:54,574 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:54,574 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:54,789 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 15:05:54,790 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:54,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:54,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-10-24 15:05:54,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:05:54,794 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889000838] [2020-10-24 15:05:54,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 15:05:56,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:56,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:05:56,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:05:56,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:56,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:05:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:05:56,760 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889000838] [2020-10-24 15:05:56,760 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:05:56,760 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:05:56,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353883962] [2020-10-24 15:05:56,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:05:56,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:05:56,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:05:56,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:05:56,764 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 6 states. [2020-10-24 15:05:56,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:05:56,898 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-10-24 15:05:56,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:05:56,899 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-24 15:05:56,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:05:56,900 INFO L225 Difference]: With dead ends: 52 [2020-10-24 15:05:56,900 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 15:05:56,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:05:56,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 15:05:56,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-10-24 15:05:56,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:05:56,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:05:56,919 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-10-24 15:05:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:05:56,920 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:05:56,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:05:56,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:05:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:05:56,924 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:05:56,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:05:57,139 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 15:05:57,141 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:05:57,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:05:57,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-10-24 15:05:57,144 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:05:57,145 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205261952] [2020-10-24 15:05:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 15:05:58,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:05:59,209 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:05:59,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:05,498 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:06:07,811 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmin_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmin_double_#res|))) (= (_ +zero 11 53) .cse1)))) is different from false [2020-10-24 15:06:07,841 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:06:11,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:06:11,833 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:20,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:06:20,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205261952] [2020-10-24 15:06:20,605 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:20,605 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-10-24 15:06:20,605 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895301568] [2020-10-24 15:06:20,606 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 15:06:20,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:20,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 15:06:20,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=5, NotChecked=16, Total=110 [2020-10-24 15:06:20,610 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 11 states. [2020-10-24 15:06:22,877 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y))) (= (_ +zero 11 53) .cse1)))) (= roundNearestTiesToEven c_~CRM) (not (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)))) (fp.eq .cse2 .cse2)))) is different from false [2020-10-24 15:06:25,105 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_6|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_6|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_6|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y))) (= (_ +zero 11 53) .cse1)))) (not (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)))) (fp.eq .cse2 .cse2)))) is different from false [2020-10-24 15:06:42,006 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2020-10-24 15:06:42,384 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-10-24 15:06:42,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:42,614 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2020-10-24 15:06:42,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:06:42,614 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-10-24 15:06:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:42,615 INFO L225 Difference]: With dead ends: 32 [2020-10-24 15:06:42,615 INFO L226 Difference]: Without dead ends: 27 [2020-10-24 15:06:42,617 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=40, Invalid=97, Unknown=7, NotChecked=66, Total=210 [2020-10-24 15:06:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-24 15:06:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-10-24 15:06:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:06:42,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2020-10-24 15:06:42,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 14 [2020-10-24 15:06:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:42,624 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2020-10-24 15:06:42,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 15:06:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2020-10-24 15:06:42,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:06:42,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:42,626 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:42,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 15:06:42,834 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:42,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:42,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2020-10-24 15:06:42,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:42,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175667280] [2020-10-24 15:06:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-24 15:06:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:44,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:06:44,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:44,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:06:44,988 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:45,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:06:45,291 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175667280] [2020-10-24 15:06:45,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:45,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:06:45,292 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41427497] [2020-10-24 15:06:45,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:06:45,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:06:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:06:45,294 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand 6 states. [2020-10-24 15:06:45,866 WARN L193 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 15:06:46,204 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2020-10-24 15:06:46,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:46,400 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2020-10-24 15:06:46,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:06:46,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-24 15:06:46,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:46,403 INFO L225 Difference]: With dead ends: 52 [2020-10-24 15:06:46,403 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 15:06:46,403 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:06:46,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 15:06:46,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-10-24 15:06:46,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:46,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2020-10-24 15:06:46,411 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 16 [2020-10-24 15:06:46,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:46,411 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2020-10-24 15:06:46,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:06:46,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2020-10-24 15:06:46,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:06:46,412 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:46,413 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:46,614 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 15:06:46,614 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:46,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:46,615 INFO L82 PathProgramCache]: Analyzing trace with hash -414100239, now seen corresponding path program 1 times [2020-10-24 15:06:46,616 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:46,617 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [535726522] [2020-10-24 15:06:46,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-24 15:06:48,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:48,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:06:48,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:54,646 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:07:07,751 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:07:09,979 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse1 (_ +zero 11 53)) (= .cse0 (_ +zero 11 53))))) is different from false [2020-10-24 15:07:10,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:07:10,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:07:13,908 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 15:07:17,379 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 15:07:22,195 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 15:07:22,206 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:07:24,747 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse0 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse1 .cse0))) (not (= .cse1 (_ +zero 11 53))) (not (= ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8) (_ bv0 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_8 (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (or (not (= .cse2 (_ +zero 11 53))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_8) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_8)) (fp.div c_~CRM .cse3 .cse2))) (not (= (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_8))) (not (= .cse3 (_ +zero 11 53))))))) is different from true [2020-10-24 15:07:24,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:07:24,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [535726522] [2020-10-24 15:07:24,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:07:24,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-10-24 15:07:24,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036839382] [2020-10-24 15:07:24,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:07:24,750 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:07:24,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:07:24,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=39, Unknown=7, NotChecked=26, Total=90 [2020-10-24 15:07:24,752 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 10 states. [2020-10-24 15:07:37,208 WARN L193 SmtUtils]: Spent 7.71 s on a formula simplification that was a NOOP. DAG size: 38 [2020-10-24 15:07:39,684 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmin_double_~y))) (and (= roundNearestTiesToEven c_~CRM) (not (= (_ bv0 32) .cse0)) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)) (fp.div roundNearestTiesToEven .cse1 .cse2)) (= .cse2 (_ +zero 11 53)) (= .cse1 (_ +zero 11 53))))) (not (= (bvadd .cse0 (_ bv2147483648 32)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= .cse4 (_ +zero 11 53)) (= .cse3 (_ +zero 11 53))))))) is different from false [2020-10-24 15:08:00,454 WARN L193 SmtUtils]: Spent 8.63 s on a formula simplification. DAG size of input: 32 DAG size of output: 23 [2020-10-24 15:08:13,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmin_double_~y))) (and (not (= (bvadd c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32)) (_ bv0 32))) (not (= (_ bv0 32) .cse0)) (not (= (_ bv0 32) c_ULTIMATE.start___fpclassify_double_~msw~0)) (not (= (bvadd .cse0 (_ bv2147483648 32)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse1 .cse2)) (= .cse2 (_ +zero 11 53)) (= .cse1 (_ +zero 11 53))))))) is different from false [2020-10-24 15:08:21,361 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmin_double_~y))) (and (not (= (_ bv0 32) .cse0)) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)) (fp.div roundNearestTiesToEven .cse1 .cse2)) (= .cse2 (_ +zero 11 53)) (= .cse1 (_ +zero 11 53))))) (not (= (bvadd .cse0 (_ bv2147483648 32)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_8| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_8| (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_8|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_8|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_8|)))) (and (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= .cse4 (_ +zero 11 53)) (= .cse3 (_ +zero 11 53))))))) is different from false [2020-10-24 15:08:55,599 WARN L193 SmtUtils]: Spent 8.50 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-10-24 15:09:02,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:09:02,716 INFO L93 Difference]: Finished difference Result 53 states and 65 transitions. [2020-10-24 15:09:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 15:09:02,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2020-10-24 15:09:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:09:02,718 INFO L225 Difference]: With dead ends: 53 [2020-10-24 15:09:02,719 INFO L226 Difference]: Without dead ends: 44 [2020-10-24 15:09:02,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 106.7s TimeCoverageRelationStatistics Valid=34, Invalid=78, Unknown=18, NotChecked=110, Total=240 [2020-10-24 15:09:02,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-24 15:09:02,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2020-10-24 15:09:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 15:09:02,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2020-10-24 15:09:02,727 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 18 [2020-10-24 15:09:02,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:09:02,728 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2020-10-24 15:09:02,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:09:02,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2020-10-24 15:09:02,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 15:09:02,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:09:02,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:09:02,938 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:09:02,939 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:09:02,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:09:02,940 INFO L82 PathProgramCache]: Analyzing trace with hash 581239298, now seen corresponding path program 1 times [2020-10-24 15:09:02,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:09:02,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1428681102] [2020-10-24 15:09:02,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-24 15:09:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:09:05,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:09:05,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:09:11,256 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:09:13,516 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x))) (= (_ +zero 11 53) .cse1)))) is different from false [2020-10-24 15:09:15,791 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x))) (= (_ +zero 11 53) .cse1) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) is different from false [2020-10-24 15:09:15,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:09:15,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:09:18,591 WARN L193 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 15:09:21,368 WARN L193 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:09:24,180 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:09:24,186 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:09:26,911 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse1 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse0 (_ +zero 11 53))) (not (bvuge .cse1 (_ bv1048576 32))) (not (= (fp.div c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse1 (_ bv2146435071 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse3 (_ +zero 11 53))) (not (bvule .cse4 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv2148532224 32))))))) is different from true [2020-10-24 15:09:26,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:09:26,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1428681102] [2020-10-24 15:09:26,914 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:09:26,914 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-10-24 15:09:26,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156738967] [2020-10-24 15:09:26,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:09:26,915 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:09:26,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:09:26,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=31, Unknown=5, NotChecked=36, Total=90 [2020-10-24 15:09:26,916 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand 10 states. [2020-10-24 15:09:29,598 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse1 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse0 (_ +zero 11 53))) (not (bvuge .cse1 (_ bv1048576 32))) (not (= (fp.div c_~CRM .cse0 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse1 (_ bv2146435071 32)))))) (forall ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64)) (v_ULTIMATE.start_fmin_double_~y_9 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|))) (.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_9))) (or (not (= .cse3 (_ +zero 11 53))) (not (bvule .cse4 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse5) (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_9) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_9)))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv2148532224 32))))))) is different from true [2020-10-24 15:09:37,998 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv1048576 32))) (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)))) (exists ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= (_ +zero 11 53) .cse1)))) (or (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32))))) is different from false [2020-10-24 15:09:47,440 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start___fpclassify_double_~x))) (and (or (not (bvuge .cse0 (_ bv2148532224 32))) (not (bvule .cse0 (_ bv4293918719 32)))) (or (not (bvule .cse0 (_ bv2146435071 32))) (not (bvuge .cse0 (_ bv1048576 32)))) (exists ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse1 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x))) (= (_ +zero 11 53) .cse2)))) (exists ((|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse3 (_ +zero 11 53)) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= (_ +zero 11 53) .cse4)))))) is different from false [2020-10-24 15:09:51,317 WARN L838 $PredicateComparison]: unable to prove that (and (or (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv1048576 32))) (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)))) (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_10| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_10| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_10|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_10|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_10|)))) (and (= .cse0 (_ +zero 11 53)) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x))) (= (_ +zero 11 53) .cse1) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) (or (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32))))) is different from false [2020-10-24 15:09:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:09:52,243 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2020-10-24 15:09:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:09:52,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-10-24 15:09:52,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:09:52,250 INFO L225 Difference]: With dead ends: 63 [2020-10-24 15:09:52,250 INFO L226 Difference]: Without dead ends: 54 [2020-10-24 15:09:52,251 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 32.1s TimeCoverageRelationStatistics Valid=26, Invalid=35, Unknown=9, NotChecked=112, Total=182 [2020-10-24 15:09:52,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-10-24 15:09:52,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2020-10-24 15:09:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-24 15:09:52,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 47 transitions. [2020-10-24 15:09:52,275 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 47 transitions. Word has length 19 [2020-10-24 15:09:52,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:09:52,276 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 47 transitions. [2020-10-24 15:09:52,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:09:52,276 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2020-10-24 15:09:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 15:09:52,277 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:09:52,278 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:09:52,491 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:09:52,492 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:09:52,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:09:52,493 INFO L82 PathProgramCache]: Analyzing trace with hash -208376157, now seen corresponding path program 1 times [2020-10-24 15:09:52,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:09:52,495 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1035835339] [2020-10-24 15:09:52,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-24 15:09:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:09:54,512 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:09:54,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:09:56,853 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)))))) is different from false [2020-10-24 15:09:59,120 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x))) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) is different from false [2020-10-24 15:09:59,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:09:59,164 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:09:59,466 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 15:09:59,771 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 15:09:59,776 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:10:02,463 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_13)))) (not (= (_ +zero 11 53) .cse0)) (not (= ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13) (_ bv0 32))) (not (= (_ +zero 11 53) .cse1))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (or (not (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_13)))) (not (= (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13))) (not (= (_ +zero 11 53) .cse2)) (not (= (_ +zero 11 53) .cse3)))))) is different from true [2020-10-24 15:10:02,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:10:02,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1035835339] [2020-10-24 15:10:02,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:10:02,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 15:10:02,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402689942] [2020-10-24 15:10:02,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 15:10:02,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:10:02,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 15:10:02,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=16, Unknown=3, NotChecked=24, Total=56 [2020-10-24 15:10:02,468 INFO L87 Difference]: Start difference. First operand 38 states and 47 transitions. Second operand 8 states. [2020-10-24 15:10:05,000 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (or (not (= (fp.div c_~CRM .cse0 .cse1) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_13)))) (not (= (_ +zero 11 53) .cse0)) (not (= ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13) (_ bv0 32))) (not (= (_ +zero 11 53) .cse1))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (or (not (= (fp.div c_~CRM .cse2 .cse3) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_13) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_13)))) (not (= (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13))) (not (= (_ +zero 11 53) .cse2)) (not (= (_ +zero 11 53) .cse3))))) (= roundNearestTiesToEven c_~CRM)) is different from true [2020-10-24 15:10:07,209 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start___fpclassify_double_~x))) (and (not (= (bvadd .cse0 (_ bv2147483648 32)) (_ bv0 32))) (exists ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_9|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_9|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_9|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)))))) (not (= .cse0 (_ bv0 32))))) is different from false [2020-10-24 15:10:25,736 WARN L193 SmtUtils]: Spent 12.06 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-10-24 15:10:31,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:10:31,122 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2020-10-24 15:10:31,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:10:31,123 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-24 15:10:31,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:10:31,124 INFO L225 Difference]: With dead ends: 66 [2020-10-24 15:10:31,124 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 15:10:31,125 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=20, Invalid=23, Unknown=7, NotChecked=60, Total=110 [2020-10-24 15:10:31,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 15:10:31,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 38. [2020-10-24 15:10:31,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-24 15:10:31,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-10-24 15:10:31,143 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 19 [2020-10-24 15:10:31,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:10:31,144 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-10-24 15:10:31,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 15:10:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-10-24 15:10:31,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-24 15:10:31,146 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:10:31,146 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:10:31,356 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-24 15:10:31,357 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:10:31,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:10:31,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1204211229, now seen corresponding path program 1 times [2020-10-24 15:10:31,359 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:10:31,359 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [736676164] [2020-10-24 15:10:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-24 15:10:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:10:33,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:10:33,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:10:35,776 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)))))) is different from false [2020-10-24 15:10:38,040 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x)))))) is different from false [2020-10-24 15:10:38,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:10:38,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:10:38,563 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 15:10:39,129 WARN L193 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:10:39,134 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:10:41,395 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_15)) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|)))) (or (not (bvule .cse0 (_ bv2146435071 32))) (not (bvuge .cse0 (_ bv1048576 32))) (not (= (_ +zero 11 53) .cse1)) (not (= (fp.div c_~CRM .cse1 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_15)))) (not (= (_ +zero 11 53) .cse2))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_15))) (or (not (= (_ +zero 11 53) .cse3)) (not (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_15)))) (not (= (_ +zero 11 53) .cse4)) (not (bvuge .cse5 (_ bv2148532224 32))) (not (bvule .cse5 (_ bv4293918719 32))))))) is different from true [2020-10-24 15:10:41,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:10:41,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [736676164] [2020-10-24 15:10:41,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:10:41,398 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 15:10:41,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64098929] [2020-10-24 15:10:41,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 15:10:41,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:10:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 15:10:41,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=16, Unknown=3, NotChecked=24, Total=56 [2020-10-24 15:10:41,403 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 8 states. [2020-10-24 15:10:43,616 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_15)) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|)))) (or (not (bvule .cse0 (_ bv2146435071 32))) (not (bvuge .cse0 (_ bv1048576 32))) (not (= (_ +zero 11 53) .cse1)) (not (= (fp.div c_~CRM .cse1 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_15)))) (not (= (_ +zero 11 53) .cse2))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_15 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_15))) (or (not (= (_ +zero 11 53) .cse3)) (not (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_15) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_15)))) (not (= (_ +zero 11 53) .cse4)) (not (bvuge .cse5 (_ bv2148532224 32))) (not (bvule .cse5 (_ bv4293918719 32)))))) (= roundNearestTiesToEven c_~CRM)) is different from true [2020-10-24 15:10:45,826 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start___fpclassify_double_~x))) (and (or (not (bvuge .cse0 (_ bv2148532224 32))) (not (bvule .cse0 (_ bv4293918719 32)))) (or (not (bvule .cse0 (_ bv2146435071 32))) (not (bvuge .cse0 (_ bv1048576 32)))) (exists ((|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_11|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_11|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)))))))) is different from false [2020-10-24 15:11:02,916 WARN L193 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-10-24 15:11:10,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:10,926 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2020-10-24 15:11:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:11:10,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-24 15:11:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:10,929 INFO L225 Difference]: With dead ends: 60 [2020-10-24 15:11:10,929 INFO L226 Difference]: Without dead ends: 41 [2020-10-24 15:11:10,930 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 29.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=8, NotChecked=60, Total=110 [2020-10-24 15:11:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-24 15:11:10,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 32. [2020-10-24 15:11:10,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 15:11:10,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2020-10-24 15:11:10,944 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 20 [2020-10-24 15:11:10,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:10,944 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2020-10-24 15:11:10,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 15:11:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2020-10-24 15:11:10,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:11:10,948 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:10,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:11,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-24 15:11:11,163 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:11,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:11,164 INFO L82 PathProgramCache]: Analyzing trace with hash 2022079815, now seen corresponding path program 1 times [2020-10-24 15:11:11,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:11,165 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188507420] [2020-10-24 15:11:11,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:13,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:11:13,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:15,445 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmin_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmin_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmin_double_~y)) (fp.div roundNearestTiesToEven .cse0 .cse1))))) is different from false [2020-10-24 15:11:17,737 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) c_ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) c_ULTIMATE.start___fpclassify_double_~x)))))) is different from false [2020-10-24 15:11:20,038 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) ULTIMATE.start___fpclassify_double_~x) ((_ extract 62 52) ULTIMATE.start___fpclassify_double_~x) ((_ extract 51 0) ULTIMATE.start___fpclassify_double_~x)))))) is different from false [2020-10-24 15:11:20,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:20,092 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:20,566 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 15:11:21,099 WARN L193 SmtUtils]: Spent 361.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:11:21,645 WARN L193 SmtUtils]: Spent 349.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:11:21,654 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:11:23,944 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_fmin_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse2 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_12))) (or (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1)) (not (bvuge .cse2 (_ bv2148532224 32))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_12)) (fp.div c_~CRM .cse1 .cse0))) (not (bvule .cse2 (_ bv4293918719 32)))))) (forall ((v_ULTIMATE.start_fmin_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_12)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|)))) (or (not (= (_ +zero 11 53) .cse3)) (not (bvule .cse4 (_ bv2146435071 32))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv1048576 32))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_12)) (fp.div c_~CRM .cse5 .cse3))))))) is different from true [2020-10-24 15:11:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:23,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188507420] [2020-10-24 15:11:23,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:23,947 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-10-24 15:11:23,947 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129388629] [2020-10-24 15:11:23,948 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:11:23,948 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:23,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:11:23,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=4, NotChecked=44, Total=90 [2020-10-24 15:11:23,950 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand 10 states. [2020-10-24 15:11:26,844 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_fmin_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|))) (.cse2 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_12))) (or (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1)) (not (bvuge .cse2 (_ bv2148532224 32))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_12)) (fp.div c_~CRM .cse1 .cse0))) (not (bvule .cse2 (_ bv4293918719 32)))))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_fmin_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_14| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_14| (_ BitVec 64))) (let ((.cse4 ((_ extract 63 32) v_ULTIMATE.start_fmin_double_~y_12)) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_14|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_14|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_14|)))) (or (not (= (_ +zero 11 53) .cse3)) (not (bvule .cse4 (_ bv2146435071 32))) (not (= (_ +zero 11 53) .cse5)) (not (bvuge .cse4 (_ bv1048576 32))) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmin_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmin_double_~y_12)) (fp.div c_~CRM .cse5 .cse3))))))) is different from true [2020-10-24 15:11:44,434 WARN L193 SmtUtils]: Spent 8.76 s on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-24 15:12:24,616 WARN L193 SmtUtils]: Spent 22.04 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2020-10-24 15:12:34,385 WARN L193 SmtUtils]: Spent 655.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2020-10-24 15:12:46,510 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 15:12:46,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:12:46,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-24 15:12:46,713 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:226) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:153) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:899) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:773) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:345) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:388) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicateForConjunction(PredicateUnifier.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.getOrConstructPredicate(DeterministicInterpolantAutomaton.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.DeterministicInterpolantAutomaton.constructSuccessorsAndTransitions(DeterministicInterpolantAutomaton.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:78) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.BasicAbstractInterpolantAutomaton.computeSuccs(BasicAbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.internalSuccessors(AbstractInterpolantAutomaton.java:1) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.TotalizeNwa.internalSuccessors(TotalizeNwa.java:213) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ComplementDeterministicNwa.internalSuccessors(ComplementDeterministicNwa.java:121) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:216) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.ProductNwa.internalSuccessors(ProductNwa.java:208) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.addInternalsAndSuccessors(NestedWordAutomatonReachableStates.java:1064) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates$ReachableStatesComputation.(NestedWordAutomatonReachableStates.java:966) at de.uni_freiburg.informatik.ultimate.automata.nestedword.reachablestates.NestedWordAutomatonReachableStates.(NestedWordAutomatonReachableStates.java:187) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.computeDifference(Difference.java:137) at de.uni_freiburg.informatik.ultimate.automata.nestedword.operations.Difference.(Difference.java:90) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:743) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:674) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:473) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:341) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:134) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1461) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:654) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:206) ... 45 more [2020-10-24 15:12:46,721 INFO L168 Benchmark]: Toolchain (without parser) took 415718.78 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.8 MB in the beginning and 25.6 MB in the end (delta: -2.8 MB). Peak memory consumption was 11.0 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,722 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 37.7 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:12:46,722 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.40 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 22.2 MB in the end (delta: -22.7 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.12 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 20.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,724 INFO L168 Benchmark]: Boogie Preprocessor took 49.99 ms. Allocated memory is still 46.1 MB. Free memory was 20.3 MB in the beginning and 30.1 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,725 INFO L168 Benchmark]: RCFGBuilder took 745.88 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 20.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,726 INFO L168 Benchmark]: TraceAbstraction took 414456.45 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 25.6 MB in the end (delta: -5.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:12:46,737 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.15 ms. Allocated memory is still 37.7 MB. Free memory was 19.2 MB in the beginning and 19.2 MB in the end (delta: 42.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 393.40 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 22.2 MB in the end (delta: -22.7 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.12 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 20.3 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.99 ms. Allocated memory is still 46.1 MB. Free memory was 20.3 MB in the beginning and 30.1 MB in the end (delta: -9.8 MB). Peak memory consumption was 3.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 745.88 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 20.1 MB in the end (delta: 10.0 MB). Peak memory consumption was 11.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 414456.45 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 19.7 MB in the beginning and 25.6 MB in the end (delta: -5.9 MB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...