./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 ............................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4284cb37841cd94fe17da64cc250a8a1e69c6375 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 16:49:57,233 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:49:57,236 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:49:57,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:49:57,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:49:57,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:49:57,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:49:57,265 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:49:57,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:49:57,271 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:49:57,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:49:57,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:49:57,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:49:57,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:49:57,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:49:57,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:49:57,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:49:57,287 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:49:57,292 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:49:57,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:49:57,301 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:49:57,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:49:57,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:49:57,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:49:57,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:49:57,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:49:57,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:49:57,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:49:57,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:49:57,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:49:57,317 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:49:57,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:49:57,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:49:57,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:49:57,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:49:57,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:49:57,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:49:57,324 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:49:57,324 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:49:57,325 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:49:57,327 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:49:57,328 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 16:49:57,367 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:49:57,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:49:57,369 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:49:57,369 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:49:57,369 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:49:57,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:49:57,370 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:49:57,370 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:49:57,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:49:57,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:49:57,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:49:57,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:49:57,372 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:49:57,372 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:49:57,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:49:57,373 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:49:57,373 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:49:57,373 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:49:57,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:49:57,374 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:49:57,374 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:49:57,374 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:49:57,375 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:49:57,375 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:49:57,375 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:49:57,375 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:49:57,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:49:57,376 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:49:57,376 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:49:57,376 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-28 16:49:57,664 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:49:57,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:49:57,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:49:57,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:49:57,683 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:49:57,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-28 16:49:57,748 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9cff56d/7f76e30fda6d4465a07cb30ff9be1ff9/FLAG11d195218 [2019-11-28 16:49:58,222 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:49:58,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-28 16:49:58,231 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9cff56d/7f76e30fda6d4465a07cb30ff9be1ff9/FLAG11d195218 [2019-11-28 16:49:58,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd9cff56d/7f76e30fda6d4465a07cb30ff9be1ff9 [2019-11-28 16:49:58,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:49:58,600 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:49:58,601 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:58,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:49:58,605 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:49:58,606 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:58,609 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58, skipping insertion in model container [2019-11-28 16:49:58,609 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:58,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:49:58,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:49:58,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:58,865 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:49:58,956 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:49:58,975 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:49:58,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58 WrapperNode [2019-11-28 16:49:58,975 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:49:58,976 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:58,976 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:49:58,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:49:58,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:58,994 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,022 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:49:59,023 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:49:59,023 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:49:59,023 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:49:59,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,035 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,035 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,048 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,054 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,057 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... [2019-11-28 16:49:59,065 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:49:59,066 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:49:59,066 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:49:59,066 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:49:59,067 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:49:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:49:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:49:59,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:49:59,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:49:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:49:59,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:49:59,556 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:49:59,556 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:49:59,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:59 BoogieIcfgContainer [2019-11-28 16:49:59,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:49:59,559 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:49:59,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:49:59,562 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:49:59,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:49:58" (1/3) ... [2019-11-28 16:49:59,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254412a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:59, skipping insertion in model container [2019-11-28 16:49:59,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:49:58" (2/3) ... [2019-11-28 16:49:59,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@254412a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:49:59, skipping insertion in model container [2019-11-28 16:49:59,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:59" (3/3) ... [2019-11-28 16:49:59,566 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-28 16:49:59,576 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:49:59,582 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:49:59,592 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:49:59,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:49:59,613 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:49:59,613 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:49:59,613 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:49:59,613 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:49:59,614 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:49:59,614 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:49:59,614 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:49:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-28 16:49:59,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:49:59,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:59,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:59,635 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:59,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:59,640 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-28 16:49:59,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:59,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081416955] [2019-11-28 16:49:59,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:49:59,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:49:59,773 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081416955] [2019-11-28 16:49:59,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:49:59,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:49:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482304551] [2019-11-28 16:49:59,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:49:59,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:49:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:49:59,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:49:59,800 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-28 16:49:59,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:49:59,827 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-28 16:49:59,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:49:59,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 16:49:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:49:59,843 INFO L225 Difference]: With dead ends: 62 [2019-11-28 16:49:59,844 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 16:49:59,848 INFO L630 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 [2019-11-28 16:49:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 16:49:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 16:49:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 16:49:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-28 16:49:59,896 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-28 16:49:59,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:49:59,897 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-28 16:49:59,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:49:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-28 16:49:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:49:59,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:49:59,899 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:49:59,899 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:49:59,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:49:59,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-28 16:49:59,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:49:59,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653323201] [2019-11-28 16:49:59,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:49:59,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:00,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:00,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653323201] [2019-11-28 16:50:00,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:00,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:50:00,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615986720] [2019-11-28 16:50:00,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:00,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:50:00,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:00,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:00,066 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-28 16:50:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:00,170 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-28 16:50:00,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:00,171 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 16:50:00,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:00,173 INFO L225 Difference]: With dead ends: 53 [2019-11-28 16:50:00,174 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 16:50:00,175 INFO L630 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 [2019-11-28 16:50:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 16:50:00,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-28 16:50:00,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:00,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:00,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-28 16:50:00,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:00,193 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:00,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:00,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:00,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:00,195 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:00,196 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:00,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:00,197 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-28 16:50:00,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:00,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280801386] [2019-11-28 16:50:00,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:00,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:00,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280801386] [2019-11-28 16:50:00,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:00,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:50:00,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237114499] [2019-11-28 16:50:00,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:00,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:50:00,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:00,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:00,308 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-28 16:50:00,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:00,370 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-28 16:50:00,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:00,371 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 16:50:00,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:00,372 INFO L225 Difference]: With dead ends: 55 [2019-11-28 16:50:00,372 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 16:50:00,373 INFO L630 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 [2019-11-28 16:50:00,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 16:50:00,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-28 16:50:00,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:00,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:00,379 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-28 16:50:00,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:00,379 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:00,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:00,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:00,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:00,380 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:00,380 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:00,381 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:00,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:00,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-28 16:50:00,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:00,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579700656] [2019-11-28 16:50:00,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:50:00,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:50:00,471 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:50:00,471 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:50:00,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:50:00 BoogieIcfgContainer [2019-11-28 16:50:00,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:50:00,506 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:50:00,506 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:50:00,507 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:50:00,507 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:49:59" (3/4) ... [2019-11-28 16:50:00,511 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:50:00,511 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:50:00,513 INFO L168 Benchmark]: Toolchain (without parser) took 1913.38 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -73.9 MB). Peak memory consumption was 46.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:00,514 INFO L168 Benchmark]: CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:00,515 INFO L168 Benchmark]: CACSL2BoogieTranslator took 374.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:00,516 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:00,516 INFO L168 Benchmark]: Boogie Preprocessor took 42.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:00,517 INFO L168 Benchmark]: RCFGBuilder took 491.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:00,518 INFO L168 Benchmark]: TraceAbstraction took 947.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:00,518 INFO L168 Benchmark]: Witness Printer took 4.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:00,522 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.38 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 374.87 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.37 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.73 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 491.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 947.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.81 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, 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.1.25-f470102 [2019-11-28 16:50:02,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:50:02,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:50:02,551 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:50:02,552 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:50:02,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:50:02,554 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:50:02,556 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:50:02,558 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:50:02,559 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:50:02,560 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:50:02,561 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:50:02,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:50:02,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:50:02,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:50:02,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:50:02,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:50:02,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:50:02,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:50:02,570 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:50:02,572 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:50:02,573 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:50:02,574 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:50:02,575 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:50:02,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:50:02,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:50:02,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:50:02,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:50:02,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:50:02,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:50:02,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:50:02,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:50:02,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:50:02,584 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:50:02,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:50:02,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:50:02,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:50:02,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:50:02,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:50:02,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:50:02,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:50:02,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-28 16:50:02,603 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:50:02,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:50:02,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:50:02,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:50:02,605 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:50:02,605 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:50:02,606 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:50:02,606 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:50:02,606 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:50:02,607 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:50:02,607 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:50:02,607 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:50:02,607 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:50:02,608 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:50:02,608 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:50:02,608 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:50:02,608 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:50:02,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:50:02,609 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:50:02,609 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:50:02,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:50:02,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:50:02,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:02,610 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:50:02,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:50:02,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:50:02,611 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:50:02,612 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:50:02,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:50:02,612 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:50:02,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:50:02,613 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-11-28 16:50:02,927 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:50:02,943 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:50:02,949 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:50:02,951 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:50:02,953 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:50:02,954 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-28 16:50:03,026 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766981543/0dcdf71a7bb84ca18562ace280b5915c/FLAG5eeab1959 [2019-11-28 16:50:03,509 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:50:03,510 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-11-28 16:50:03,521 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766981543/0dcdf71a7bb84ca18562ace280b5915c/FLAG5eeab1959 [2019-11-28 16:50:03,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/766981543/0dcdf71a7bb84ca18562ace280b5915c [2019-11-28 16:50:03,874 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:50:03,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:50:03,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:03,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:50:03,882 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:50:03,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f7befcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:03, skipping insertion in model container [2019-11-28 16:50:03,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:03" (1/1) ... [2019-11-28 16:50:03,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:50:03,914 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:50:04,104 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:04,110 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:50:04,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:04,235 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:50:04,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04 WrapperNode [2019-11-28 16:50:04,236 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:04,236 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:04,236 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:50:04,237 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:50:04,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,257 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,290 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:04,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:50:04,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:50:04,291 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:50:04,299 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,299 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,324 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,327 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... [2019-11-28 16:50:04,333 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:50:04,334 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:50:04,334 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:50:04,334 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:50:04,335 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:04,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-28 16:50:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:50:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:50:04,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:50:04,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:50:04,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:50:04,860 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:50:04,861 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:50:04,862 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:04 BoogieIcfgContainer [2019-11-28 16:50:04,863 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:50:04,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:50:04,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:50:04,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:50:04,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:03" (1/3) ... [2019-11-28 16:50:04,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb71293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:04, skipping insertion in model container [2019-11-28 16:50:04,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:04" (2/3) ... [2019-11-28 16:50:04,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eb71293 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:04, skipping insertion in model container [2019-11-28 16:50:04,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:04" (3/3) ... [2019-11-28 16:50:04,872 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-11-28 16:50:04,881 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:50:04,888 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:50:04,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:50:04,926 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:50:04,926 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:50:04,927 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:50:04,927 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:50:04,927 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:50:04,927 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:50:04,928 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:50:04,928 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:50:04,944 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-28 16:50:04,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:50:04,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:04,952 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:04,953 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-28 16:50:04,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:04,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [240526855] [2019-11-28 16:50:04,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:05,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:05,083 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:50:05,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,111 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [240526855] [2019-11-28 16:50:05,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:05,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:50:05,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962182722] [2019-11-28 16:50:05,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:50:05,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:05,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:50:05,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:05,142 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-28 16:50:05,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:05,162 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-28 16:50:05,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:50:05,163 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 16:50:05,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:05,173 INFO L225 Difference]: With dead ends: 62 [2019-11-28 16:50:05,173 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 16:50:05,177 INFO L630 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 [2019-11-28 16:50:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 16:50:05,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 16:50:05,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 16:50:05,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-28 16:50:05,212 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-28 16:50:05,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:05,212 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-28 16:50:05,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:50:05,212 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-28 16:50:05,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:50:05,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:05,213 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:05,428 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:50:05,428 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:05,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:05,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-28 16:50:05,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:05,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1133965444] [2019-11-28 16:50:05,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:05,511 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:50:05,513 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:05,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,552 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:05,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:05,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1133965444] [2019-11-28 16:50:05,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:05,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:05,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20959516] [2019-11-28 16:50:05,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:05,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:05,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:05,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:05,597 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-28 16:50:05,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:05,779 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-28 16:50:05,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:05,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 16:50:05,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:05,787 INFO L225 Difference]: With dead ends: 68 [2019-11-28 16:50:05,787 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 16:50:05,789 INFO L630 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 [2019-11-28 16:50:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 16:50:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-28 16:50:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:05,801 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-28 16:50:05,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:05,803 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:05,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:05,803 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:05,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:05,804 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:05,804 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:06,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:50:06,023 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-28 16:50:06,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:06,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281153665] [2019-11-28 16:50:06,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:06,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:06,099 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 16:50:06,101 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,158 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:06,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281153665] [2019-11-28 16:50:06,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:06,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:06,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074697571] [2019-11-28 16:50:06,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:06,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:06,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:06,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:06,220 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-28 16:50:06,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:06,331 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-28 16:50:06,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:06,332 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 16:50:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:06,333 INFO L225 Difference]: With dead ends: 52 [2019-11-28 16:50:06,333 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 16:50:06,334 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-28 16:50:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 16:50:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 16:50:06,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 16:50:06,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 16:50:06,339 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-28 16:50:06,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:06,340 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 16:50:06,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:06,340 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-28 16:50:06,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:50:06,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:06,341 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:06,554 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:50:06,555 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:06,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:06,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-28 16:50:06,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:06,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1759143376] [2019-11-28 16:50:06,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:06,690 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:50:06,692 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:06,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,714 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:06,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:06,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1759143376] [2019-11-28 16:50:06,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:06,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:06,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800484108] [2019-11-28 16:50:06,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:06,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:06,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:06,740 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-28 16:50:06,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:06,925 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-28 16:50:06,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:06,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 16:50:06,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:06,927 INFO L225 Difference]: With dead ends: 65 [2019-11-28 16:50:06,927 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 16:50:06,928 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:50:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 16:50:06,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-28 16:50:06,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:50:06,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-28 16:50:06,934 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-28 16:50:06,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:06,935 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-28 16:50:06,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-28 16:50:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:06,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:06,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:07,149 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,150 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:07,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:07,151 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-28 16:50:07,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:07,152 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382376882] [2019-11-28 16:50:07,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:07,283 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 16:50:07,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:07,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,308 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:07,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382376882] [2019-11-28 16:50:07,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:07,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 16:50:07,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048894951] [2019-11-28 16:50:07,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:07,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:07,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:07,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:07,344 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-28 16:50:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:07,368 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-28 16:50:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:50:07,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 16:50:07,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:07,369 INFO L225 Difference]: With dead ends: 40 [2019-11-28 16:50:07,370 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 16:50:07,371 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:07,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 16:50:07,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 16:50:07,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:50:07,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 16:50:07,380 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-28 16:50:07,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:07,383 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 16:50:07,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:07,385 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-28 16:50:07,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:07,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:07,386 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:07,604 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 16:50:07,605 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:07,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-28 16:50:07,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:07,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1222413255] [2019-11-28 16:50:07,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:07,697 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:50:07,698 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:07,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,749 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:07,751 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:07,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1222413255] [2019-11-28 16:50:07,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:07,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 16:50:07,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268346307] [2019-11-28 16:50:07,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:50:07,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:07,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:50:07,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:50:07,811 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-28 16:50:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:07,927 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-28 16:50:07,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:50:07,928 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-28 16:50:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:07,929 INFO L225 Difference]: With dead ends: 42 [2019-11-28 16:50:07,929 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 16:50:07,930 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-28 16:50:07,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 16:50:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-28 16:50:07,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 16:50:07,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-28 16:50:07,936 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-28 16:50:07,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:07,937 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-28 16:50:07,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:50:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-28 16:50:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:50:07,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:07,938 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:08,150 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 16:50:08,151 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:08,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:08,152 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-28 16:50:08,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:08,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263624146] [2019-11-28 16:50:08,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:08,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:08,276 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 16:50:08,279 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:08,332 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:08,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:08,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:08,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263624146] [2019-11-28 16:50:08,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:08,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-28 16:50:08,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018528058] [2019-11-28 16:50:08,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:50:08,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:08,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:50:08,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:50:08,476 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-28 16:50:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:08,596 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-28 16:50:08,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:50:08,598 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 16:50:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:08,599 INFO L225 Difference]: With dead ends: 45 [2019-11-28 16:50:08,599 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:08,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-28 16:50:08,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:08,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:08,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 16:50:08,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-28 16:50:08,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:08,618 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 16:50:08,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:50:08,619 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 16:50:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:50:08,620 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:08,620 INFO L410 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] [2019-11-28 16:50:08,842 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 16:50:08,842 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:08,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:08,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-28 16:50:08,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:08,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289530790] [2019-11-28 16:50:08,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/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 [2019-11-28 16:50:08,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:08,938 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 16:50:08,940 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:09,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:09,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:09,077 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:09,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 16:50:09,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289530790] [2019-11-28 16:50:09,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:09,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-28 16:50:09,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785022690] [2019-11-28 16:50:09,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:50:09,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:09,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:50:09,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:50:09,331 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-28 16:50:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:09,657 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 16:50:09,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:50:09,662 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-28 16:50:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:09,662 INFO L225 Difference]: With dead ends: 27 [2019-11-28 16:50:09,662 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:50:09,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:50:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:50:09,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:50:09,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:50:09,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:50:09,664 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-28 16:50:09,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:09,664 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:50:09,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:50:09,665 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:50:09,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:50:09,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 16:50:09,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:50:10,308 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:50:10,308 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:50:10,309 INFO L246 CegarLoopResult]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-11-28 16:50:10,309 INFO L242 CegarLoopResult]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:10,309 INFO L246 CegarLoopResult]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-11-28 16:50:10,309 INFO L246 CegarLoopResult]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L242 CegarLoopResult]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-11-28 16:50:10,310 INFO L246 CegarLoopResult]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-11-28 16:50:10,311 INFO L242 CegarLoopResult]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_fmin_double_#res|) (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|)) (fp.neg (_ +zero 11 53))))) (= (_ bv0 32) (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32))) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-28 16:50:10,311 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-28 16:50:10,311 INFO L246 CegarLoopResult]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-11-28 16:50:10,311 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-11-28 16:50:10,311 INFO L246 CegarLoopResult]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-11-28 16:50:10,314 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:50:10,314 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-11-28 16:50:10,314 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-28 16:50:10,315 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_fmin_double_#res|) (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-28 16:50:10,315 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-11-28 16:50:10,316 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:50:10,316 INFO L242 CegarLoopResult]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:10,316 INFO L242 CegarLoopResult]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-28 16:50:10,316 INFO L246 CegarLoopResult]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-11-28 16:50:10,316 INFO L246 CegarLoopResult]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-11-28 16:50:10,317 INFO L249 CegarLoopResult]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-11-28 16:50:10,317 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-28 16:50:10,317 INFO L246 CegarLoopResult]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-28 16:50:10,318 INFO L242 CegarLoopResult]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= .cse0 |ULTIMATE.start_fmin_double_#res|) (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_4_3) ((_ extract 62 52) v_skolemized_v_prenex_4_3) ((_ extract 51 0) v_skolemized_v_prenex_4_3)) (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-28 16:50:10,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,354 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,357 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,360 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,363 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,365 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,367 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:50:10 BoogieIcfgContainer [2019-11-28 16:50:10,389 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:50:10,389 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:50:10,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:50:10,391 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:50:10,392 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:04" (3/4) ... [2019-11-28 16:50:10,397 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:50:10,412 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 16:50:10,412 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 16:50:10,412 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 16:50:10,437 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-11-28 16:50:10,438 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-28 16:50:10,439 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-28 16:50:10,439 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-28 16:50:10,439 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32]) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-28 16:50:10,475 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:50:10,476 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:50:10,479 INFO L168 Benchmark]: Toolchain (without parser) took 6601.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 210.8 MB). Free memory was 959.0 MB in the beginning and 1.2 GB in the end (delta: -225.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:10,480 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:10,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 358.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:10,484 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:10,484 INFO L168 Benchmark]: Boogie Preprocessor took 43.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:10,484 INFO L168 Benchmark]: RCFGBuilder took 528.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:10,485 INFO L168 Benchmark]: TraceAbstraction took 5525.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:10,485 INFO L168 Benchmark]: Witness Printer took 86.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:10,491 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 358.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 959.0 MB in the beginning and 1.1 GB in the end (delta: -182.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.77 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.36 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 528.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.1 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5525.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -82.3 MB). Peak memory consumption was 284.5 MB. Max. memory is 11.5 GB. * Witness Printer took 86.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2019-11-28 16:50:10,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,510 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:10,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] Derived loop invariant: ((((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 0bv32 == ~bvadd64(\result, 4294967295bv32)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-11-28 16:50:10,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:10,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-11-28 16:50:10,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] Derived loop invariant: (((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-11-28 16:50:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,524 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,525 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] Derived loop invariant: ((((((~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32])) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-11-28 16:50:10,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,526 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,527 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] [2019-11-28 16:50:10,528 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_4_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_4_3[63:63], v_skolemized_v_prenex_4_3[62:52], v_skolemized_v_prenex_4_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && msw == v_skolemized_v_prenex_4_3[63:32]) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.9s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 221 HoareAnnotationTreeSize, 8 FomulaSimplifications, 56 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 28 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 435 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...