./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1250.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_1250.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 216b013ad4da4eb5e85a87de58b407e30252b4c5 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_1250.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 216b013ad4da4eb5e85a87de58b407e30252b4c5 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:06:02,311 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:06:02,317 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:06:02,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:06:02,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:06:02,367 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:06:02,369 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:06:02,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:06:02,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:06:02,376 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:06:02,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:06:02,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:06:02,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:06:02,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:06:02,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:06:02,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:06:02,387 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:06:02,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:06:02,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:06:02,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:06:02,396 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:06:02,398 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:06:02,400 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:06:02,401 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:06:02,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:06:02,405 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:06:02,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:06:02,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:06:02,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:06:02,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:06:02,410 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:06:02,411 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:06:02,412 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:06:02,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:06:02,415 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:06:02,415 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:06:02,416 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:06:02,417 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:06:02,417 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:06:02,418 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:06:02,420 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:06:02,422 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:06:02,450 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:06:02,450 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:06:02,452 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:06:02,452 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:06:02,453 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:06:02,453 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:06:02,454 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:06:02,454 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 15:06:02,454 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:06:02,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:06:02,455 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:06:02,455 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:06:02,456 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:06:02,456 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:06:02,456 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:06:02,457 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:06:02,457 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:06:02,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:06:02,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:06:02,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:06:02,458 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:06:02,458 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:06:02,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:06:02,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:06:02,459 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:06:02,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 15:06:02,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 15:06:02,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:06:02,461 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:06:02,461 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 -> 216b013ad4da4eb5e85a87de58b407e30252b4c5 [2020-10-24 15:06:02,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:06:02,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:06:02,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:06:02,936 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:06:02,937 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:06:02,938 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_1250.c [2020-10-24 15:06:03,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3c62af135/df080e1ef9cc435eb76291bc16aa8839/FLAGfd0c8729f [2020-10-24 15:06:03,685 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:06:03,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2020-10-24 15:06:03,696 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3c62af135/df080e1ef9cc435eb76291bc16aa8839/FLAGfd0c8729f [2020-10-24 15:06:04,029 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/3c62af135/df080e1ef9cc435eb76291bc16aa8839 [2020-10-24 15:06:04,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:06:04,040 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:06:04,042 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:06:04,042 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:06:04,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:06:04,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a93cbd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04, skipping insertion in model container [2020-10-24 15:06:04,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,065 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:06:04,086 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:06:04,403 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:06:04,420 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:06:04,475 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:06:04,502 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:06:04,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04 WrapperNode [2020-10-24 15:06:04,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:06:04,505 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:06:04,505 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:06:04,505 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:06:04,513 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:06:04" (1/1) ... [2020-10-24 15:06:04,523 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:06:04" (1/1) ... [2020-10-24 15:06:04,551 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:06:04,552 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:06:04,552 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:06:04,552 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:06:04,563 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,563 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,580 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,583 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (1/1) ... [2020-10-24 15:06:04,586 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:06:04,587 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:06:04,587 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:06:04,587 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:06:04,588 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (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:06:04,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 15:06:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:06:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-24 15:06:04,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:06:04,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:06:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 15:06:04,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:06:05,077 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:06:05,077 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-10-24 15:06:05,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:05 BoogieIcfgContainer [2020-10-24 15:06:05,079 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:06:05,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:06:05,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:06:05,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:06:05,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:06:04" (1/3) ... [2020-10-24 15:06:05,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc13479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:06:05, skipping insertion in model container [2020-10-24 15:06:05,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:04" (2/3) ... [2020-10-24 15:06:05,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bc13479 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:06:05, skipping insertion in model container [2020-10-24 15:06:05,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:05" (3/3) ... [2020-10-24 15:06:05,090 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2020-10-24 15:06:05,103 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:06:05,108 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 15:06:05,123 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 15:06:05,151 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:06:05,151 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:06:05,151 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:06:05,152 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:06:05,152 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:06:05,152 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:06:05,152 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:06:05,152 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:06:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-24 15:06:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 15:06:05,176 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:05,177 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:05,178 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:05,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:05,185 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-10-24 15:06:05,195 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:05,196 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656050111] [2020-10-24 15:06:05,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:05,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:05,348 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:05,349 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656050111] [2020-10-24 15:06:05,350 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:05,350 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-24 15:06:05,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346312154] [2020-10-24 15:06:05,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:06:05,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:06:05,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:06:05,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:06:05,376 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-10-24 15:06:05,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:05,398 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-10-24 15:06:05,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:06:05,400 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 15:06:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:05,411 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:06:05,411 INFO L226 Difference]: Without dead ends: 25 [2020-10-24 15:06:05,418 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:06:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-24 15:06:05,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-24 15:06:05,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:06:05,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-10-24 15:06:05,459 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-10-24 15:06:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:05,459 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-10-24 15:06:05,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:06:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-10-24 15:06:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 15:06:05,461 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:05,461 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:05,461 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 15:06:05,462 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:05,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-10-24 15:06:05,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:05,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88710966] [2020-10-24 15:06:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:05,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:05,591 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:05,592 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88710966] [2020-10-24 15:06:05,592 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:05,592 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:06:05,593 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756769243] [2020-10-24 15:06:05,594 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:06:05,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:06:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:06:05,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:06:05,597 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 4 states. [2020-10-24 15:06:05,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:05,681 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2020-10-24 15:06:05,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:06:05,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-24 15:06:05,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:05,683 INFO L225 Difference]: With dead ends: 41 [2020-10-24 15:06:05,683 INFO L226 Difference]: Without dead ends: 36 [2020-10-24 15:06:05,684 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:06:05,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-24 15:06:05,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2020-10-24 15:06:05,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:05,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:06:05,691 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-10-24 15:06:05,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:05,691 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:06:05,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:06:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:06:05,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-24 15:06:05,692 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:05,692 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:05,693 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 15:06:05,693 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:05,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:05,694 INFO L82 PathProgramCache]: Analyzing trace with hash 502183504, now seen corresponding path program 1 times [2020-10-24 15:06:05,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:05,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228490064] [2020-10-24 15:06:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:05,814 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:05,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228490064] [2020-10-24 15:06:05,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:05,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:06:05,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818448161] [2020-10-24 15:06:05,817 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:06:05,820 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:06:05,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:06:05,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:06:05,821 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:06:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:05,920 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-10-24 15:06:05,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:06:05,922 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-24 15:06:05,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:05,923 INFO L225 Difference]: With dead ends: 43 [2020-10-24 15:06:05,923 INFO L226 Difference]: Without dead ends: 38 [2020-10-24 15:06:05,926 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:06:05,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-24 15:06:05,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-10-24 15:06:05,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:05,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:06:05,936 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 12 [2020-10-24 15:06:05,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:05,937 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:06:05,937 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:06:05,937 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:06:05,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-24 15:06:05,939 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:05,939 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:05,939 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 15:06:05,940 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:05,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:05,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1951251627, now seen corresponding path program 1 times [2020-10-24 15:06:05,941 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:05,941 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192934003] [2020-10-24 15:06:05,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:06,028 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:06,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192934003] [2020-10-24 15:06:06,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:06,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:06:06,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970747748] [2020-10-24 15:06:06,030 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:06:06,030 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:06:06,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:06:06,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:06:06,031 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:06:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:06,083 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2020-10-24 15:06:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:06:06,084 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-24 15:06:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:06,085 INFO L225 Difference]: With dead ends: 45 [2020-10-24 15:06:06,085 INFO L226 Difference]: Without dead ends: 40 [2020-10-24 15:06:06,085 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:06:06,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-24 15:06:06,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2020-10-24 15:06:06,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:06,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:06:06,091 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 13 [2020-10-24 15:06:06,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:06,091 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:06:06,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:06:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:06:06,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:06:06,092 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:06,093 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:06,093 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 15:06:06,093 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:06,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:06,094 INFO L82 PathProgramCache]: Analyzing trace with hash -555778251, now seen corresponding path program 1 times [2020-10-24 15:06:06,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:06,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140421829] [2020-10-24 15:06:06,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:06,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:06,142 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:06,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140421829] [2020-10-24 15:06:06,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:06,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:06:06,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825776536] [2020-10-24 15:06:06,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:06:06,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:06:06,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:06:06,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:06:06,145 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2020-10-24 15:06:06,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:06,197 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-10-24 15:06:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:06:06,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-24 15:06:06,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:06,199 INFO L225 Difference]: With dead ends: 43 [2020-10-24 15:06:06,199 INFO L226 Difference]: Without dead ends: 38 [2020-10-24 15:06:06,200 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:06:06,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-24 15:06:06,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-10-24 15:06:06,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:06:06,206 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 14 [2020-10-24 15:06:06,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:06,207 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:06:06,207 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:06:06,207 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:06:06,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:06:06,208 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:06,211 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:06,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 15:06:06,212 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:06,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-10-24 15:06:06,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:06:06,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523243932] [2020-10-24 15:06:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:06:06,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:06:06,285 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:06:06,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:06:06,311 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:06:06,347 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 15:06:06,347 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 15:06:06,348 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 15:06:06,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:06:06 BoogieIcfgContainer [2020-10-24 15:06:06,383 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:06:06,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:06:06,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:06:06,384 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:06:06,384 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:05" (3/4) ... [2020-10-24 15:06:06,388 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 15:06:06,388 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:06:06,391 INFO L168 Benchmark]: Toolchain (without parser) took 2355.58 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 25.3 MB in the beginning and 34.7 MB in the end (delta: -9.4 MB). Peak memory consumption was 4.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,392 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:06:06,393 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.84 ms. Allocated memory is still 48.2 MB. Free memory was 24.7 MB in the beginning and 25.6 MB in the end (delta: -880.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,394 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.72 ms. Allocated memory is still 48.2 MB. Free memory was 25.6 MB in the beginning and 23.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,395 INFO L168 Benchmark]: Boogie Preprocessor took 34.09 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,395 INFO L168 Benchmark]: RCFGBuilder took 492.31 ms. Allocated memory is still 48.2 MB. Free memory was 22.3 MB in the beginning and 27.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,397 INFO L168 Benchmark]: TraceAbstraction took 1301.76 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 26.6 MB in the beginning and 35.1 MB in the end (delta: -8.4 MB). Peak memory consumption was 1.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,402 INFO L168 Benchmark]: Witness Printer took 5.17 ms. Allocated memory is still 58.7 MB. Free memory was 35.1 MB in the beginning and 34.7 MB in the end (delta: 361.4 kB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:06:06,412 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.25 ms. Allocated memory is still 39.8 MB. Free memory was 17.8 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 461.84 ms. Allocated memory is still 48.2 MB. Free memory was 24.7 MB in the beginning and 25.6 MB in the end (delta: -880.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.72 ms. Allocated memory is still 48.2 MB. Free memory was 25.6 MB in the beginning and 23.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.09 ms. Allocated memory is still 48.2 MB. Free memory was 23.8 MB in the beginning and 22.3 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 492.31 ms. Allocated memory is still 48.2 MB. Free memory was 22.3 MB in the beginning and 27.0 MB in the end (delta: -4.7 MB). Peak memory consumption was 5.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1301.76 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 26.6 MB in the beginning and 35.1 MB in the end (delta: -8.4 MB). Peak memory consumption was 1.2 MB. Max. memory is 16.1 GB. * Witness Printer took 5.17 ms. Allocated memory is still 58.7 MB. Free memory was 35.1 MB in the beginning and 34.7 MB in the end (delta: 361.4 kB). Peak memory consumption was 2.1 MB. 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 69, overapproximation of someBinaryDOUBLE_SMTComparisonOperation at line 18. Possible FailurePath: [L69] double x = 0.0 / 0.0; [L70] double y = 0.0 / 0.0; [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; [L71] double res = fmax_double(x, y); [L18] return x != x; [L73] COND TRUE !isnan_double(res) [L3] __assert_fail("0", "double_req_bl_1250.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.2s, 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.2s 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:06:09,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:06:09,093 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:06:09,153 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:06:09,154 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:06:09,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:06:09,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:06:09,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:06:09,173 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:06:09,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:06:09,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:06:09,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:06:09,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:06:09,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:06:09,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:06:09,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:06:09,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:06:09,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:06:09,202 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:06:09,210 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:06:09,214 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:06:09,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:06:09,218 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:06:09,221 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:06:09,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:06:09,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:06:09,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:06:09,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:06:09,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:06:09,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:06:09,236 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:06:09,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:06:09,239 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:06:09,240 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:06:09,242 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:06:09,242 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:06:09,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:06:09,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:06:09,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:06:09,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:06:09,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:06:09,259 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:06:09,315 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:06:09,316 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:06:09,320 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:06:09,321 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:06:09,321 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:06:09,321 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:06:09,322 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:06:09,322 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:06:09,322 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:06:09,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:06:09,324 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:06:09,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:06:09,325 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 15:06:09,325 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 15:06:09,325 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:06:09,325 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:06:09,326 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:06:09,326 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:06:09,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:06:09,327 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:06:09,327 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:06:09,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:06:09,328 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:06:09,328 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:06:09,328 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:06:09,328 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:06:09,329 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 15:06:09,329 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 15:06:09,329 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:06:09,329 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:06:09,330 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 15:06:09,330 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 -> 216b013ad4da4eb5e85a87de58b407e30252b4c5 [2020-10-24 15:06:09,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:06:09,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:06:09,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:06:09,783 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:06:09,784 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:06:09,785 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_1250.c [2020-10-24 15:06:09,866 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76052d01a/9b7293c5a2a74523be7f6093b94056ff/FLAGdec127cf9 [2020-10-24 15:06:10,414 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:06:10,415 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1250.c [2020-10-24 15:06:10,423 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76052d01a/9b7293c5a2a74523be7f6093b94056ff/FLAGdec127cf9 [2020-10-24 15:06:10,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/76052d01a/9b7293c5a2a74523be7f6093b94056ff [2020-10-24 15:06:10,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:06:10,785 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:06:10,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:06:10,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:06:10,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:06:10,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:06:10" (1/1) ... [2020-10-24 15:06:10,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3487d8a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:10, skipping insertion in model container [2020-10-24 15:06:10,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:06:10" (1/1) ... [2020-10-24 15:06:10,811 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:06:10,829 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:06:11,056 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:06:11,073 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:06:11,103 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:06:11,139 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:06:11,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11 WrapperNode [2020-10-24 15:06:11,140 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:06:11,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:06:11,142 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:06:11,144 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:06:11,153 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:06:11" (1/1) ... [2020-10-24 15:06:11,181 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:06:11" (1/1) ... [2020-10-24 15:06:11,233 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:06:11,234 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:06:11,234 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:06:11,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:06:11,245 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,245 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,268 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,288 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,315 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (1/1) ... [2020-10-24 15:06:11,319 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:06:11,321 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:06:11,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:06:11,321 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:06:11,322 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (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:06:11,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_DOUBLE [2020-10-24 15:06:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-10-24 15:06:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 15:06:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:06:11,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-24 15:06:11,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:06:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:06:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:06:12,108 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:06:12,109 INFO L298 CfgBuilder]: Removed 18 assume(true) statements. [2020-10-24 15:06:12,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:12 BoogieIcfgContainer [2020-10-24 15:06:12,112 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:06:12,114 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:06:12,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:06:12,119 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:06:12,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:06:10" (1/3) ... [2020-10-24 15:06:12,121 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500d89bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:06:12, skipping insertion in model container [2020-10-24 15:06:12,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:06:11" (2/3) ... [2020-10-24 15:06:12,122 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@500d89bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:06:12, skipping insertion in model container [2020-10-24 15:06:12,122 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:12" (3/3) ... [2020-10-24 15:06:12,124 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1250.c [2020-10-24 15:06:12,144 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:06:12,151 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 15:06:12,166 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 15:06:12,212 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:06:12,212 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:06:12,213 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:06:12,213 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:06:12,213 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:06:12,213 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:06:12,213 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:06:12,213 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:06:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-10-24 15:06:12,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-24 15:06:12,236 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:12,237 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:12,237 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:12,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:12,244 INFO L82 PathProgramCache]: Analyzing trace with hash -958093107, now seen corresponding path program 1 times [2020-10-24 15:06:12,259 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:12,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420457686] [2020-10-24 15:06:12,260 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:06:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:14,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 15:06:14,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:14,161 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:14,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:14,166 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:14,168 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420457686] [2020-10-24 15:06:14,168 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:14,169 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 15:06:14,170 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175440770] [2020-10-24 15:06:14,175 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:06:14,175 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:14,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:06:14,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:06:14,193 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-10-24 15:06:14,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:14,214 INFO L93 Difference]: Finished difference Result 55 states and 85 transitions. [2020-10-24 15:06:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:06:14,216 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-24 15:06:14,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:14,228 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:06:14,228 INFO L226 Difference]: Without dead ends: 25 [2020-10-24 15:06:14,231 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:06:14,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-10-24 15:06:14,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-10-24 15:06:14,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:06:14,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 35 transitions. [2020-10-24 15:06:14,271 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 35 transitions. Word has length 10 [2020-10-24 15:06:14,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:14,272 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 35 transitions. [2020-10-24 15:06:14,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:06:14,272 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 35 transitions. [2020-10-24 15:06:14,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-24 15:06:14,273 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:14,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:14,486 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 15:06:14,487 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:14,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1001566992, now seen corresponding path program 1 times [2020-10-24 15:06:14,491 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:14,491 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [790897317] [2020-10-24 15:06:14,492 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:06:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:16,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:06:16,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:16,315 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:16,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:16,336 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:16,337 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [790897317] [2020-10-24 15:06:16,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:16,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:06:16,337 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89192401] [2020-10-24 15:06:16,339 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:06:16,339 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:16,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:06:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:06:16,341 INFO L87 Difference]: Start difference. First operand 25 states and 35 transitions. Second operand 6 states. [2020-10-24 15:06:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:16,465 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2020-10-24 15:06:16,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:06:16,466 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-24 15:06:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:16,467 INFO L225 Difference]: With dead ends: 52 [2020-10-24 15:06:16,467 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 15:06:16,468 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:06:16,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 15:06:16,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-10-24 15:06:16,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-10-24 15:06:16,476 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 11 [2020-10-24 15:06:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:16,477 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-10-24 15:06:16,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:06:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2020-10-24 15:06:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-24 15:06:16,478 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:16,478 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:06:16,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 15:06:16,690 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:16,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:16,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1219229111, now seen corresponding path program 1 times [2020-10-24 15:06:16,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:16,693 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833275482] [2020-10-24 15:06:16,693 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:06:18,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:18,520 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:06:18,523 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:23,986 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:06:26,231 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 (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse0 .cse1)) (= .cse0 (_ +zero 11 53)) (= (_ +zero 11 53) .cse1)))) is different from false [2020-10-24 15:06:26,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:06:30,802 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:30,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:39,462 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:39,462 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833275482] [2020-10-24 15:06:39,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:39,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2020-10-24 15:06:39,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000191818] [2020-10-24 15:06:39,464 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 15:06:39,464 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:39,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 15:06:39,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=65, Unknown=6, NotChecked=16, Total=110 [2020-10-24 15:06:39,466 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 11 states. [2020-10-24 15:06:41,724 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_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y))) (= (_ +zero 11 53) .cse1)))) (= roundNearestTiesToEven c_~CRM) (not (let ((.cse2 (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))) (fp.eq .cse2 .cse2)))) is different from false [2020-10-24 15:06:48,559 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_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y))) (= (_ +zero 11 53) .cse1)))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_6| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_6| (_ BitVec 64))) (let ((.cse2 (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|))) (.cse3 (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 (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse2 .cse3)) (= .cse2 (_ +zero 11 53)) (= (_ +zero 11 53) .cse3)))) (not (let ((.cse4 (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))) (fp.eq .cse4 .cse4))) (not (let ((.cse5 (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)))) (fp.eq .cse5 .cse5)))) is different from false [2020-10-24 15:06:48,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:48,936 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2020-10-24 15:06:48,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:06:48,938 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2020-10-24 15:06:48,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:48,940 INFO L225 Difference]: With dead ends: 36 [2020-10-24 15:06:48,940 INFO L226 Difference]: Without dead ends: 27 [2020-10-24 15:06:48,941 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 29.8s TimeCoverageRelationStatistics Valid=33, Invalid=81, Unknown=8, NotChecked=60, Total=182 [2020-10-24 15:06:48,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-24 15:06:48,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-10-24 15:06:48,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:06:48,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2020-10-24 15:06:48,947 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 14 [2020-10-24 15:06:48,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:48,948 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2020-10-24 15:06:48,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 15:06:48,948 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2020-10-24 15:06:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:06:48,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:48,949 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:49,162 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 15:06:49,163 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:49,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:49,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1012428811, now seen corresponding path program 1 times [2020-10-24 15:06:49,165 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:49,166 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190108296] [2020-10-24 15:06:49,166 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:50,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:51,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:06:51,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:51,180 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:51,181 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:51,347 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:51,347 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190108296] [2020-10-24 15:06:51,348 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:06:51,348 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:06:51,348 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432039377] [2020-10-24 15:06:51,349 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:06:51,349 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:06:51,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:06:51,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:06:51,350 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand 6 states. [2020-10-24 15:06:51,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:06:51,959 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-10-24 15:06:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:06:51,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-24 15:06:51,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:06:51,964 INFO L225 Difference]: With dead ends: 52 [2020-10-24 15:06:51,964 INFO L226 Difference]: Without dead ends: 47 [2020-10-24 15:06:51,965 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:06:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-24 15:06:51,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2020-10-24 15:06:51,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:06:51,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2020-10-24 15:06:51,971 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 16 [2020-10-24 15:06:51,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:06:51,972 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2020-10-24 15:06:51,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:06:51,972 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2020-10-24 15:06:51,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:06:51,973 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:06:51,973 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:52,180 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 15:06:52,181 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:06:52,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:06:52,182 INFO L82 PathProgramCache]: Analyzing trace with hash -356841937, now seen corresponding path program 1 times [2020-10-24 15:06:52,183 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:06:52,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [737083281] [2020-10-24 15:06:52,183 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:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:06:54,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:06:54,163 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:06:56,412 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (and (= (_ +zero 11 53) .cse0) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (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))) (= .cse1 (_ +zero 11 53))))) is different from false [2020-10-24 15:06:58,639 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (and (= (_ +zero 11 53) .cse0) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (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))) (= .cse1 (_ +zero 11 53)) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) is different from false [2020-10-24 15:06:58,674 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:58,675 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:06:58,968 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:07:01,694 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_9)) (fp.div c_~CRM .cse1 .cse0))) (not (= .cse1 (_ +zero 11 53))) (not (= (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_9)))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (_ bv0 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_9))) (not (= (_ +zero 11 53) .cse2)) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_9)) (fp.div c_~CRM .cse3 .cse2))) (not (= .cse3 (_ +zero 11 53))))))) is different from true [2020-10-24 15:07:01,696 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:01,696 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [737083281] [2020-10-24 15:07:01,697 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:07:01,697 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 15:07:01,697 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430536950] [2020-10-24 15:07:01,698 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 15:07:01,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:07:01,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 15:07:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=16, Unknown=3, NotChecked=24, Total=56 [2020-10-24 15:07:01,703 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand 8 states. [2020-10-24 15:07:04,171 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (_ +zero 11 53) .cse0)) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_9)) (fp.div c_~CRM .cse1 .cse0))) (not (= .cse1 (_ +zero 11 53))) (not (= (_ bv2147483648 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_9)))))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start___fpclassify_double_~x_9 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (or (not (= (_ bv0 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_9))) (not (= (_ +zero 11 53) .cse2)) (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_9) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_9)) (fp.div c_~CRM .cse3 .cse2))) (not (= .cse3 (_ +zero 11 53))))))) is different from true [2020-10-24 15:07:06,375 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ extract 63 32) c_ULTIMATE.start___fpclassify_double_~x))) (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (and (= (_ +zero 11 53) .cse0) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (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))) (= .cse1 (_ +zero 11 53))))) (not (= (bvadd .cse2 (_ bv2147483648 32)) (_ bv0 32))) (not (= .cse2 (_ bv0 32))))) is different from false [2020-10-24 15:07:08,589 WARN L838 $PredicateComparison]: unable to prove that (and (not (= (bvadd c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32)) (_ bv0 32))) (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_7| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_7| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_7|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_7|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_7|)))) (and (= (_ +zero 11 53) .cse0) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (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))) (= .cse1 (_ +zero 11 53)) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) (not (= (_ bv0 32) c_ULTIMATE.start___fpclassify_double_~msw~0))) is different from false [2020-10-24 15:07:08,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:07:08,929 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2020-10-24 15:07:08,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:07:08,930 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-10-24 15:07:08,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:07:08,930 INFO L225 Difference]: With dead ends: 57 [2020-10-24 15:07:08,930 INFO L226 Difference]: Without dead ends: 38 [2020-10-24 15:07:08,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=19, Invalid=19, Unknown=6, NotChecked=66, Total=110 [2020-10-24 15:07:08,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-24 15:07:08,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 27. [2020-10-24 15:07:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:07:08,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2020-10-24 15:07:08,948 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 18 [2020-10-24 15:07:08,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:07:08,948 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-24 15:07:08,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 15:07:08,949 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2020-10-24 15:07:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 15:07:08,949 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:07:08,950 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:07:09,164 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:07:09,165 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:07:09,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:07:09,166 INFO L82 PathProgramCache]: Analyzing trace with hash -388965649, now seen corresponding path program 1 times [2020-10-24 15:07:09,167 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:07:09,168 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [263165755] [2020-10-24 15:07:09,168 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:07:10,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:07:11,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:07:11,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:07:17,242 WARN L193 SmtUtils]: Spent 2.17 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:07:19,459 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:07:19,527 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:19,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:07:21,988 WARN L193 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 15:07:23,738 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:07:23,746 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:07:26,138 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_11 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_11)) (.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 ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_11)) (fp.div c_~CRM .cse0 .cse1))) (not (bvuge .cse2 (_ bv1048576 32))) (not (bvule .cse2 (_ bv2146435071 32))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1))))) (forall ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_11 (_ BitVec 64))) (let ((.cse3 (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|))) (.cse4 (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|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_11))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_11)) (fp.div c_~CRM .cse3 .cse4))) (not (= (_ +zero 11 53) .cse3)) (not (bvuge .cse5 (_ bv2148532224 32))) (not (= (_ +zero 11 53) .cse4)) (not (bvule .cse5 (_ bv4293918719 32))))))) is different from true [2020-10-24 15:07:26,141 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:26,141 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [263165755] [2020-10-24 15:07:26,142 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:07:26,142 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 15:07:26,142 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643202120] [2020-10-24 15:07:26,144 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 15:07:26,144 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:07:26,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 15:07:26,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=20, Unknown=4, NotChecked=18, Total=56 [2020-10-24 15:07:26,146 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand 8 states. [2020-10-24 15:07:28,738 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_11 (_ BitVec 64))) (let ((.cse2 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_11)) (.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 ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_11)) (fp.div c_~CRM .cse0 .cse1))) (not (bvuge .cse2 (_ bv1048576 32))) (not (bvule .cse2 (_ bv2146435071 32))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1))))) (forall ((|v_ULTIMATE.start_main_#t~nondet15_9| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_9| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_11 (_ BitVec 64))) (let ((.cse3 (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|))) (.cse4 (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|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_11))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_11) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_11)) (fp.div c_~CRM .cse3 .cse4))) (not (= (_ +zero 11 53) .cse3)) (not (bvuge .cse5 (_ bv2148532224 32))) (not (= (_ +zero 11 53) .cse4)) (not (bvule .cse5 (_ bv4293918719 32))))))) is different from true [2020-10-24 15:07:32,500 WARN L838 $PredicateComparison]: unable to prove that (and (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)))) (or (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv1048576 32))) (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)))) (or (not (bvule c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (not (bvuge c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)))) (exists ((|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|)))) (and (= (_ +zero 11 53) .cse2) (= (_ +zero 11 53) .cse3) (= (fp.div roundNearestTiesToEven .cse2 .cse3) (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:07:51,807 WARN L193 SmtUtils]: Spent 9.62 s on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2020-10-24 15:07:57,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:07:57,111 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-10-24 15:07:57,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 15:07:57,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-24 15:07:57,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:07:57,119 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:07:57,119 INFO L226 Difference]: Without dead ends: 36 [2020-10-24 15:07:57,120 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 39.5s TimeCoverageRelationStatistics Valid=21, Invalid=31, Unknown=6, NotChecked=52, Total=110 [2020-10-24 15:07:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-10-24 15:07:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2020-10-24 15:07:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:07:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-10-24 15:07:57,128 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 19 [2020-10-24 15:07:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:07:57,128 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-10-24 15:07:57,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 15:07:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-10-24 15:07:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-24 15:07:57,129 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:07:57,129 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:07:57,346 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:07:57,347 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:07:57,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:07:57,348 INFO L82 PathProgramCache]: Analyzing trace with hash 382373450, now seen corresponding path program 1 times [2020-10-24 15:07:57,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:07:57,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191064631] [2020-10-24 15:07:57,350 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:07:59,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:07:59,177 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:07:59,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:08:05,474 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:08:18,906 WARN L193 SmtUtils]: Spent 2.23 s on a formula simplification that was a NOOP. DAG size: 26 [2020-10-24 15:08:18,952 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:08:18,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:08:23,594 WARN L193 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2020-10-24 15:08:27,264 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2020-10-24 15:08:27,270 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:08:29,854 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ 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|)))) (or (not (bvule ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13) (_ bv1048575 32))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1)) (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))))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ 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|))) (.cse2 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13))) (or (not (bvule .cse2 (_ bv2148532223 32))) (not (= (_ +zero 11 53) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= (fp.div c_~CRM .cse3 .cse4) (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 (bvuge .cse2 (_ bv2147483648 32))))))) is different from true [2020-10-24 15:08:29,856 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:08:29,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191064631] [2020-10-24 15:08:29,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:08:29,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-24 15:08:29,858 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307630743] [2020-10-24 15:08:29,859 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 15:08:29,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:08:29,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 15:08:29,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=25, Unknown=6, NotChecked=10, Total=56 [2020-10-24 15:08:29,865 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 8 states. [2020-10-24 15:08:32,313 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ 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|)))) (or (not (bvule ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13) (_ bv1048575 32))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ +zero 11 53) .cse1)) (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))))))) (forall ((v_ULTIMATE.start___fpclassify_double_~x_13 (_ 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|))) (.cse2 ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_13))) (or (not (bvule .cse2 (_ bv2148532223 32))) (not (= (_ +zero 11 53) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (= (fp.div c_~CRM .cse3 .cse4) (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 (bvuge .cse2 (_ bv2147483648 32))))))) is different from true [2020-10-24 15:08:37,367 WARN L838 $PredicateComparison]: unable to prove that (and (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)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet15_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_11| (_ BitVec 64))) (let ((.cse2 (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|))) (.cse3 (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) .cse2) (= (_ +zero 11 53) .cse3) (= (fp.div roundNearestTiesToEven .cse2 .cse3) (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:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:09:09,402 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2020-10-24 15:09:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-24 15:09:09,612 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2020-10-24 15:09:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:09:09,612 INFO L225 Difference]: With dead ends: 64 [2020-10-24 15:09:09,612 INFO L226 Difference]: Without dead ends: 45 [2020-10-24 15:09:09,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 35.6s TimeCoverageRelationStatistics Valid=19, Invalid=27, Unknown=8, NotChecked=36, Total=90 [2020-10-24 15:09:09,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-10-24 15:09:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2020-10-24 15:09:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:09:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2020-10-24 15:09:09,621 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 20 [2020-10-24 15:09:09,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:09:09,621 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2020-10-24 15:09:09,621 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 15:09:09,621 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-10-24 15:09:09,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:09:09,622 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:09:09,622 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:09:09,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-24 15:09:09,837 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:09:09,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:09:09,838 INFO L82 PathProgramCache]: Analyzing trace with hash 291255914, now seen corresponding path program 1 times [2020-10-24 15:09:09,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:09:09,840 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1458557056] [2020-10-24 15:09:09,840 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:09:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:09:11,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:09:11,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:09:17,859 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:09:30,652 WARN L193 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:09:32,884 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|)))) (and (= (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))) (= .cse1 (_ +zero 11 53)) (= (_ +zero 11 53) .cse0) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0)))) is different from false [2020-10-24 15:09:32,928 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:32,928 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:09:37,238 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 15:09:41,581 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-10-24 15:09:44,971 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2020-10-24 15:09:44,975 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:09:47,272 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_fmax_double_~y_11 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_11)) (fp.div c_~CRM .cse0 .cse1))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ bv0 32) ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_11))) (not (= .cse1 (_ +zero 11 53)))))) (forall ((v_ULTIMATE.start_fmax_double_~y_11 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_11)) (fp.div c_~CRM .cse2 .cse3))) (not (= (_ +zero 11 53) .cse2)) (not (= .cse3 (_ +zero 11 53))) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_11) (_ bv2147483648 32)) (_ bv0 32))))))) is different from true [2020-10-24 15:09:47,274 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:47,275 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1458557056] [2020-10-24 15:09:47,275 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:09:47,275 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-10-24 15:09:47,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611368285] [2020-10-24 15:09:47,276 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:09:47,276 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:09:47,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:09:47,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=39, Unknown=6, NotChecked=26, Total=90 [2020-10-24 15:09:47,277 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 10 states. [2020-10-24 15:09:49,909 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_fmax_double_~y_11 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_11)) (fp.div c_~CRM .cse0 .cse1))) (not (= (_ +zero 11 53) .cse0)) (not (= (_ bv0 32) ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_11))) (not (= .cse1 (_ +zero 11 53)))))) (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_fmax_double_~y_11 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (or (not (= (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_11) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_11)) (fp.div c_~CRM .cse2 .cse3))) (not (= (_ +zero 11 53) .cse2)) (not (= .cse3 (_ +zero 11 53))) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_11) (_ bv2147483648 32)) (_ bv0 32))))))) is different from true [2020-10-24 15:10:01,865 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (and (= .cse0 (_ +zero 11 53)) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))))) (not (= (bvadd c_ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32)) (_ bv0 32))) (not (= (_ bv0 32) c_ULTIMATE.start___fpclassify_double_~msw~0))) is different from false [2020-10-24 15:10:08,545 WARN L838 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|))) (.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|)))) (and (= .cse0 (_ +zero 11 53)) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse1 .cse0) (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))))) (exists ((|v_ULTIMATE.start_main_#t~nondet19_11| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_11| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_11|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_11|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_11|)))) (and (= (fp.div roundNearestTiesToEven .cse2 .cse3) (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))) (= .cse3 (_ +zero 11 53)) (= (_ +zero 11 53) .cse2))))) is different from false [2020-10-24 15:10:33,364 WARN L193 SmtUtils]: Spent 9.67 s on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-10-24 15:10:38,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:10:38,685 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2020-10-24 15:10:38,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:10:38,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2020-10-24 15:10:38,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:10:38,690 INFO L225 Difference]: With dead ends: 52 [2020-10-24 15:10:38,690 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 15:10:38,691 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 67.9s TimeCoverageRelationStatistics Valid=28, Invalid=51, Unknown=13, NotChecked=90, Total=182 [2020-10-24 15:10:38,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 15:10:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2020-10-24 15:10:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-24 15:10:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2020-10-24 15:10:38,699 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 21 [2020-10-24 15:10:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:10:38,700 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2020-10-24 15:10:38,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:10:38,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2020-10-24 15:10:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:10:38,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:10:38,701 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:10:38,906 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-24 15:10:38,910 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:10:38,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:10:38,911 INFO L82 PathProgramCache]: Analyzing trace with hash -719861336, now seen corresponding path program 1 times [2020-10-24 15:10:38,912 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:10:38,912 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [972543476] [2020-10-24 15:10:38,912 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:10:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:10:40,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:10:40,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:10:41,122 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,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:10:41,125 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,126 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [972543476] [2020-10-24 15:10:41,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:10:41,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:10:41,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402164951] [2020-10-24 15:10:41,127 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:10:41,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:10:41,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:10:41,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:10:41,128 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 4 states. [2020-10-24 15:10:41,488 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 15:10:41,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:10:41,725 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2020-10-24 15:10:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:10:41,731 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-10-24 15:10:41,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:10:41,731 INFO L225 Difference]: With dead ends: 53 [2020-10-24 15:10:41,731 INFO L226 Difference]: Without dead ends: 34 [2020-10-24 15:10:41,735 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:10:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-24 15:10:41,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-10-24 15:10:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:10:41,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2020-10-24 15:10:41,748 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 21 [2020-10-24 15:10:41,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:10:41,748 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2020-10-24 15:10:41,749 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:10:41,749 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-10-24 15:10:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:10:41,752 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:10:41,752 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, 1] [2020-10-24 15:10:41,966 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-24 15:10:41,967 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:10:41,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:10:41,968 INFO L82 PathProgramCache]: Analyzing trace with hash -745305499, now seen corresponding path program 1 times [2020-10-24 15:10:41,969 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:10:41,970 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1973094266] [2020-10-24 15:10:41,970 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 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-24 15:10:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:10:43,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:10:43,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:10:46,231 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp.div roundNearestTiesToEven .cse0 .cse1) (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))))) is different from false [2020-10-24 15:10:48,482 WARN L838 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (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:50,762 WARN L838 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start___fpclassify_double_~x (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (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:50,823 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:50,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:10:51,252 WARN L193 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2020-10-24 15:10:51,732 WARN L193 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:10:52,271 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2020-10-24 15:10:52,276 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:10:54,696 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((v_ULTIMATE.start_fmax_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_12)) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (or (not (bvuge .cse0 (_ bv1048576 32))) (not (= (_ +zero 11 53) .cse1)) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse0 (_ bv2146435071 32))) (not (= (fp.div c_~CRM .cse1 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_12))))))) (forall ((v_ULTIMATE.start_fmax_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_12))) (or (not (= (_ +zero 11 53) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (bvule .cse5 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_12)))) (not (bvuge .cse5 (_ bv2148532224 32))))))) is different from true [2020-10-24 15:10:54,698 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:54,699 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1973094266] [2020-10-24 15:10:54,699 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:10:54,699 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2020-10-24 15:10:54,699 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34287286] [2020-10-24 15:10:54,700 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:10:54,700 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:10:54,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:10:54,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=4, NotChecked=44, Total=90 [2020-10-24 15:10:54,709 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 10 states. [2020-10-24 15:10:56,969 WARN L860 $PredicateComparison]: unable to prove that (and (= roundNearestTiesToEven c_~CRM) (forall ((v_ULTIMATE.start_fmax_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_12)) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (or (not (bvuge .cse0 (_ bv1048576 32))) (not (= (_ +zero 11 53) .cse1)) (not (= (_ +zero 11 53) .cse2)) (not (bvule .cse0 (_ bv2146435071 32))) (not (= (fp.div c_~CRM .cse1 .cse2) (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_12))))))) (forall ((v_ULTIMATE.start_fmax_double_~y_12 (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|))) (.cse5 ((_ extract 63 32) v_ULTIMATE.start_fmax_double_~y_12))) (or (not (= (_ +zero 11 53) .cse3)) (not (= (_ +zero 11 53) .cse4)) (not (bvule .cse5 (_ bv4293918719 32))) (not (= (fp.div c_~CRM .cse3 .cse4) (fp ((_ extract 63 63) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 62 52) v_ULTIMATE.start_fmax_double_~y_12) ((_ extract 51 0) v_ULTIMATE.start_fmax_double_~y_12)))) (not (bvuge .cse5 (_ bv2148532224 32))))))) is different from true [2020-10-24 15:10:59,180 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmax_double_~y))) (and (or (not (bvuge .cse0 (_ bv1048576 32))) (not (bvule .cse0 (_ bv2146435071 32)))) (or (not (bvule .cse0 (_ bv4293918719 32))) (not (bvuge .cse0 (_ bv2148532224 32)))) (exists ((|v_ULTIMATE.start_main_#t~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= (fp.div roundNearestTiesToEven .cse1 .cse2) (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~y) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~y) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~y)))))))) is different from false [2020-10-24 15:11:14,282 WARN L193 SmtUtils]: Spent 7.22 s on a formula simplification. DAG size of input: 39 DAG size of output: 23 [2020-10-24 15:11:18,164 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)))) (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~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= ((_ extract 63 32) ULTIMATE.start___fpclassify_double_~x) c_ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div roundNearestTiesToEven .cse1 .cse2) (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)))))) (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:11:20,411 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~nondet18_13| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet19_13| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet18_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet18_13|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet19_13|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet19_13|)))) (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)))))) (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:11:20,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:20,524 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2020-10-24 15:11:20,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 15:11:20,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-10-24 15:11:20,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:20,533 INFO L225 Difference]: With dead ends: 43 [2020-10-24 15:11:20,533 INFO L226 Difference]: Without dead ends: 34 [2020-10-24 15:11:20,534 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.9s TimeCoverageRelationStatistics Valid=28, Invalid=37, Unknown=9, NotChecked=136, Total=210 [2020-10-24 15:11:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-24 15:11:20,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-10-24 15:11:20,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-24 15:11:20,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-10-24 15:11:20,550 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 22 [2020-10-24 15:11:20,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:20,551 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-10-24 15:11:20,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:11:20,552 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-10-24 15:11:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:11:20,555 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:20,555 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, 1] [2020-10-24 15:11:20,759 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-24 15:11:20,760 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:20,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:20,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1592179256, now seen corresponding path program 1 times [2020-10-24 15:11:20,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:20,762 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760638624] [2020-10-24 15:11:20,763 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 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:22,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:22,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-24 15:11:22,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:25,015 WARN L838 $PredicateComparison]: unable to prove that (and (= c_ULTIMATE.start_fmax_double_~x c_ULTIMATE.start___fpclassify_double_~x) (exists ((|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse0 .cse1)))))) is different from false [2020-10-24 15:11:35,273 WARN L193 SmtUtils]: Spent 5.84 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-24 15:11:37,488 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse2) (= (_ +zero 11 53) .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse2 .cse3)))))) (.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmax_double_~x))) (or (and (= (bvadd .cse0 (_ bv1048576 32)) (_ bv0 32)) .cse1) (and .cse1 (= (bvadd .cse0 (_ bv2148532224 32)) (_ bv0 32))))) is different from false [2020-10-24 15:11:39,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmax_double_~x))) (or (and (= (bvadd .cse0 (_ bv1048576 32)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse1 .cse2)))))) (and (exists ((v_prenex_2 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse4 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2)))) (and (= (_ +zero 11 53) .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= (_ +zero 11 53) .cse4)))) (= (bvadd .cse0 (_ bv2148532224 32)) (_ bv0 32))))) is different from false [2020-10-24 15:11:42,219 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse2 ((_ extract 63 32) |c_ULTIMATE.start_fmax_double_#res|))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse0 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse0) (= (_ +zero 11 53) .cse1) (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse0 .cse1))))) (= (bvadd .cse2 (_ bv1048576 32)) (_ bv0 32))) (and (exists ((v_prenex_2 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse3 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse4 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2)))) (and (= (_ +zero 11 53) .cse3) (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse3 .cse4)) (= (_ +zero 11 53) .cse4)))) (= (bvadd .cse2 (_ bv2148532224 32)) (_ bv0 32))))) is different from false [2020-10-24 15:11:42,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:45,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:47,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:51,975 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:51,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:12:01,527 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2020-10-24 15:12:03,055 WARN L193 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2020-10-24 15:12:03,060 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-24 15:12:05,875 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_20)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= (_ +zero 11 53) .cse1)) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_20) (_ bv1048576 32)) (_ bv0 32))) (not (= (_ +zero 11 53) .cse2)) (not (fp.eq .cse0 .cse0))))) (forall ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_20)))) (or (not (= .cse3 (fp.div c_~CRM .cse4 .cse5))) (not (= (_ bv2146435072 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_20))) (not (= (_ +zero 11 53) .cse4)) (not (= (_ +zero 11 53) .cse5)) (not (fp.eq .cse3 .cse3)))))) is different from true [2020-10-24 15:12:05,878 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:12:05,878 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760638624] [2020-10-24 15:12:05,879 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:12:05,879 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 8] imperfect sequences [] total 16 [2020-10-24 15:12:05,879 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14782913] [2020-10-24 15:12:05,879 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-24 15:12:05,880 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:12:05,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-24 15:12:05,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=105, Unknown=9, NotChecked=120, Total=272 [2020-10-24 15:12:05,881 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 17 states. [2020-10-24 15:12:08,115 WARN L860 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_20 (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|))) (.cse0 (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_20)))) (or (not (= .cse0 (fp.div c_~CRM .cse1 .cse2))) (not (= (_ +zero 11 53) .cse1)) (not (= (bvadd ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_20) (_ bv1048576 32)) (_ bv0 32))) (not (= (_ +zero 11 53) .cse2)) (not (fp.eq .cse0 .cse0))))) (= roundNearestTiesToEven c_~CRM) (forall ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64)) (v_ULTIMATE.start___fpclassify_double_~x_20 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse5 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|))) (.cse3 (fp ((_ extract 63 63) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 62 52) v_ULTIMATE.start___fpclassify_double_~x_20) ((_ extract 51 0) v_ULTIMATE.start___fpclassify_double_~x_20)))) (or (not (= .cse3 (fp.div c_~CRM .cse4 .cse5))) (not (= (_ bv2146435072 32) ((_ extract 63 32) v_ULTIMATE.start___fpclassify_double_~x_20))) (not (= (_ +zero 11 53) .cse4)) (not (= (_ +zero 11 53) .cse5)) (not (fp.eq .cse3 .cse3)))))) is different from true [2020-10-24 15:12:42,013 WARN L193 SmtUtils]: Spent 15.18 s on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2020-10-24 15:12:58,660 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ extract 63 32) c_ULTIMATE.start_fmax_double_~x)) (.cse1 (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse2) (= (_ +zero 11 53) .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse2 .cse3))))))) (and (= .cse0 c_ULTIMATE.start___fpclassify_double_~msw~0) (or (and (= (bvadd .cse0 (_ bv1048576 32)) (_ bv0 32)) .cse1) (and .cse1 (= (bvadd .cse0 (_ bv2148532224 32)) (_ bv0 32)))) .cse1)) is different from false [2020-10-24 15:13:01,089 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)))) (fp.eq .cse0 .cse0))) (let ((.cse1 ((_ extract 63 32) c_ULTIMATE.start_fmax_double_~x))) (or (and (= (bvadd .cse1 (_ bv1048576 32)) (_ bv0 32)) (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse3 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse2) (= (_ +zero 11 53) .cse3) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse2 .cse3)))))) (and (exists ((v_prenex_2 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse5 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2)))) (and (= (_ +zero 11 53) .cse4) (= (fp ((_ extract 63 63) c_ULTIMATE.start_fmax_double_~x) ((_ extract 62 52) c_ULTIMATE.start_fmax_double_~x) ((_ extract 51 0) c_ULTIMATE.start_fmax_double_~x)) (fp.div roundNearestTiesToEven .cse4 .cse5)) (= (_ +zero 11 53) .cse5)))) (= (bvadd .cse1 (_ bv2148532224 32)) (_ bv0 32)))))) is different from false [2020-10-24 15:13:03,431 WARN L838 $PredicateComparison]: unable to prove that (and (not (let ((.cse0 (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)))) (fp.eq .cse0 .cse0))) (let ((.cse3 ((_ extract 63 32) |c_ULTIMATE.start_fmax_double_#res|))) (or (and (exists ((|v_ULTIMATE.start_main_#t~nondet15_15| (_ BitVec 64)) (|v_ULTIMATE.start_main_#t~nondet16_15| (_ BitVec 64))) (let ((.cse1 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet15_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet15_15|))) (.cse2 (fp ((_ extract 63 63) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 62 52) |v_ULTIMATE.start_main_#t~nondet16_15|) ((_ extract 51 0) |v_ULTIMATE.start_main_#t~nondet16_15|)))) (and (= (_ +zero 11 53) .cse1) (= (_ +zero 11 53) .cse2) (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse1 .cse2))))) (= (bvadd .cse3 (_ bv1048576 32)) (_ bv0 32))) (and (exists ((v_prenex_2 (_ BitVec 64)) (v_prenex_1 (_ BitVec 64))) (let ((.cse4 (fp ((_ extract 63 63) v_prenex_1) ((_ extract 62 52) v_prenex_1) ((_ extract 51 0) v_prenex_1))) (.cse5 (fp ((_ extract 63 63) v_prenex_2) ((_ extract 62 52) v_prenex_2) ((_ extract 51 0) v_prenex_2)))) (and (= (_ +zero 11 53) .cse4) (= (fp ((_ extract 63 63) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 62 52) |c_ULTIMATE.start_fmax_double_#res|) ((_ extract 51 0) |c_ULTIMATE.start_fmax_double_#res|)) (fp.div roundNearestTiesToEven .cse4 .cse5)) (= (_ +zero 11 53) .cse5)))) (= (bvadd .cse3 (_ bv2148532224 32)) (_ bv0 32)))))) is different from false [2020-10-24 15:13:03,893 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-10-24 15:13:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:13:03,994 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2020-10-24 15:13:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 15:13:03,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2020-10-24 15:13:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:13:03,996 INFO L225 Difference]: With dead ends: 32 [2020-10-24 15:13:03,996 INFO L226 Difference]: Without dead ends: 27 [2020-10-24 15:13:03,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 81.5s TimeCoverageRelationStatistics Valid=57, Invalid=143, Unknown=18, NotChecked=288, Total=506 [2020-10-24 15:13:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-24 15:13:04,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-10-24 15:13:04,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-10-24 15:13:04,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2020-10-24 15:13:04,002 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2020-10-24 15:13:04,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:13:04,003 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2020-10-24 15:13:04,003 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-24 15:13:04,003 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-10-24 15:13:04,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-24 15:13:04,004 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:13:04,004 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, 1, 1] [2020-10-24 15:13:04,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-24 15:13:04,210 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:13:04,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:13:04,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1033691343, now seen corresponding path program 1 times [2020-10-24 15:13:04,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:13:04,212 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990695684] [2020-10-24 15:13:04,212 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 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-24 15:13:05,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:13:05,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:13:05,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:13:11,760 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification that was a NOOP. DAG size: 23 [2020-10-24 15:13:16,666 WARN L195 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) stderr output: (error "out of memory") [2020-10-24 15:13:16,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990695684] [2020-10-24 15:13:16,667 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000)Received EOF on stdin. stderr output: (error "out of memory") [2020-10-24 15:13:16,667 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [544453666] [2020-10-24 15:13:16,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-24 15:13:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:13:20,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-24 15:13:20,117 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@3844981e [2020-10-24 15:13:20,117 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552005354] [2020-10-24 15:13:20,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 15:13:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:13:22,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 31 conjunts are in the unsatisfiable core [2020-10-24 15:13:22,792 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: ManagedScript already locked by de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker@3844981e [2020-10-24 15:13:22,792 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:13:22,792 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [] total 0 [2020-10-24 15:13:22,793 ERROR L205 FreeRefinementEngine]: Strategy WOLF failed to provide any proof altough trace is infeasible [2020-10-24 15:13:22,793 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 15:13:23,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3,14 cvc4 --incremental --print-success --lang smt --rewrite-divk,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-24 15:13:23,418 WARN L238 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2020-10-24 15:13:23,419 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:13:23 BoogieIcfgContainer [2020-10-24 15:13:23,419 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:13:23,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:13:23,420 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:13:23,420 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:13:23,420 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:06:12" (3/4) ... [2020-10-24 15:13:23,424 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 15:13:23,424 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:13:23,430 INFO L168 Benchmark]: Toolchain (without parser) took 432644.83 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 24.0 MB in the beginning and 32.5 MB in the end (delta: -8.5 MB). Peak memory consumption was 3.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,439 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:13:23,439 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.41 ms. Allocated memory is still 46.1 MB. Free memory was 23.3 MB in the beginning and 23.4 MB in the end (delta: -16.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,440 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.27 ms. Allocated memory is still 46.1 MB. Free memory was 23.4 MB in the beginning and 21.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,440 INFO L168 Benchmark]: Boogie Preprocessor took 85.37 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.5 MB in the beginning and 41.5 MB in the end (delta: -20.0 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,444 INFO L168 Benchmark]: RCFGBuilder took 791.75 ms. Allocated memory is still 56.6 MB. Free memory was 41.5 MB in the beginning and 35.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,445 INFO L168 Benchmark]: TraceAbstraction took 431304.70 ms. Allocated memory is still 56.6 MB. Free memory was 35.1 MB in the beginning and 32.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. [2020-10-24 15:13:23,445 INFO L168 Benchmark]: Witness Printer took 4.55 ms. Allocated memory is still 56.6 MB. Free memory was 32.9 MB in the beginning and 32.5 MB in the end (delta: 446.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:13:23,452 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.28 ms. Allocated memory is still 46.1 MB. Free memory was 28.7 MB in the beginning and 28.6 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 353.41 ms. Allocated memory is still 46.1 MB. Free memory was 23.3 MB in the beginning and 23.4 MB in the end (delta: -16.7 kB). Peak memory consumption was 3.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.27 ms. Allocated memory is still 46.1 MB. Free memory was 23.4 MB in the beginning and 21.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.37 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 21.5 MB in the beginning and 41.5 MB in the end (delta: -20.0 MB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 791.75 ms. Allocated memory is still 56.6 MB. Free memory was 41.5 MB in the beginning and 35.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 15.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 431304.70 ms. Allocated memory is still 56.6 MB. Free memory was 35.1 MB in the beginning and 32.9 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 16.1 GB. * Witness Printer took 4.55 ms. Allocated memory is still 56.6 MB. Free memory was 32.9 MB in the beginning and 32.5 MB in the end (delta: 446.5 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: unable to decide satisfiability of path constraint. Possible FailurePath: [L69] EXPR 0.0 [L69] EXPR 0.0 [L69] EXPR 0.0 / 0.0 [L69] double x = 0.0 / 0.0; [L70] EXPR 0.0 [L70] EXPR 0.0 [L70] EXPR 0.0 / 0.0 [L70] double y = 0.0 / 0.0; [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L48-L49] COND TRUE (msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000) [L50] return 1; [L57] COND FALSE !(__fpclassify_double(x) == 0) [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND TRUE ( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff) [L47] return 3; [L59] COND FALSE !(__fpclassify_double(y) == 0) [L62] EXPR x > y ? x : y [L62] return x > y ? x : y; [L71] double res = fmax_double(x, y); [L18] return x != x; [L73] COND TRUE !isnan_double(res) [L3] __assert_fail("0", "double_req_bl_1250.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNKNOWN, OverallTime: 431.1s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 224.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 309 SDtfs, 186 SDslu, 891 SDs, 0 SdLazy, 353 SolverSat, 33 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 71.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 38 IntricatePredicates, 1 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 304.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 107 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 18.5s SatisfiabilityAnalysisTime, 166.1s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 366 ConstructedInterpolants, 67 QuantifiedInterpolants, 105531 SizeOfPredicates, 65 NumberOfNonLiveVariables, 776 ConjunctsInSsa, 90 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...