./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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_1252a.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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ............................................................................................................................................................................................................................................................................................................................................................... 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_1252a.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 b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:50:08,596 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:50:08,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:50:08,616 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:50:08,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:50:08,618 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:50:08,620 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:50:08,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:50:08,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:50:08,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:50:08,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:50:08,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:50:08,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:50:08,631 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:50:08,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:50:08,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:50:08,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:50:08,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:50:08,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:50:08,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:50:08,651 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:50:08,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:50:08,657 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:50:08,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:50:08,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:50:08,662 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:50:08,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:50:08,664 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:50:08,665 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:50:08,666 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:50:08,666 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:50:08,667 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:50:08,668 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:50:08,669 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:50:08,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:50:08,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:50:08,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:50:08,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:50:08,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:50:08,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:50:08,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:50:08,675 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:50:08,690 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:50:08,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:50:08,692 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:50:08,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:50:08,693 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:50:08,693 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:50:08,694 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:50:08,694 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 16:50:08,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:50:08,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:50:08,695 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:50:08,695 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:50:08,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:50:08,696 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:50:08,696 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:50:08,696 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:50:08,696 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:50:08,697 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:50:08,697 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:50:08,697 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:50:08,698 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:50:08,698 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:08,698 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:50:08,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:50:08,699 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:50:08,699 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 16:50:08,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 16:50:08,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:50:08,700 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:50:08,700 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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-28 16:50:09,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:50:09,072 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:50:09,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:50:09,077 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:50:09,077 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:50:09,078 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-28 16:50:09,159 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a0c5c15/a88674070f6e4a48b277d7546ca21237/FLAG46b5695fe [2019-11-28 16:50:09,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:50:09,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-28 16:50:09,657 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a0c5c15/a88674070f6e4a48b277d7546ca21237/FLAG46b5695fe [2019-11-28 16:50:10,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a0c5c15/a88674070f6e4a48b277d7546ca21237 [2019-11-28 16:50:10,033 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:50:10,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:50:10,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:10,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:50:10,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:50:10,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:10" (1/1) ... [2019-11-28 16:50:10,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f061439 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:10, skipping insertion in model container [2019-11-28 16:50:10,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:10" (1/1) ... [2019-11-28 16:50:10,053 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:50:10,073 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:50:10,292 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:10,296 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:50:10,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:10,412 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:50:10,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:10 WrapperNode [2019-11-28 16:50:10,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:10,413 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:10,413 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:50:10,414 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:50:10,422 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:10" (1/1) ... [2019-11-28 16:50:10,431 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:10" (1/1) ... [2019-11-28 16:50:10,469 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:10,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:50:10,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:50:10,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:50:10,477 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:10" (1/1) ... [2019-11-28 16:50:10,477 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:10" (1/1) ... [2019-11-28 16:50:10,480 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:10" (1/1) ... [2019-11-28 16:50:10,480 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:10" (1/1) ... [2019-11-28 16:50:10,490 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:10" (1/1) ... [2019-11-28 16:50:10,505 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:10" (1/1) ... [2019-11-28 16:50:10,507 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:10" (1/1) ... [2019-11-28 16:50:10,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:50:10,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:50:10,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:50:10,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:50:10,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:10" (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:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:50:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-28 16:50:10,573 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:50:10,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:50:10,574 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 16:50:10,575 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:50:11,006 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:50:11,007 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:50:11,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:11 BoogieIcfgContainer [2019-11-28 16:50:11,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:50:11,009 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:50:11,009 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:50:11,013 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:50:11,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:10" (1/3) ... [2019-11-28 16:50:11,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427ab366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:11, skipping insertion in model container [2019-11-28 16:50:11,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:10" (2/3) ... [2019-11-28 16:50:11,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@427ab366 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:11, skipping insertion in model container [2019-11-28 16:50:11,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:11" (3/3) ... [2019-11-28 16:50:11,016 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-28 16:50:11,025 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:50:11,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:50:11,047 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:50:11,069 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:50:11,069 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:50:11,069 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:50:11,070 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:50:11,070 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:50:11,070 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:50:11,070 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:50:11,071 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:50:11,087 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-28 16:50:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:50:11,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:11,095 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:11,096 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:11,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:11,101 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-28 16:50:11,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:11,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510299713] [2019-11-28 16:50:11,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:11,224 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:11,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510299713] [2019-11-28 16:50:11,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:11,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 16:50:11,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397053717] [2019-11-28 16:50:11,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:50:11,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:50:11,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:50:11,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:11,244 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-28 16:50:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:11,266 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-28 16:50:11,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:50:11,268 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 16:50:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:11,277 INFO L225 Difference]: With dead ends: 62 [2019-11-28 16:50:11,277 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 16:50:11,281 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:50:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 16:50:11,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 16:50:11,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 16:50:11,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-28 16:50:11,320 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-28 16:50:11,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:11,320 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-28 16:50:11,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:50:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-28 16:50:11,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:50:11,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:11,321 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:11,322 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:11,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:11,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-28 16:50:11,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:11,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103660286] [2019-11-28 16:50:11,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:11,403 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:11,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103660286] [2019-11-28 16:50:11,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:11,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:50:11,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92092038] [2019-11-28 16:50:11,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:11,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:50:11,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:11,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:11,407 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-28 16:50:11,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:11,510 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-28 16:50:11,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:11,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-28 16:50:11,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:11,512 INFO L225 Difference]: With dead ends: 53 [2019-11-28 16:50:11,512 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 16:50:11,515 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:11,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 16:50:11,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-28 16:50:11,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:11,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:11,530 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-28 16:50:11,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:11,531 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:11,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:11,531 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:11,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:11,532 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:11,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:11,533 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:11,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:11,534 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-28 16:50:11,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:11,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242087807] [2019-11-28 16:50:11,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:11,622 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:11,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242087807] [2019-11-28 16:50:11,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:11,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 16:50:11,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804603791] [2019-11-28 16:50:11,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:11,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 16:50:11,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:11,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:11,627 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-28 16:50:11,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:11,693 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-28 16:50:11,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:11,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-28 16:50:11,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:11,695 INFO L225 Difference]: With dead ends: 55 [2019-11-28 16:50:11,695 INFO L226 Difference]: Without dead ends: 46 [2019-11-28 16:50:11,696 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:11,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-28 16:50:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-28 16:50:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:11,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:11,701 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-28 16:50:11,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:11,702 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:11,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:11,702 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:11,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:11,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:11,703 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:11,703 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:11,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:11,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-28 16:50:11,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 16:50:11,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404076364] [2019-11-28 16:50:11,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 16:50:11,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:50:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 16:50:11,775 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 16:50:11,775 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 16:50:11,806 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:50:11 BoogieIcfgContainer [2019-11-28 16:50:11,806 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:50:11,807 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:50:11,807 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:50:11,807 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:50:11,807 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:11" (3/4) ... [2019-11-28 16:50:11,812 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 16:50:11,812 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:50:11,815 INFO L168 Benchmark]: Toolchain (without parser) took 1779.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.0 GB in the end (delta: -82.6 MB). Peak memory consumption was 38.6 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:11,815 INFO L168 Benchmark]: CDTParser took 0.87 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:11,817 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:11,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.38 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:11,818 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:11,819 INFO L168 Benchmark]: RCFGBuilder took 497.32 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:11,820 INFO L168 Benchmark]: TraceAbstraction took 796.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:11,820 INFO L168 Benchmark]: Witness Printer took 5.39 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:11,824 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.87 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -162.6 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.38 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 40.64 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 497.32 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 796.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.0 MB). Peak memory consumption was 47.0 MB. Max. memory is 11.5 GB. * Witness Printer took 5.39 ms. Allocated memory is still 1.2 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: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, 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.0s 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:13,891 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 16:50:13,894 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 16:50:13,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 16:50:13,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 16:50:13,914 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 16:50:13,917 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 16:50:13,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 16:50:13,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 16:50:13,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 16:50:13,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 16:50:13,938 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 16:50:13,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 16:50:13,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 16:50:13,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 16:50:13,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 16:50:13,946 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 16:50:13,947 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 16:50:13,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 16:50:13,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 16:50:13,957 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 16:50:13,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 16:50:13,961 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 16:50:13,964 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 16:50:13,966 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 16:50:13,966 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 16:50:13,966 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 16:50:13,967 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 16:50:13,968 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 16:50:13,969 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 16:50:13,969 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 16:50:13,970 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 16:50:13,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 16:50:13,971 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 16:50:13,972 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 16:50:13,972 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 16:50:13,973 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 16:50:13,973 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 16:50:13,974 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 16:50:13,975 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 16:50:13,975 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 16:50:13,976 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:13,991 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 16:50:13,992 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 16:50:13,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 16:50:13,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 16:50:13,993 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 16:50:13,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 16:50:13,994 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 16:50:13,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 16:50:13,994 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 16:50:13,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 16:50:13,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 16:50:13,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 16:50:13,995 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 16:50:13,995 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 16:50:13,996 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 16:50:13,996 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 16:50:13,996 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 16:50:13,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 16:50:13,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 16:50:13,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 16:50:13,997 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 16:50:13,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 16:50:13,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 16:50:13,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 16:50:13,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 16:50:13,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 16:50:13,998 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 16:50:13,998 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 16:50:13,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 16:50:13,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 16:50:13,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 16:50:13,999 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 -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-28 16:50:14,317 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 16:50:14,331 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 16:50:14,334 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 16:50:14,336 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 16:50:14,337 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 16:50:14,338 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-28 16:50:14,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db7d84d2/692846019e534df8982540faa5de6a5b/FLAG0a10e60d8 [2019-11-28 16:50:14,873 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 16:50:14,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-28 16:50:14,882 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db7d84d2/692846019e534df8982540faa5de6a5b/FLAG0a10e60d8 [2019-11-28 16:50:15,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4db7d84d2/692846019e534df8982540faa5de6a5b [2019-11-28 16:50:15,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 16:50:15,254 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 16:50:15,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:15,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 16:50:15,258 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 16:50:15,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:15" (1/1) ... [2019-11-28 16:50:15,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f074097 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:15, skipping insertion in model container [2019-11-28 16:50:15,262 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:50:15" (1/1) ... [2019-11-28 16:50:15,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 16:50:15,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 16:50:15,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:15,543 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 16:50:15,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 16:50:15,676 INFO L208 MainTranslator]: Completed translation [2019-11-28 16:50:15,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:15 WrapperNode [2019-11-28 16:50:15,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 16:50:15,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:15,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 16:50:15,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 16:50:15,687 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:15" (1/1) ... [2019-11-28 16:50:15,698 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:15" (1/1) ... [2019-11-28 16:50:15,731 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 16:50:15,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 16:50:15,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 16:50:15,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 16:50:15,740 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:15" (1/1) ... [2019-11-28 16:50:15,741 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:15" (1/1) ... [2019-11-28 16:50:15,745 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:15" (1/1) ... [2019-11-28 16:50:15,746 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:15" (1/1) ... [2019-11-28 16:50:15,756 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:15" (1/1) ... [2019-11-28 16:50:15,762 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:15" (1/1) ... [2019-11-28 16:50:15,765 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:15" (1/1) ... [2019-11-28 16:50:15,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 16:50:15,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 16:50:15,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 16:50:15,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 16:50:15,771 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:15" (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:15,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-28 16:50:15,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 16:50:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 16:50:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 16:50:15,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 16:50:15,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 16:50:16,337 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 16:50:16,337 INFO L287 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-28 16:50:16,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:16 BoogieIcfgContainer [2019-11-28 16:50:16,338 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 16:50:16,339 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 16:50:16,339 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 16:50:16,343 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 16:50:16,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:50:15" (1/3) ... [2019-11-28 16:50:16,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365ee2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:16, skipping insertion in model container [2019-11-28 16:50:16,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:50:15" (2/3) ... [2019-11-28 16:50:16,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@365ee2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:50:16, skipping insertion in model container [2019-11-28 16:50:16,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:50:16" (3/3) ... [2019-11-28 16:50:16,346 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-28 16:50:16,356 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 16:50:16,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 16:50:16,377 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 16:50:16,401 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 16:50:16,401 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 16:50:16,401 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 16:50:16,402 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 16:50:16,402 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 16:50:16,402 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 16:50:16,403 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 16:50:16,403 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 16:50:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-28 16:50:16,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 16:50:16,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:16,424 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:16,424 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:16,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:16,430 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-28 16:50:16,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:16,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192903481] [2019-11-28 16:50:16,440 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:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:16,542 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 16:50:16,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:16,558 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:16,559 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:16,562 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:16,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192903481] [2019-11-28 16:50:16,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:16,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 16:50:16,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852286095] [2019-11-28 16:50:16,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 16:50:16,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 16:50:16,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 16:50:16,589 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-28 16:50:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:16,612 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-28 16:50:16,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 16:50:16,613 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-28 16:50:16,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:16,625 INFO L225 Difference]: With dead ends: 62 [2019-11-28 16:50:16,625 INFO L226 Difference]: Without dead ends: 29 [2019-11-28 16:50:16,629 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:16,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-28 16:50:16,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-28 16:50:16,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 16:50:16,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-28 16:50:16,671 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-28 16:50:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:16,672 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-28 16:50:16,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 16:50:16,672 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-28 16:50:16,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 16:50:16,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:16,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:16,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 16:50:16,888 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:16,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:16,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-28 16:50:16,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:16,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299096933] [2019-11-28 16:50:16,891 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:16,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:16,980 INFO L264 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:50:16,982 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:17,011 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:17,012 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:17,039 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:17,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299096933] [2019-11-28 16:50:17,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:17,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:17,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121833353] [2019-11-28 16:50:17,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:17,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:17,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:17,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:17,042 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-28 16:50:17,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:17,163 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-28 16:50:17,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:17,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-28 16:50:17,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:17,165 INFO L225 Difference]: With dead ends: 68 [2019-11-28 16:50:17,165 INFO L226 Difference]: Without dead ends: 59 [2019-11-28 16:50:17,166 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:17,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-28 16:50:17,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-28 16:50:17,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-28 16:50:17,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-28 16:50:17,175 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-28 16:50:17,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:17,175 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-28 16:50:17,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:17,176 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-28 16:50:17,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 16:50:17,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:17,177 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 16:50:17,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 16:50:17,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:17,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:17,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-28 16:50:17,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:17,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697808559] [2019-11-28 16:50:17,395 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:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:17,464 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 16:50:17,466 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:17,513 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:17,513 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:17,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:17,601 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:17,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697808559] [2019-11-28 16:50:17,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:17,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:17,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447018455] [2019-11-28 16:50:17,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:17,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:17,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:17,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:17,605 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-28 16:50:17,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:17,714 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-28 16:50:17,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 16:50:17,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-28 16:50:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:17,716 INFO L225 Difference]: With dead ends: 52 [2019-11-28 16:50:17,716 INFO L226 Difference]: Without dead ends: 28 [2019-11-28 16:50:17,717 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:17,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-28 16:50:17,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-28 16:50:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 16:50:17,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-28 16:50:17,723 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-28 16:50:17,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:17,723 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-28 16:50:17,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-28 16:50:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 16:50:17,725 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:17,725 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:17,934 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 16:50:17,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:17,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:17,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-28 16:50:17,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:17,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641550277] [2019-11-28 16:50:17,937 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:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:18,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 16:50:18,032 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:18,057 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:18,057 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:18,087 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:18,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641550277] [2019-11-28 16:50:18,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:18,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-28 16:50:18,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854602952] [2019-11-28 16:50:18,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 16:50:18,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:18,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 16:50:18,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 16:50:18,092 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-28 16:50:18,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:18,194 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-28 16:50:18,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 16:50:18,195 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 16:50:18,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:18,196 INFO L225 Difference]: With dead ends: 65 [2019-11-28 16:50:18,196 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 16:50:18,197 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:18,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 16:50:18,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-28 16:50:18,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:50:18,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-28 16:50:18,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-28 16:50:18,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:18,205 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-28 16:50:18,205 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 16:50:18,205 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-28 16:50:18,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:18,206 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:18,206 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:18,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 16:50:18,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:18,428 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-28 16:50:18,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:18,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [502548026] [2019-11-28 16:50:18,429 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:18,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:18,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 16:50:18,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:18,567 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:18,569 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:18,603 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:18,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [502548026] [2019-11-28 16:50:18,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:18,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 16:50:18,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476269958] [2019-11-28 16:50:18,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 16:50:18,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:18,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 16:50:18,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 16:50:18,607 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-28 16:50:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:18,628 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-28 16:50:18,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 16:50:18,631 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 16:50:18,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:18,632 INFO L225 Difference]: With dead ends: 40 [2019-11-28 16:50:18,633 INFO L226 Difference]: Without dead ends: 30 [2019-11-28 16:50:18,634 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:18,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-28 16:50:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-28 16:50:18,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-28 16:50:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 16:50:18,647 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-28 16:50:18,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:18,649 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 16:50:18,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 16:50:18,649 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-28 16:50:18,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 16:50:18,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:18,652 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:18,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 16:50:18,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:18,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:18,876 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-28 16:50:18,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:18,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1934158498] [2019-11-28 16:50:18,878 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:18,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:18,968 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 16:50:18,970 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:19,024 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:19,025 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:19,027 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:19,081 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:19,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1934158498] [2019-11-28 16:50:19,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:19,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-28 16:50:19,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262725721] [2019-11-28 16:50:19,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 16:50:19,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:19,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 16:50:19,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-28 16:50:19,084 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-28 16:50:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:19,198 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-28 16:50:19,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 16:50:19,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-28 16:50:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:19,200 INFO L225 Difference]: With dead ends: 42 [2019-11-28 16:50:19,200 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 16:50:19,200 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:19,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 16:50:19,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-28 16:50:19,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-28 16:50:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-28 16:50:19,206 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-28 16:50:19,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:19,206 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-28 16:50:19,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 16:50:19,207 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-28 16:50:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 16:50:19,207 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:19,208 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:19,421 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 16:50:19,422 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:19,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:19,423 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-28 16:50:19,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:19,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1993224068] [2019-11-28 16:50:19,425 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:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:19,529 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-28 16:50:19,533 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:19,589 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:19,590 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:19,668 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:19,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1993224068] [2019-11-28 16:50:19,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:19,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-28 16:50:19,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694442450] [2019-11-28 16:50:19,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 16:50:19,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:19,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 16:50:19,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 16:50:19,672 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-28 16:50:19,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:19,791 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-28 16:50:19,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 16:50:19,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-28 16:50:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:19,796 INFO L225 Difference]: With dead ends: 45 [2019-11-28 16:50:19,796 INFO L226 Difference]: Without dead ends: 27 [2019-11-28 16:50:19,797 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:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-28 16:50:19,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-28 16:50:19,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-28 16:50:19,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-28 16:50:19,805 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-28 16:50:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:19,806 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-28 16:50:19,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 16:50:19,806 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-28 16:50:19,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 16:50:19,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 16:50:19,807 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:20,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 16:50:20,021 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 16:50:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 16:50:20,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-28 16:50:20,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 16:50:20,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356103570] [2019-11-28 16:50:20,024 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:20,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 16:50:20,156 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 16:50:20,158 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 16:50:20,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:20,271 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:20,272 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 16:50:20,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 16:50:20,487 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:20,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356103570] [2019-11-28 16:50:20,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 16:50:20,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-28 16:50:20,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462958497] [2019-11-28 16:50:20,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 16:50:20,489 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 16:50:20,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 16:50:20,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-28 16:50:20,490 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-28 16:50:20,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 16:50:20,797 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-28 16:50:20,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 16:50:20,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-28 16:50:20,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 16:50:20,804 INFO L225 Difference]: With dead ends: 27 [2019-11-28 16:50:20,804 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 16:50:20,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-28 16:50:20,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 16:50:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 16:50:20,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 16:50:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 16:50:20,805 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-28 16:50:20,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 16:50:20,806 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 16:50:20,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 16:50:20,806 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 16:50:20,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 16:50:21,007 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 16:50:21,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 16:50:21,411 INFO L246 CegarLoopResult]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-28 16:50:21,412 INFO L246 CegarLoopResult]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-28 16:50:21,412 INFO L242 CegarLoopResult]: At program point L69(lines 60 70) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64))) (and (= (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|)) (_ +zero 11 53)) (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|)))) (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (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))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:21,412 INFO L246 CegarLoopResult]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-28 16:50:21,412 INFO L246 CegarLoopResult]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-11-28 16:50:21,412 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 16:50:21,412 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 16:50:21,413 INFO L246 CegarLoopResult]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-11-28 16:50:21,413 INFO L246 CegarLoopResult]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-11-28 16:50:21,413 INFO L242 CegarLoopResult]: At program point L63-2(lines 63 67) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (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))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:21,413 INFO L246 CegarLoopResult]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-28 16:50:21,413 INFO L242 CegarLoopResult]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-28 16:50:21,414 INFO L242 CegarLoopResult]: At program point L47-1(lines 23 48) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (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))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:21,414 INFO L246 CegarLoopResult]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-11-28 16:50:21,414 INFO L246 CegarLoopResult]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-11-28 16:50:21,415 INFO L249 CegarLoopResult]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-11-28 16:50:21,415 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 16:50:21,415 INFO L246 CegarLoopResult]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-28 16:50:21,415 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-11-28 16:50:21,415 INFO L246 CegarLoopResult]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-11-28 16:50:21,415 INFO L242 CegarLoopResult]: At program point L57-3(lines 50 58) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_4_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (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))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_skolemized_v_prenex_4_3)))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:21,416 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 16:50:21,416 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-11-28 16:50:21,416 INFO L242 CegarLoopResult]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-28 16:50:21,416 INFO L246 CegarLoopResult]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-11-28 16:50:21,416 INFO L246 CegarLoopResult]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-11-28 16:50:21,416 INFO L242 CegarLoopResult]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-28 16:50:21,416 INFO L246 CegarLoopResult]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-28 16:50:21,417 INFO L246 CegarLoopResult]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-11-28 16:50:21,417 INFO L246 CegarLoopResult]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-11-28 16:50:21,418 INFO L246 CegarLoopResult]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-28 16:50:21,418 INFO L246 CegarLoopResult]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-11-28 16:50:21,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,430 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,440 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,441 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,445 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,446 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,446 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:21,447 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:21,447 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:21,447 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:21,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,450 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,451 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,451 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:21,451 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:21,452 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:21,452 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:21,454 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:21,454 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:21,454 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:21,454 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:21,455 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:21,456 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:21,456 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:21,456 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:21,459 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:21,462 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:21,462 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:21,462 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:21,463 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:21,463 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:21,463 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:21,464 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:21,465 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:21,465 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:21,466 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:21,466 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:21,476 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:21,476 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:21,477 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:21,477 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:21,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 04:50:21 BoogieIcfgContainer [2019-11-28 16:50:21,486 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 16:50:21,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 16:50:21,489 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 16:50:21,489 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 16:50:21,490 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:16" (3/4) ... [2019-11-28 16:50:21,495 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 16:50:21,512 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2019-11-28 16:50:21,512 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-28 16:50:21,513 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 16:50:21,538 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-28 16:50:21,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_4_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-28 16:50:21,539 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_v_prenex_4_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-28 16:50:21,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\result == 0bv32 && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_q#valueAsBitvector_8[63:32])) && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-28 16:50:21,540 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_4_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-28 16:50:21,601 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 16:50:21,601 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 16:50:21,603 INFO L168 Benchmark]: Toolchain (without parser) took 6349.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 204.5 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -217.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 16:50:21,604 INFO L168 Benchmark]: CDTParser took 0.40 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:21,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:21,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.98 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:21,608 INFO L168 Benchmark]: Boogie Preprocessor took 38.30 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:21,609 INFO L168 Benchmark]: RCFGBuilder took 568.63 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:21,610 INFO L168 Benchmark]: TraceAbstraction took 5146.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.6 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:21,610 INFO L168 Benchmark]: Witness Printer took 114.64 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-28 16:50:21,612 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.40 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 422.64 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -170.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.98 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 38.30 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 568.63 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: 33.4 MB). Peak memory consumption was 33.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5146.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -87.6 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. * Witness Printer took 114.64 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.1 MB). Peak memory consumption was 7.1 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_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_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_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] - 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: 85]: 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: 23]: Loop Invariant [2019-11-28 16:50:21,630 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-28 16:50:21,632 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-11-28 16:50:21,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,635 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:21,635 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:21,635 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:21,635 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:21,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2019-11-28 16:50:21,637 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:21,637 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:21,637 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:21,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_4_3,QUANTIFIED] Derived loop invariant: ((((((((\result == 0bv32 && (\exists v_skolemized_q#valueAsBitvector_8 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_q#valueAsBitvector_8[63:32])) && (\exists v_skolemized_v_prenex_4_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-11-28 16:50:21,638 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:21,638 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:21,638 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:21,638 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:21,639 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:21,639 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:21,639 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:21,639 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 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-11-28 16:50:21,640 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:21,640 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:21,640 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:21,640 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:21,641 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:21,641 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:21,641 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:21,641 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 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-11-28 16:50:21,642 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:21,642 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:21,642 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:21,643 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:21,643 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:21,643 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:21,643 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:21,643 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 :: ~Pluszero~LONGDOUBLE() == ~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]) && msw == v_skolemized_v_prenex_4_3[63:32]) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 30 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 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...