./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab 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/float_req_bl_1251.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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ..................................................................................................................................................................................................................................................................................................................................................................... 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/float_req_bl_1251.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 df3954142d6b55c98b13b60b9fbaf053d4d402ff ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:51:14,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:51:14,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:51:14,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:51:14,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:51:14,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:51:14,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:51:14,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:51:14,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:51:14,395 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:51:14,396 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:51:14,399 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:51:14,399 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:51:14,403 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:51:14,404 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:51:14,406 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:51:14,408 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:51:14,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:51:14,411 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:51:14,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:51:14,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:51:14,425 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:51:14,427 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:51:14,429 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:51:14,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:51:14,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:51:14,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:51:14,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:51:14,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:51:14,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:51:14,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:51:14,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:51:14,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:51:14,438 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:51:14,440 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:51:14,440 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:51:14,441 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:51:14,442 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:51:14,442 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:51:14,443 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:51:14,444 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:51:14,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:51:14,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:51:14,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:51:14,482 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:51:14,484 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:51:14,484 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:51:14,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:51:14,485 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:51:14,486 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:51:14,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:51:14,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:51:14,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:51:14,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:51:14,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:51:14,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:51:14,490 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:51:14,490 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:51:14,491 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:51:14,491 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:51:14,491 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:51:14,491 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:51:14,492 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:51:14,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:14,492 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:51:14,493 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:51:14,493 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:51:14,494 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:51:14,494 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:51:14,494 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:51:14,494 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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-27 23:51:14,836 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:51:14,858 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:51:14,861 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:51:14,863 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:51:14,864 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:51:14,865 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-27 23:51:14,936 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58acc65a/68594832e2a24c02a6eadcb2034bc7a4/FLAGf8fe71961 [2019-11-27 23:51:15,402 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:15,402 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-27 23:51:15,410 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58acc65a/68594832e2a24c02a6eadcb2034bc7a4/FLAGf8fe71961 [2019-11-27 23:51:15,776 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e58acc65a/68594832e2a24c02a6eadcb2034bc7a4 [2019-11-27 23:51:15,779 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:15,781 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:15,782 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:15,782 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:15,788 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:15,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:15" (1/1) ... [2019-11-27 23:51:15,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a288275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:15, skipping insertion in model container [2019-11-27 23:51:15,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:15" (1/1) ... [2019-11-27 23:51:15,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:15,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:16,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:16,046 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:16,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:16,153 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:16,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16 WrapperNode [2019-11-27 23:51:16,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:16,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:16,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:16,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:16,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,208 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:16,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:16,209 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:16,209 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:16,222 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,222 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,233 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,234 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (1/1) ... [2019-11-27 23:51:16,256 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:16,257 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:16,257 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:16,257 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:16,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (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-27 23:51:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:51:16,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:16,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:51:16,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:16,808 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:16,808 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:51:16,809 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:16 BoogieIcfgContainer [2019-11-27 23:51:16,810 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:16,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:16,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:16,814 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:16,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:15" (1/3) ... [2019-11-27 23:51:16,815 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637453f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:16, skipping insertion in model container [2019-11-27 23:51:16,815 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:16" (2/3) ... [2019-11-27 23:51:16,816 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7637453f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:16, skipping insertion in model container [2019-11-27 23:51:16,816 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:16" (3/3) ... [2019-11-27 23:51:16,818 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-27 23:51:16,825 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:16,833 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-27 23:51:16,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-27 23:51:16,867 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:16,867 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:16,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:16,868 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:16,868 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:16,868 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:16,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:16,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:16,886 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:51:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:51:16,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:16,894 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:16,895 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:16,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-27 23:51:16,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:16,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616365076] [2019-11-27 23:51:16,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:17,064 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-27 23:51:17,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616365076] [2019-11-27 23:51:17,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:17,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:17,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92404474] [2019-11-27 23:51:17,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:17,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:17,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:17,096 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-27 23:51:17,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:17,187 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-27 23:51:17,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:51:17,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-27 23:51:17,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:17,203 INFO L225 Difference]: With dead ends: 90 [2019-11-27 23:51:17,204 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:51:17,207 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-27 23:51:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:51:17,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-27 23:51:17,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 23:51:17,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-27 23:51:17,252 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-27 23:51:17,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:17,253 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-27 23:51:17,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:17,254 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-27 23:51:17,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:17,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:17,257 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-27 23:51:17,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:17,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:17,258 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-27 23:51:17,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:17,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474659397] [2019-11-27 23:51:17,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:17,402 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-27 23:51:17,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474659397] [2019-11-27 23:51:17,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:17,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:17,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492057451] [2019-11-27 23:51:17,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:17,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:17,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:17,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:17,406 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-27 23:51:17,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:17,485 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-27 23:51:17,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:17,487 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 23:51:17,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:17,490 INFO L225 Difference]: With dead ends: 77 [2019-11-27 23:51:17,491 INFO L226 Difference]: Without dead ends: 64 [2019-11-27 23:51:17,492 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-27 23:51:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-27 23:51:17,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-27 23:51:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:51:17,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-27 23:51:17,510 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-27 23:51:17,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:17,511 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-27 23:51:17,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-27 23:51:17,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:51:17,513 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:17,513 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] [2019-11-27 23:51:17,514 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:17,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:17,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-27 23:51:17,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:17,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460812966] [2019-11-27 23:51:17,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51: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-27 23:51:17,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460812966] [2019-11-27 23:51:17,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:17,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:51:17,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842648995] [2019-11-27 23:51:17,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:51:17,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:17,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:51:17,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:17,604 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-27 23:51:17,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:17,636 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-27 23:51:17,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:51:17,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:51:17,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:17,640 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:51:17,641 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 23:51:17,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:17,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 23:51:17,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-27 23:51:17,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-27 23:51:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-27 23:51:17,656 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-27 23:51:17,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:17,657 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-27 23:51:17,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:51:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-27 23:51:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:51:17,660 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:17,660 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-27 23:51:17,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:17,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:17,661 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-27 23:51:17,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:17,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091168615] [2019-11-27 23:51:17,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:17,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:17,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:17,831 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:51:17,831 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:51:17,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:17 BoogieIcfgContainer [2019-11-27 23:51:17,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:17,865 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:17,865 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:17,865 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:17,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:16" (3/4) ... [2019-11-27 23:51:17,870 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:51:17,870 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:17,872 INFO L168 Benchmark]: Toolchain (without parser) took 2091.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -89.7 MB). Peak memory consumption was 57.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:17,873 INFO L168 Benchmark]: CDTParser took 0.26 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-27 23:51:17,874 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:17,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:17,875 INFO L168 Benchmark]: Boogie Preprocessor took 47.70 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-27 23:51:17,876 INFO L168 Benchmark]: RCFGBuilder took 553.10 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.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:17,880 INFO L168 Benchmark]: TraceAbstraction took 1053.88 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:17,880 INFO L168 Benchmark]: Witness Printer took 4.75 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-27 23:51:17,888 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.26 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 372.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -181.7 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.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: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.70 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 553.10 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.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1053.88 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: 52.4 MB). Peak memory consumption was 52.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 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. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L21] __uint32_t w; [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; [L70] float res = fmax_float(x, y); [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.9s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, 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, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 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.24-30f4e4a [2019-11-27 23:51:19,956 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:51:19,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:51:19,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:51:19,976 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:51:19,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:51:19,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:51:19,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:51:19,992 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:51:19,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:51:19,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:51:19,998 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:51:19,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:51:20,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:51:20,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:51:20,006 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:51:20,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:51:20,009 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:51:20,012 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:51:20,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:51:20,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:51:20,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:51:20,027 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:51:20,028 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:51:20,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:51:20,032 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:51:20,032 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:51:20,034 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:51:20,034 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:51:20,036 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:51:20,036 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:51:20,037 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:51:20,037 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:51:20,038 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:51:20,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:51:20,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:51:20,041 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:51:20,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:51:20,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:51:20,042 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:51:20,044 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:51:20,045 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:51:20,061 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:51:20,062 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:51:20,063 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:51:20,063 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:51:20,064 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:51:20,064 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:51:20,064 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:51:20,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:51:20,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:51:20,065 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:51:20,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:51:20,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:51:20,066 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:51:20,066 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:51:20,066 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:51:20,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:51:20,067 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:51:20,067 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:51:20,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:51:20,068 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:51:20,068 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:51:20,068 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:51:20,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:20,069 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:51:20,069 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:51:20,069 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:51:20,070 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:51:20,070 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:51:20,070 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:51:20,070 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:51:20,071 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 -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-27 23:51:20,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:51:20,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:51:20,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:51:20,420 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:51:20,420 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:51:20,421 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-27 23:51:20,481 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a4d503e/3076bd9fa8a940388d496b49b69cc3ac/FLAG62f4c2ee0 [2019-11-27 23:51:20,990 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:20,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-27 23:51:20,998 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a4d503e/3076bd9fa8a940388d496b49b69cc3ac/FLAG62f4c2ee0 [2019-11-27 23:51:21,352 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60a4d503e/3076bd9fa8a940388d496b49b69cc3ac [2019-11-27 23:51:21,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:21,357 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:21,358 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:21,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:21,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:21,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36cbbb69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21, skipping insertion in model container [2019-11-27 23:51:21,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,373 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:21,393 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:21,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:21,599 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:21,630 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:21,714 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:21,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21 WrapperNode [2019-11-27 23:51:21,715 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:21,716 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:21,716 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:21,716 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:21,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,750 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,779 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:21,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:21,779 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:21,779 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:21,787 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (1/1) ... [2019-11-27 23:51:21,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:21,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:21,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:21,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:21,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (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-27 23:51:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:51:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:21,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:21,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-27 23:51:21,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:22,341 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:22,342 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:51:22,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:22 BoogieIcfgContainer [2019-11-27 23:51:22,343 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:22,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:22,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:22,348 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:22,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:21" (1/3) ... [2019-11-27 23:51:22,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118782ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:22, skipping insertion in model container [2019-11-27 23:51:22,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:21" (2/3) ... [2019-11-27 23:51:22,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@118782ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:22, skipping insertion in model container [2019-11-27 23:51:22,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:22" (3/3) ... [2019-11-27 23:51:22,351 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-27 23:51:22,361 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:22,368 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-27 23:51:22,377 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-27 23:51:22,397 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:22,397 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:22,397 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:22,397 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:22,398 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:22,398 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:22,398 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:22,398 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:22,410 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:51:22,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:51:22,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:22,418 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:22,419 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:22,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-27 23:51:22,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:22,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507611420] [2019-11-27 23:51:22,437 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-27 23:51:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:22,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:51:22,550 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:22,568 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-27 23:51:22,568 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:22,574 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-27 23:51:22,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507611420] [2019-11-27 23:51:22,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:22,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:51:22,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975724169] [2019-11-27 23:51:22,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:51:22,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:51:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:22,599 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-27 23:51:22,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:22,622 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-27 23:51:22,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:51:22,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 23:51:22,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:22,636 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:22,636 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 23:51:22,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 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-27 23:51:22,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 23:51:22,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-27 23:51:22,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:51:22,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-27 23:51:22,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-27 23:51:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:22,682 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-27 23:51:22,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:51:22,682 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-27 23:51:22,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:51:22,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:22,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:22,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:51:22,897 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:22,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:22,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-27 23:51:22,899 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:22,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1221457267] [2019-11-27 23:51:22,899 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-27 23:51:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:22,971 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:22,974 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:23,012 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-27 23:51:23,012 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:23,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:23,027 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-27 23:51:23,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1221457267] [2019-11-27 23:51:23,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:23,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:51:23,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91415110] [2019-11-27 23:51:23,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:23,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:23,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:23,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:23,033 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-27 23:51:23,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:23,117 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-27 23:51:23,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:51:23,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-27 23:51:23,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:23,122 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:23,122 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:51:23,124 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-27 23:51:23,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:51:23,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-27 23:51:23,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 23:51:23,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-27 23:51:23,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-27 23:51:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:23,145 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-27 23:51:23,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:23,146 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-27 23:51:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:23,148 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:23,148 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-27 23:51:23,348 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:51:23,349 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:23,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:23,350 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-27 23:51:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:23,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003899940] [2019-11-27 23:51:23,351 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-27 23:51:23,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:23,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:23,419 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:23,440 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-27 23:51:23,441 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:23,463 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-27 23:51:23,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003899940] [2019-11-27 23:51:23,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:23,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:23,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740957906] [2019-11-27 23:51:23,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:23,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:23,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:23,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:23,466 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-27 23:51:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:23,578 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-27 23:51:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:23,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-27 23:51:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:23,581 INFO L225 Difference]: With dead ends: 96 [2019-11-27 23:51:23,581 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 23:51:23,582 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 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-27 23:51:23,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 23:51:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-27 23:51:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:51:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-27 23:51:23,590 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-27 23:51:23,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:23,591 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-27 23:51:23,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:23,591 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-27 23:51:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:51:23,592 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:23,592 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] [2019-11-27 23:51:23,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:51:23,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:23,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:23,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-27 23:51:23,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:23,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871353724] [2019-11-27 23:51:23,810 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-27 23:51:23,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:23,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:23,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:23,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:23,983 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-27 23:51:23,983 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:23,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:24,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:24,055 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-27 23:51:24,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871353724] [2019-11-27 23:51:24,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:24,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 23:51:24,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739137565] [2019-11-27 23:51:24,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:24,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:24,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:24,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:24,057 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-27 23:51:26,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:26,568 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-11-27 23:51:26,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:51:26,569 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-27 23:51:26,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:26,571 INFO L225 Difference]: With dead ends: 146 [2019-11-27 23:51:26,571 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 23:51:26,572 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:26,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 23:51:26,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-11-27 23:51:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-27 23:51:26,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-27 23:51:26,591 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-27 23:51:26,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:26,591 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-27 23:51:26,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:26,592 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-27 23:51:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:51:26,596 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:26,596 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-27 23:51:26,796 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:51:26,797 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:26,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:26,798 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-27 23:51:26,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:26,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [516824410] [2019-11-27 23:51:26,799 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-27 23:51:26,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:26,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:26,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,955 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,127 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-27 23:51:27,127 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:27,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,252 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,278 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-27 23:51:27,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [516824410] [2019-11-27 23:51:27,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:27,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-27 23:51:27,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885367008] [2019-11-27 23:51:27,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:51:27,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:27,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:51:27,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:27,281 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-27 23:51:28,041 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2019-11-27 23:51:28,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:28,638 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-27 23:51:28,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 23:51:28,639 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-27 23:51:28,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:28,642 INFO L225 Difference]: With dead ends: 180 [2019-11-27 23:51:28,642 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 23:51:28,643 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-27 23:51:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 23:51:28,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-27 23:51:28,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:28,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-27 23:51:28,659 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-27 23:51:28,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:28,660 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-27 23:51:28,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:51:28,660 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-27 23:51:28,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:51:28,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:28,662 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, 1] [2019-11-27 23:51:28,874 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:51:28,875 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:28,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:28,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-27 23:51:28,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:28,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [575052297] [2019-11-27 23:51:28,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-27 23:51:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:28,961 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:28,963 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:29,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,064 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-27 23:51:29,064 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:29,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,112 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-27 23:51:29,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [575052297] [2019-11-27 23:51:29,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:29,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-27 23:51:29,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731225098] [2019-11-27 23:51:29,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:51:29,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:29,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:51:29,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:51:29,130 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-27 23:51:29,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:29,651 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-27 23:51:29,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:29,652 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-27 23:51:29,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:29,653 INFO L225 Difference]: With dead ends: 166 [2019-11-27 23:51:29,653 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 23:51:29,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:29,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 23:51:29,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-27 23:51:29,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:29,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-27 23:51:29,667 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-27 23:51:29,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:29,667 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-27 23:51:29,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:51:29,668 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-27 23:51:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:51:29,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:29,669 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, 1, 1] [2019-11-27 23:51:29,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:51:29,882 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:29,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:29,883 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-27 23:51:29,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:29,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851661648] [2019-11-27 23:51:29,883 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-27 23:51:29,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:29,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:29,952 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:29,967 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-27 23:51:29,967 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:29,978 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-27 23:51:29,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851661648] [2019-11-27 23:51:29,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:29,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:29,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646362075] [2019-11-27 23:51:29,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:29,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:29,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:29,980 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-27 23:51:30,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:30,068 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-27 23:51:30,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:30,069 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 23:51:30,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:30,070 INFO L225 Difference]: With dead ends: 157 [2019-11-27 23:51:30,071 INFO L226 Difference]: Without dead ends: 141 [2019-11-27 23:51:30,072 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 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-27 23:51:30,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-27 23:51:30,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-27 23:51:30,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 23:51:30,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-27 23:51:30,086 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-27 23:51:30,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:30,087 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-27 23:51:30,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:30,087 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-27 23:51:30,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:51:30,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:30,089 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, 1, 1] [2019-11-27 23:51:30,302 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,303 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:30,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:30,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-27 23:51:30,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:30,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1748269219] [2019-11-27 23:51:30,305 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-27 23:51:30,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:30,375 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:51:30,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:30,386 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-27 23:51:30,387 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:30,388 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-27 23:51:30,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1748269219] [2019-11-27 23:51:30,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:30,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 23:51:30,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747805221] [2019-11-27 23:51:30,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:51:30,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:30,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:51:30,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:30,392 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-27 23:51:30,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:30,417 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-27 23:51:30,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:51:30,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 23:51:30,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:30,422 INFO L225 Difference]: With dead ends: 96 [2019-11-27 23:51:30,422 INFO L226 Difference]: Without dead ends: 94 [2019-11-27 23:51:30,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:30,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-27 23:51:30,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-27 23:51:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 23:51:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-27 23:51:30,449 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-27 23:51:30,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:30,450 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-27 23:51:30,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:51:30,451 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-27 23:51:30,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:30,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:30,457 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, 1, 1, 1] [2019-11-27 23:51:30,670 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,670 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-27 23:51:30,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:30,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2024263631] [2019-11-27 23:51:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:30,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:30,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:30,775 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:30,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:30,823 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-27 23:51:30,823 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:30,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:30,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:30,893 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-27 23:51:30,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2024263631] [2019-11-27 23:51:30,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:30,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 23:51:30,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476559826] [2019-11-27 23:51:30,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:30,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:30,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:30,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:30,897 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-27 23:51:31,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:31,285 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-27 23:51:31,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:51:31,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-27 23:51:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:31,287 INFO L225 Difference]: With dead ends: 131 [2019-11-27 23:51:31,287 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 23:51:31,287 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:31,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 23:51:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-27 23:51:31,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-27 23:51:31,298 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-27 23:51:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:31,299 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-27 23:51:31,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-27 23:51:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:31,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:31,306 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, 1, 1, 1] [2019-11-27 23:51:31,519 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 23:51:31,520 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:31,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:31,520 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-27 23:51:31,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:31,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819931681] [2019-11-27 23:51:31,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:31,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:31,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 23:51:31,585 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:31,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:31,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:31,655 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-27 23:51:31,655 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:31,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:31,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:31,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:31,724 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-27 23:51:31,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819931681] [2019-11-27 23:51:31,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:31,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-27 23:51:31,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618796042] [2019-11-27 23:51:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:51:31,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:31,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:51:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:51:31,726 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-27 23:51:34,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:34,367 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-27 23:51:34,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:34,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-27 23:51:34,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:34,369 INFO L225 Difference]: With dead ends: 114 [2019-11-27 23:51:34,369 INFO L226 Difference]: Without dead ends: 78 [2019-11-27 23:51:34,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:51:34,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-27 23:51:34,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-27 23:51:34,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 23:51:34,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-27 23:51:34,377 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-27 23:51:34,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:34,378 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-27 23:51:34,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:51:34,378 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-27 23:51:34,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:34,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:34,379 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, 1, 1, 1] [2019-11-27 23:51:34,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 23:51:34,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:34,581 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-27 23:51:34,582 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:34,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1608365621] [2019-11-27 23:51:34,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:34,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:34,647 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:34,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:34,737 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:34,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:34,783 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-27 23:51:34,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1608365621] [2019-11-27 23:51:34,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-27 23:51:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80671028] [2019-11-27 23:51:34,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:51:34,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:51:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:51:34,785 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-27 23:51:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:35,071 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-27 23:51:35,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:51:35,071 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-27 23:51:35,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:35,072 INFO L225 Difference]: With dead ends: 84 [2019-11-27 23:51:35,073 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:51:35,073 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:51:35,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:51:35,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:51:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:51:35,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-27 23:51:35,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-27 23:51:35,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:35,081 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-27 23:51:35,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:51:35,082 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-27 23:51:35,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:51:35,083 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:35,083 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, 1, 1, 1, 1] [2019-11-27 23:51:35,283 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 23:51:35,284 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:35,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:35,284 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-27 23:51:35,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:35,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714266808] [2019-11-27 23:51:35,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:35,367 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:51:35,368 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:35,428 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-27 23:51:35,429 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:35,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:35,765 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-27 23:51:35,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714266808] [2019-11-27 23:51:35,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:35,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-27 23:51:35,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997591912] [2019-11-27 23:51:35,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:35,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:35,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:35,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:35,769 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-27 23:51:36,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:36,152 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-27 23:51:36,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:51:36,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-27 23:51:36,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:36,154 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:36,154 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:51:36,155 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:51:36,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:51:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:51:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:51:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-27 23:51:36,163 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-27 23:51:36,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:36,163 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-27 23:51:36,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:36,164 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-27 23:51:36,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:51:36,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:36,165 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, 1, 1, 1, 1] [2019-11-27 23:51:36,365 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 23:51:36,366 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:36,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:36,367 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-27 23:51:36,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:36,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819150007] [2019-11-27 23:51:36,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:36,438 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:36,441 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:36,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:36,570 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-27 23:51:36,570 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:36,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:36,837 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-27 23:51:36,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819150007] [2019-11-27 23:51:36,837 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:36,837 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-27 23:51:36,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830283207] [2019-11-27 23:51:36,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:51:36,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:36,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:51:36,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:51:36,839 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-27 23:51:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:39,000 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-27 23:51:39,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:51:39,001 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-27 23:51:39,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:39,002 INFO L225 Difference]: With dead ends: 154 [2019-11-27 23:51:39,003 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 23:51:39,004 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-27 23:51:39,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 23:51:39,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-27 23:51:39,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 23:51:39,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-27 23:51:39,012 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-27 23:51:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:39,012 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-27 23:51:39,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:51:39,013 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-27 23:51:39,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:51:39,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:39,014 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, 1, 1, 1, 1, 1] [2019-11-27 23:51:39,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 23:51:39,228 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:39,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:39,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-27 23:51:39,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:39,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208733806] [2019-11-27 23:51:39,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:39,293 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:51:39,294 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:39,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:39,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:39,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:39,676 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-27 23:51:39,684 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-27 23:51:39,684 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:39,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:39,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:39,863 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-27 23:51:39,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208733806] [2019-11-27 23:51:39,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:39,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-27 23:51:39,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735858747] [2019-11-27 23:51:39,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:51:39,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:39,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:51:39,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:39,865 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-27 23:51:41,365 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-27 23:51:42,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:42,271 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-27 23:51:42,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-27 23:51:42,273 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-27 23:51:42,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:42,274 INFO L225 Difference]: With dead ends: 195 [2019-11-27 23:51:42,274 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 23:51:42,278 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 23:51:42,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 23:51:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-27 23:51:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:51:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-27 23:51:42,285 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-27 23:51:42,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:42,285 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-27 23:51:42,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:51:42,286 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-27 23:51:42,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:51:42,287 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:42,287 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, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:42,501 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 23:51:42,502 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:42,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:42,502 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-27 23:51:42,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:42,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370741309] [2019-11-27 23:51:42,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:42,563 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 23:51:42,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:42,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:42,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:42,822 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-27 23:51:42,822 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:42,946 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:42,972 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-27 23:51:42,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370741309] [2019-11-27 23:51:42,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:42,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-27 23:51:42,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063040207] [2019-11-27 23:51:42,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:51:42,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:42,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:51:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:51:42,974 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-27 23:51:44,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:44,144 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-27 23:51:44,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 23:51:44,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-27 23:51:44,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:44,146 INFO L225 Difference]: With dead ends: 125 [2019-11-27 23:51:44,146 INFO L226 Difference]: Without dead ends: 101 [2019-11-27 23:51:44,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-27 23:51:44,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-27 23:51:44,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-27 23:51:44,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:51:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-27 23:51:44,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-27 23:51:44,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:44,156 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-27 23:51:44,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:51:44,156 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-27 23:51:44,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:51:44,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:44,157 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:44,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 23:51:44,370 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:44,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:44,371 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-27 23:51:44,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:44,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [611239295] [2019-11-27 23:51:44,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:44,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:44,450 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 23:51:44,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:44,468 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:44,469 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:44,485 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:44,521 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-27 23:51:44,521 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:44,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:44,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:44,776 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-27 23:51:44,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [611239295] [2019-11-27 23:51:44,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:44,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-27 23:51:44,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246943746] [2019-11-27 23:51:44,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:44,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:44,778 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-27 23:51:45,264 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-27 23:51:45,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:45,519 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-27 23:51:45,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:51:45,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-27 23:51:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:45,520 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:51:45,520 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 23:51:45,521 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:45,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 23:51:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-27 23:51:45,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:51:45,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-27 23:51:45,527 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-27 23:51:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:45,528 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-27 23:51:45,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-27 23:51:45,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:51:45,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:45,529 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:45,734 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 23:51:45,735 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:45,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:45,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-27 23:51:45,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:45,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39911385] [2019-11-27 23:51:45,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:45,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 23:51:45,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:45,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:45,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:45,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:45,910 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-27 23:51:45,911 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:45,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:45,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:46,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:46,050 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-27 23:51:46,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39911385] [2019-11-27 23:51:46,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:46,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-27 23:51:46,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493473682] [2019-11-27 23:51:46,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:51:46,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:46,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:51:46,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:51:46,052 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-27 23:51:46,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:46,815 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-27 23:51:46,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:51:46,816 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-27 23:51:46,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:46,817 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:51:46,817 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 23:51:46,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-27 23:51:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 23:51:46,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-27 23:51:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:51:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-27 23:51:46,822 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-27 23:51:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:46,823 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-27 23:51:46,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:51:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-27 23:51:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 23:51:46,824 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:46,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:47,024 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 23:51:47,025 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:47,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:47,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-27 23:51:47,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:47,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766969542] [2019-11-27 23:51:47,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:47,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:47,094 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:51:47,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:47,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:47,245 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-27 23:51:47,245 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:47,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:47,376 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-27 23:51:47,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766969542] [2019-11-27 23:51:47,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:47,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-27 23:51:47,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595826811] [2019-11-27 23:51:47,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:51:47,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:47,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:51:47,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:51:47,378 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-27 23:51:48,250 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-11-27 23:51:48,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:48,420 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-27 23:51:48,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:48,421 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-27 23:51:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:48,422 INFO L225 Difference]: With dead ends: 79 [2019-11-27 23:51:48,422 INFO L226 Difference]: Without dead ends: 61 [2019-11-27 23:51:48,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:51:48,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-27 23:51:48,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-27 23:51:48,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:51:48,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-27 23:51:48,429 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-27 23:51:48,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:48,429 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-27 23:51:48,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:51:48,430 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-27 23:51:48,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:51:48,430 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:48,430 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:48,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 23:51:48,640 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:48,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:48,641 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-27 23:51:48,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:48,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423559454] [2019-11-27 23:51:48,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:48,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:48,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:48,733 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-27 23:51:48,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:48,734 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-27 23:51:48,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423559454] [2019-11-27 23:51:48,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:48,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:51:48,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010806473] [2019-11-27 23:51:48,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:48,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:48,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:48,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:48,736 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-27 23:51:48,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:48,763 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-27 23:51:48,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:48,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-27 23:51:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:48,764 INFO L225 Difference]: With dead ends: 39 [2019-11-27 23:51:48,764 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:51:48,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-27 23:51:48,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:51:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:51:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:51:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:51:48,765 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-27 23:51:48,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:48,765 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:51:48,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:51:48,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:51:48,966 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 23:51:48,970 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:51:49,230 WARN L192 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 89 [2019-11-27 23:51:49,342 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 121 [2019-11-27 23:51:49,583 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 135 [2019-11-27 23:51:50,356 WARN L192 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 39 [2019-11-27 23:51:51,074 WARN L192 SmtUtils]: Spent 716.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 26 [2019-11-27 23:51:51,335 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-11-27 23:51:51,823 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 32 [2019-11-27 23:51:52,215 WARN L192 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-11-27 23:51:52,494 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-11-27 23:51:53,286 WARN L192 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2019-11-27 23:51:54,006 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 43 [2019-11-27 23:51:54,208 WARN L192 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-27 23:51:54,313 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-27 23:51:54,313 INFO L249 CegarLoopResult]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-11-27 23:51:54,313 INFO L246 CegarLoopResult]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-27 23:51:54,313 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L246 CegarLoopResult]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L246 CegarLoopResult]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L246 CegarLoopResult]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L246 CegarLoopResult]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-27 23:51:54,314 INFO L242 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-27 23:51:54,315 INFO L242 CegarLoopResult]: At program point L55-1(line 55) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short9| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-27 23:51:54,315 INFO L242 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short13|)) (.cse2 (not |ULTIMATE.start_main_#t~short9|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (not .cse0)))) [2019-11-27 23:51:54,315 INFO L242 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short13|) (not |ULTIMATE.start_main_#t~short9|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short12|) [2019-11-27 23:51:54,315 INFO L242 CegarLoopResult]: At program point L55-4(line 55) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse0) .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse3 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse0 .cse0))) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) .cse1 (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-27 23:51:54,315 INFO L242 CegarLoopResult]: At program point L55-5(line 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse2 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2))) [2019-11-27 23:51:54,316 INFO L242 CegarLoopResult]: At program point L55-6(line 55) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-11-27 23:51:54,316 INFO L242 CegarLoopResult]: At program point L55-7(line 55) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-11-27 23:51:54,316 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-11-27 23:51:54,316 INFO L246 CegarLoopResult]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-11-27 23:51:54,317 INFO L242 CegarLoopResult]: At program point L23-6(lines 23 27) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1))) [2019-11-27 23:51:54,317 INFO L246 CegarLoopResult]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-11-27 23:51:54,317 INFO L246 CegarLoopResult]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-11-27 23:51:54,317 INFO L246 CegarLoopResult]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L242 CegarLoopResult]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y))) (or (and .cse0 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and (not .cse1) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmax_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) .cse0))) [2019-11-27 23:51:54,318 INFO L242 CegarLoopResult]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) (not .cse1) .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse2 .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:51:54,318 INFO L246 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-11-27 23:51:54,319 INFO L246 CegarLoopResult]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-27 23:51:54,320 INFO L246 CegarLoopResult]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-27 23:51:54,320 INFO L242 CegarLoopResult]: At program point L51-3(lines 43 52) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-27 23:51:54,320 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-27 23:51:54,320 INFO L246 CegarLoopResult]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-27 23:51:54,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:54 BoogieIcfgContainer [2019-11-27 23:51:54,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:54,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:54,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:54,356 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:54,357 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:22" (3/4) ... [2019-11-27 23:51:54,361 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:51:54,376 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-27 23:51:54,377 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-27 23:51:54,377 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:51:54,408 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:54,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-27 23:51:54,409 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:54,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-27 23:51:54,410 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-11-27 23:51:54,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) [2019-11-27 23:51:54,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-27 23:51:54,411 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) [2019-11-27 23:51:54,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-27 23:51:54,412 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:54,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-11-27 23:51:54,413 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-27 23:51:54,414 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-27 23:51:54,452 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:51:54,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:54,454 INFO L168 Benchmark]: Toolchain (without parser) took 33097.41 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 319.8 MB). Free memory was 956.3 MB in the beginning and 999.5 MB in the end (delta: -43.1 MB). Peak memory consumption was 276.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,455 INFO L168 Benchmark]: CDTParser took 0.19 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-27 23:51:54,455 INFO L168 Benchmark]: CACSL2BoogieTranslator took 357.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.18 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,456 INFO L168 Benchmark]: Boogie Preprocessor took 37.06 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-27 23:51:54,456 INFO L168 Benchmark]: RCFGBuilder took 527.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,457 INFO L168 Benchmark]: TraceAbstraction took 32007.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,457 INFO L168 Benchmark]: Witness Printer took 100.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 999.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:54,459 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.19 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 357.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.18 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 37.06 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 527.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.5 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 32007.51 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 175.6 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 92.3 MB). Peak memory consumption was 405.1 MB. Max. memory is 11.5 GB. * Witness Printer took 100.15 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 999.5 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((((!~fp.eq~FLOAT(y, y) && x == x) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((~fp.eq~FLOAT(y, y) && 1bv32 == \result) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && 1bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) || (((((!~fp.eq~FLOAT(y, y) && x == x) && 1bv32 == \result) && x == x) && ~fp.eq~FLOAT(x, x)) && y == y) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 26.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.3s, HoareTripleCheckerStatistics: 1148 SDtfs, 2728 SDslu, 4443 SDs, 0 SdLazy, 1913 SolverSat, 263 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 10.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 611 HoareAnnotationTreeSize, 14 FomulaSimplifications, 610904 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 14 FomulaSimplificationsInter, 24552 FormulaSimplificationTreeSizeReductionInter, 4.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93501 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...