./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ee8e70e7 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8039b1e35b9e459b273890fa707790cd9b2d1812 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8039b1e35b9e459b273890fa707790cd9b2d1812 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:11:28,630 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:11:28,635 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:11:28,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:11:28,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:11:28,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:11:28,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:11:28,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:11:28,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:11:28,725 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:11:28,727 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:11:28,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:11:28,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:11:28,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:11:28,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:11:28,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:11:28,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:11:28,740 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:11:28,743 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:11:28,751 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:11:28,753 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:11:28,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:11:28,758 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:11:28,759 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:11:28,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:11:28,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:11:28,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:11:28,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:11:28,771 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:11:28,773 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:11:28,773 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:11:28,774 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:11:28,776 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:11:28,777 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:11:28,779 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:11:28,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:11:28,780 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:11:28,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:11:28,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:11:28,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:11:28,782 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:11:28,787 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-24 15:11:28,814 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:11:28,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:11:28,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:11:28,817 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:11:28,817 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:11:28,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:11:28,817 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:11:28,817 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:11:28,818 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:11:28,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:11:28,819 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:11:28,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:11:28,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:11:28,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:11:28,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:11:28,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:11:28,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:28,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:11:28,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:11:28,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:11:28,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-24 15:11:28,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-24 15:11:28,821 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:11:28,821 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:11:28,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-24 15:11:29,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:11:29,313 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:11:29,316 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:11:29,318 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:11:29,319 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:11:29,320 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-24 15:11:29,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c90cacda3/2321352bb36a407ab71acc884c6589a4/FLAG623054f6d [2020-10-24 15:11:30,048 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:11:30,048 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-24 15:11:30,059 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c90cacda3/2321352bb36a407ab71acc884c6589a4/FLAG623054f6d [2020-10-24 15:11:30,425 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/c90cacda3/2321352bb36a407ab71acc884c6589a4 [2020-10-24 15:11:30,428 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:11:30,435 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:11:30,437 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:30,437 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:11:30,444 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:11:30,445 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,448 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dc05034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30, skipping insertion in model container [2020-10-24 15:11:30,448 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,461 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:11:30,484 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:11:30,678 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:30,696 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:11:30,747 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:30,774 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:11:30,775 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30 WrapperNode [2020-10-24 15:11:30,775 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:30,779 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:30,779 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:11:30,779 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:11:30,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,833 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:30,834 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:11:30,834 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:11:30,834 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:11:30,844 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,848 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,849 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,867 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... [2020-10-24 15:11:30,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:11:30,887 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:11:30,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:11:30,889 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:11:30,890 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 15:11:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:11:30,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-24 15:11:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:11:30,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:11:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 15:11:30,994 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:11:31,707 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:11:31,708 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-24 15:11:31,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:31 BoogieIcfgContainer [2020-10-24 15:11:31,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:11:31,715 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:11:31,715 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:11:31,719 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:11:31,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:11:30" (1/3) ... [2020-10-24 15:11:31,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458ee0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:31, skipping insertion in model container [2020-10-24 15:11:31,721 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:30" (2/3) ... [2020-10-24 15:11:31,722 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@458ee0b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:31, skipping insertion in model container [2020-10-24 15:11:31,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:31" (3/3) ... [2020-10-24 15:11:31,724 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-24 15:11:31,745 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:11:31,751 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-24 15:11:31,769 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-24 15:11:31,819 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:11:31,819 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:11:31,819 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:11:31,819 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:11:31,820 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:11:31,820 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:11:31,820 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:11:31,820 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:11:31,843 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-24 15:11:31,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:11:31,853 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:31,854 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:31,855 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:31,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-24 15:11:31,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:31,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339185801] [2020-10-24 15:11:31,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:32,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:32,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339185801] [2020-10-24 15:11:32,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:32,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:32,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047820635] [2020-10-24 15:11:32,138 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:32,138 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:32,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:32,157 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 4 states. [2020-10-24 15:11:32,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:32,253 INFO L93 Difference]: Finished difference Result 92 states and 136 transitions. [2020-10-24 15:11:32,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 15:11:32,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-10-24 15:11:32,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:32,268 INFO L225 Difference]: With dead ends: 92 [2020-10-24 15:11:32,269 INFO L226 Difference]: Without dead ends: 50 [2020-10-24 15:11:32,272 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:32,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-24 15:11:32,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-24 15:11:32,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 15:11:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-24 15:11:32,316 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2020-10-24 15:11:32,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:32,317 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-24 15:11:32,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-24 15:11:32,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:11:32,319 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:32,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:32,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 15:11:32,320 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:32,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:32,321 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-24 15:11:32,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:32,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472622505] [2020-10-24 15:11:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:32,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:32,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472622505] [2020-10-24 15:11:32,426 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:32,426 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:32,426 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799929002] [2020-10-24 15:11:32,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:32,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:32,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:32,434 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2020-10-24 15:11:32,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:32,556 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2020-10-24 15:11:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:32,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-24 15:11:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:32,559 INFO L225 Difference]: With dead ends: 77 [2020-10-24 15:11:32,560 INFO L226 Difference]: Without dead ends: 64 [2020-10-24 15:11:32,561 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:32,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-10-24 15:11:32,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2020-10-24 15:11:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:32,575 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-24 15:11:32,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:32,575 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:32,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-24 15:11:32,576 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:32,576 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:32,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 15:11:32,577 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:32,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -674173253, now seen corresponding path program 1 times [2020-10-24 15:11:32,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:32,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955282721] [2020-10-24 15:11:32,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:32,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:32,649 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955282721] [2020-10-24 15:11:32,650 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:32,650 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:32,650 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619956361] [2020-10-24 15:11:32,651 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:32,651 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:32,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:32,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:32,652 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-24 15:11:32,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:32,707 INFO L93 Difference]: Finished difference Result 79 states and 99 transitions. [2020-10-24 15:11:32,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:32,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-24 15:11:32,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:32,709 INFO L225 Difference]: With dead ends: 79 [2020-10-24 15:11:32,709 INFO L226 Difference]: Without dead ends: 66 [2020-10-24 15:11:32,710 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:32,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-10-24 15:11:32,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 47. [2020-10-24 15:11:32,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:32,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:32,723 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 19 [2020-10-24 15:11:32,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:32,723 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:32,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:32,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-10-24 15:11:32,729 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:32,729 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:32,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 15:11:32,730 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:32,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:32,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1345927737, now seen corresponding path program 1 times [2020-10-24 15:11:32,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:32,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586128070] [2020-10-24 15:11:32,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:32,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:32,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:32,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586128070] [2020-10-24 15:11:32,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:32,797 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-24 15:11:32,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279544578] [2020-10-24 15:11:32,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:32,799 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:32,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:32,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:32,800 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 4 states. [2020-10-24 15:11:32,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:32,860 INFO L93 Difference]: Finished difference Result 81 states and 101 transitions. [2020-10-24 15:11:32,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:32,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-10-24 15:11:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:32,862 INFO L225 Difference]: With dead ends: 81 [2020-10-24 15:11:32,863 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 15:11:32,863 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:32,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 15:11:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2020-10-24 15:11:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:32,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 20 [2020-10-24 15:11:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:32,872 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:32,872 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:32,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:11:32,873 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:32,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:32,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 15:11:32,874 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:32,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:32,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-24 15:11:32,875 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:32,876 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430857868] [2020-10-24 15:11:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:32,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:32,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:32,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430857868] [2020-10-24 15:11:32,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:32,933 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-24 15:11:32,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937595635] [2020-10-24 15:11:32,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:32,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-24 15:11:32,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:32,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:32,935 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-24 15:11:32,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:32,961 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-24 15:11:32,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:32,962 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-24 15:11:32,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:32,963 INFO L225 Difference]: With dead ends: 50 [2020-10-24 15:11:32,963 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 15:11:32,964 INFO L677 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 [2020-10-24 15:11:32,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 15:11:32,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-24 15:11:32,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 15:11:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-24 15:11:32,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-24 15:11:32,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:32,971 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-24 15:11:32,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:32,971 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-24 15:11:32,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:11:32,972 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:32,975 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:32,975 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 15:11:32,976 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:32,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:32,977 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-24 15:11:32,977 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-24 15:11:32,977 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970724600] [2020-10-24 15:11:32,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 15:11:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:11:33,021 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:11:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-24 15:11:33,072 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-24 15:11:33,131 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-24 15:11:33,132 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-24 15:11:33,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 15:11:33,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:11:33 BoogieIcfgContainer [2020-10-24 15:11:33,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:11:33,179 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:11:33,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:11:33,180 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:11:33,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:31" (3/4) ... [2020-10-24 15:11:33,184 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-24 15:11:33,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:11:33,187 INFO L168 Benchmark]: Toolchain (without parser) took 2755.99 ms. Allocated memory was 46.1 MB in the beginning and 69.2 MB in the end (delta: 23.1 MB). Free memory was 22.3 MB in the beginning and 46.6 MB in the end (delta: -24.3 MB). Peak memory consumption was 994.0 kB. Max. memory is 16.1 GB. [2020-10-24 15:11:33,188 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 37.7 MB. Free memory was 23.8 MB in the beginning and 23.8 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:33,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.60 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 22.2 MB in the end (delta: -536.7 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:33,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.08 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 20.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:33,191 INFO L168 Benchmark]: Boogie Preprocessor took 37.98 ms. Allocated memory is still 46.1 MB. Free memory was 20.2 MB in the beginning and 18.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:33,192 INFO L168 Benchmark]: RCFGBuilder took 824.52 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 18.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:33,193 INFO L168 Benchmark]: TraceAbstraction took 1463.97 ms. Allocated memory was 46.1 MB in the beginning and 69.2 MB in the end (delta: 23.1 MB). Free memory was 17.7 MB in the beginning and 47.1 MB in the end (delta: -29.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:33,194 INFO L168 Benchmark]: Witness Printer took 5.19 ms. Allocated memory is still 69.2 MB. Free memory was 47.1 MB in the beginning and 46.6 MB in the end (delta: 444.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:33,199 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 37.7 MB. Free memory was 23.8 MB in the beginning and 23.8 MB in the end (delta: 37.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 338.60 ms. Allocated memory is still 46.1 MB. Free memory was 21.7 MB in the beginning and 22.2 MB in the end (delta: -536.7 kB). Peak memory consumption was 5.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 54.08 ms. Allocated memory is still 46.1 MB. Free memory was 22.2 MB in the beginning and 20.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.98 ms. Allocated memory is still 46.1 MB. Free memory was 20.2 MB in the beginning and 18.6 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 824.52 ms. Allocated memory is still 46.1 MB. Free memory was 30.1 MB in the beginning and 18.1 MB in the end (delta: 12.0 MB). Peak memory consumption was 13.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1463.97 ms. Allocated memory was 46.1 MB in the beginning and 69.2 MB in the end (delta: 23.1 MB). Free memory was 17.7 MB in the beginning and 47.1 MB in the end (delta: -29.3 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. * Witness Printer took 5.19 ms. Allocated memory is still 69.2 MB. Free memory was 47.1 MB in the beginning and 46.6 MB in the end (delta: 444.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOAT_SMTComparisonOperation at line 76. Possible FailurePath: [L68] float x = __VERIFIER_nondet_float(); [L69] float y = __VERIFIER_nondet_float(); [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L70] EXPR isnan_float(x) && !isnan_float(y) [L70-L71] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L70-L71] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L15] __uint32_t w; [L18] ieee_float_shape_type gf_u; [L19] gf_u.value = (x) [L20] EXPR gf_u.word [L20] (w) = gf_u.word [L23] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L25-L26] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L28-L29] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L31] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L34] return 0; [L38] COND TRUE __fpclassify_float(x) == 0 [L39] return y; [L73] float res = fmin_float(x, y); [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L59] return x != x; [L76] EXPR isnan_float(x) && !isnan_float(y) [L76] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L3] __assert_fail("0", "float_req_bl_1231.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 343 SDtfs, 79 SDslu, 503 SDs, 0 SdLazy, 88 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 62 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 1865 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-ee8e70e [2020-10-24 15:11:35,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 15:11:35,793 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 15:11:35,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 15:11:35,851 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 15:11:35,857 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 15:11:35,863 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 15:11:35,867 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 15:11:35,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 15:11:35,880 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 15:11:35,892 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 15:11:35,893 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 15:11:35,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 15:11:35,897 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 15:11:35,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 15:11:35,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 15:11:35,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 15:11:35,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 15:11:35,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 15:11:35,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 15:11:35,919 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 15:11:35,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 15:11:35,922 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 15:11:35,924 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 15:11:35,933 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 15:11:35,934 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 15:11:35,934 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 15:11:35,937 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 15:11:35,937 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 15:11:35,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 15:11:35,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 15:11:35,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 15:11:35,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 15:11:35,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 15:11:35,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 15:11:35,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 15:11:35,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 15:11:35,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 15:11:35,946 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 15:11:35,948 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 15:11:35,949 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 15:11:35,950 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-24 15:11:36,025 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 15:11:36,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 15:11:36,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-24 15:11:36,033 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-24 15:11:36,033 INFO L138 SettingsManager]: * Use SBE=true [2020-10-24 15:11:36,034 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 15:11:36,036 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 15:11:36,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 15:11:36,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 15:11:36,037 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 15:11:36,037 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 15:11:36,037 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 15:11:36,038 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-24 15:11:36,038 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-24 15:11:36,038 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 15:11:36,038 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 15:11:36,046 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 15:11:36,046 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 15:11:36,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 15:11:36,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-24 15:11:36,047 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 15:11:36,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 15:11:36,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:36,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 15:11:36,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-24 15:11:36,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-24 15:11:36,050 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-24 15:11:36,051 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-24 15:11:36,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 15:11:36,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-24 15:11:36,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-24 15:11:36,052 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8039b1e35b9e459b273890fa707790cd9b2d1812 [2020-10-24 15:11:36,425 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 15:11:36,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 15:11:36,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 15:11:36,488 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 15:11:36,490 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 15:11:36,491 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-24 15:11:36,583 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/202223fa1/fcda3b6073f44cbbb6ef0cc14f62c32c/FLAG00a418c82 [2020-10-24 15:11:37,228 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 15:11:37,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2020-10-24 15:11:37,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/202223fa1/fcda3b6073f44cbbb6ef0cc14f62c32c/FLAG00a418c82 [2020-10-24 15:11:37,601 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/202223fa1/fcda3b6073f44cbbb6ef0cc14f62c32c [2020-10-24 15:11:37,611 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 15:11:37,627 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-24 15:11:37,633 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:37,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 15:11:37,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 15:11:37,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:37,645 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ab7b0f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37, skipping insertion in model container [2020-10-24 15:11:37,645 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:37,655 INFO L146 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 15:11:37,680 INFO L179 MainTranslator]: Built tables and reachable declarations [2020-10-24 15:11:37,859 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:37,878 INFO L212 MainTranslator]: Completed pre-run [2020-10-24 15:11:37,911 INFO L211 PostProcessor]: Analyzing one entry point: main [2020-10-24 15:11:37,938 INFO L217 MainTranslator]: Completed translation [2020-10-24 15:11:37,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37 WrapperNode [2020-10-24 15:11:37,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 15:11:37,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:37,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-24 15:11:37,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-24 15:11:37,951 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:37,972 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-24 15:11:38,010 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 15:11:38,010 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 15:11:38,010 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 15:11:38,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,039 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,046 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,049 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... [2020-10-24 15:11:38,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 15:11:38,081 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 15:11:38,081 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 15:11:38,081 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 15:11:38,083 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 15:11:38,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-24 15:11:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 15:11:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-24 15:11:38,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 15:11:38,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 15:11:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2020-10-24 15:11:38,227 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.float_to_bitvec_FLOAT [2020-10-24 15:11:38,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 15:11:39,086 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 15:11:39,087 INFO L298 CfgBuilder]: Removed 34 assume(true) statements. [2020-10-24 15:11:39,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:39 BoogieIcfgContainer [2020-10-24 15:11:39,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 15:11:39,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 15:11:39,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 15:11:39,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 15:11:39,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 03:11:37" (1/3) ... [2020-10-24 15:11:39,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c3e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:39, skipping insertion in model container [2020-10-24 15:11:39,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 03:11:37" (2/3) ... [2020-10-24 15:11:39,097 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53c3e5f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 03:11:39, skipping insertion in model container [2020-10-24 15:11:39,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:39" (3/3) ... [2020-10-24 15:11:39,099 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2020-10-24 15:11:39,111 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-24 15:11:39,117 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-24 15:11:39,131 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-10-24 15:11:39,160 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 15:11:39,160 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 15:11:39,160 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-24 15:11:39,160 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 15:11:39,161 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 15:11:39,161 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 15:11:39,161 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 15:11:39,161 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 15:11:39,177 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2020-10-24 15:11:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-24 15:11:39,184 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:39,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:39,185 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:39,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2020-10-24 15:11:39,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:39,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582217374] [2020-10-24 15:11:39,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:39,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-24 15:11:39,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:39,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:39,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:39,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:39,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582217374] [2020-10-24 15:11:39,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:39,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-24 15:11:39,359 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497892459] [2020-10-24 15:11:39,365 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-24 15:11:39,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:39,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-24 15:11:39,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-24 15:11:39,386 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2020-10-24 15:11:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:39,411 INFO L93 Difference]: Finished difference Result 84 states and 124 transitions. [2020-10-24 15:11:39,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-24 15:11:39,413 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-10-24 15:11:39,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:39,425 INFO L225 Difference]: With dead ends: 84 [2020-10-24 15:11:39,426 INFO L226 Difference]: Without dead ends: 43 [2020-10-24 15:11:39,429 INFO L677 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 [2020-10-24 15:11:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-24 15:11:39,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2020-10-24 15:11:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-10-24 15:11:39,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2020-10-24 15:11:39,480 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2020-10-24 15:11:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:39,481 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2020-10-24 15:11:39,481 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-24 15:11:39,481 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2020-10-24 15:11:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-24 15:11:39,482 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:39,482 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:39,697 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-24 15:11:39,697 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:39,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:39,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2020-10-24 15:11:39,700 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:39,700 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097625773] [2020-10-24 15:11:39,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:39,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:39,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:39,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:39,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:39,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:39,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097625773] [2020-10-24 15:11:39,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:39,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:39,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19505744] [2020-10-24 15:11:39,837 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:39,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:39,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:39,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:39,839 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2020-10-24 15:11:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:39,898 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2020-10-24 15:11:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-24 15:11:39,899 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-10-24 15:11:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:39,901 INFO L225 Difference]: With dead ends: 82 [2020-10-24 15:11:39,901 INFO L226 Difference]: Without dead ends: 50 [2020-10-24 15:11:39,902 INFO L677 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 [2020-10-24 15:11:39,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-24 15:11:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2020-10-24 15:11:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-24 15:11:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2020-10-24 15:11:39,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2020-10-24 15:11:39,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:39,911 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2020-10-24 15:11:39,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:39,912 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2020-10-24 15:11:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-24 15:11:39,913 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:39,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:40,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-24 15:11:40,131 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:40,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:40,133 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2020-10-24 15:11:40,135 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:40,138 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1230934331] [2020-10-24 15:11:40,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:40,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:40,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,254 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:40,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,273 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1230934331] [2020-10-24 15:11:40,273 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:40,274 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:11:40,274 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738314142] [2020-10-24 15:11:40,275 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:11:40,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:40,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:11:40,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:11:40,276 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2020-10-24 15:11:40,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:40,361 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2020-10-24 15:11:40,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:11:40,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-24 15:11:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:40,364 INFO L225 Difference]: With dead ends: 96 [2020-10-24 15:11:40,364 INFO L226 Difference]: Without dead ends: 83 [2020-10-24 15:11:40,365 INFO L677 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 [2020-10-24 15:11:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-10-24 15:11:40,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2020-10-24 15:11:40,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-24 15:11:40,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2020-10-24 15:11:40,383 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2020-10-24 15:11:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:40,383 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2020-10-24 15:11:40,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:11:40,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2020-10-24 15:11:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-24 15:11:40,385 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:40,385 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:40,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-24 15:11:40,604 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:40,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:40,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2020-10-24 15:11:40,607 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:40,607 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745631857] [2020-10-24 15:11:40,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:40,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:40,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-24 15:11:40,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:40,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:40,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745631857] [2020-10-24 15:11:40,710 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:40,710 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-24 15:11:40,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829679959] [2020-10-24 15:11:40,711 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:40,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:40,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:40,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:40,713 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2020-10-24 15:11:40,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:40,743 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2020-10-24 15:11:40,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:40,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-10-24 15:11:40,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:40,745 INFO L225 Difference]: With dead ends: 50 [2020-10-24 15:11:40,745 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 15:11:40,746 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 15:11:40,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-24 15:11:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-24 15:11:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-24 15:11:40,753 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2020-10-24 15:11:40,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:40,753 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-24 15:11:40,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2020-10-24 15:11:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-24 15:11:40,755 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:40,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:40,968 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-24 15:11:40,968 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:40,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2020-10-24 15:11:40,971 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:40,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [488880510] [2020-10-24 15:11:40,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:41,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:41,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:41,258 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:41,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:41,300 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:41,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:41,417 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:41,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [488880510] [2020-10-24 15:11:41,596 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:41,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2020-10-24 15:11:41,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159652036] [2020-10-24 15:11:41,598 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-24 15:11:41,598 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:41,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-24 15:11:41,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2020-10-24 15:11:41,600 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand 15 states. [2020-10-24 15:11:42,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:42,466 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2020-10-24 15:11:42,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-10-24 15:11:42,467 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2020-10-24 15:11:42,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:42,469 INFO L225 Difference]: With dead ends: 136 [2020-10-24 15:11:42,470 INFO L226 Difference]: Without dead ends: 134 [2020-10-24 15:11:42,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2020-10-24 15:11:42,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2020-10-24 15:11:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 61. [2020-10-24 15:11:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 15:11:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 82 transitions. [2020-10-24 15:11:42,484 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 82 transitions. Word has length 22 [2020-10-24 15:11:42,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:42,484 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 82 transitions. [2020-10-24 15:11:42,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-24 15:11:42,485 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 82 transitions. [2020-10-24 15:11:42,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:42,486 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:42,486 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:42,705 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-24 15:11:42,705 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:42,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:42,707 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2020-10-24 15:11:42,707 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:42,708 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240316482] [2020-10-24 15:11:42,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:42,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:42,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:42,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:42,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:42,924 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240316482] [2020-10-24 15:11:42,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:42,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-24 15:11:42,925 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642751882] [2020-10-24 15:11:42,934 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 15:11:42,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:42,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 15:11:42,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-24 15:11:42,936 INFO L87 Difference]: Start difference. First operand 61 states and 82 transitions. Second operand 6 states. [2020-10-24 15:11:43,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:43,095 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2020-10-24 15:11:43,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 15:11:43,097 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-24 15:11:43,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:43,099 INFO L225 Difference]: With dead ends: 113 [2020-10-24 15:11:43,099 INFO L226 Difference]: Without dead ends: 99 [2020-10-24 15:11:43,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-24 15:11:43,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2020-10-24 15:11:43,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 63. [2020-10-24 15:11:43,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 84 transitions. [2020-10-24 15:11:43,123 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 84 transitions. Word has length 24 [2020-10-24 15:11:43,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:43,126 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 84 transitions. [2020-10-24 15:11:43,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 15:11:43,127 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 84 transitions. [2020-10-24 15:11:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:43,128 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:43,128 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:43,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-24 15:11:43,329 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:43,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:43,330 INFO L82 PathProgramCache]: Analyzing trace with hash 181919584, now seen corresponding path program 1 times [2020-10-24 15:11:43,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:43,332 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [188660052] [2020-10-24 15:11:43,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:43,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-24 15:11:43,459 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:43,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:43,470 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:43,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [188660052] [2020-10-24 15:11:43,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:43,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2020-10-24 15:11:43,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074148776] [2020-10-24 15:11:43,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-24 15:11:43,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:43,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-24 15:11:43,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-24 15:11:43,475 INFO L87 Difference]: Start difference. First operand 63 states and 84 transitions. Second operand 3 states. [2020-10-24 15:11:43,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:43,492 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-10-24 15:11:43,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-24 15:11:43,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-10-24 15:11:43,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:43,494 INFO L225 Difference]: With dead ends: 66 [2020-10-24 15:11:43,494 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 15:11:43,495 INFO L677 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 [2020-10-24 15:11:43,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 15:11:43,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 15:11:43,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:43,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2020-10-24 15:11:43,504 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 24 [2020-10-24 15:11:43,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:43,505 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2020-10-24 15:11:43,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-24 15:11:43,505 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2020-10-24 15:11:43,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-24 15:11:43,506 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:43,507 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:43,722 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-24 15:11:43,723 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:43,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:43,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1382111440, now seen corresponding path program 1 times [2020-10-24 15:11:43,725 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:43,725 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595516149] [2020-10-24 15:11:43,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:43,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:43,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:43,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:43,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:43,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:43,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595516149] [2020-10-24 15:11:43,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:43,834 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:43,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845454063] [2020-10-24 15:11:43,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:43,835 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:43,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:43,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:43,837 INFO L87 Difference]: Start difference. First operand 63 states and 83 transitions. Second operand 4 states. [2020-10-24 15:11:43,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:43,866 INFO L93 Difference]: Finished difference Result 101 states and 132 transitions. [2020-10-24 15:11:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:43,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-10-24 15:11:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:43,868 INFO L225 Difference]: With dead ends: 101 [2020-10-24 15:11:43,868 INFO L226 Difference]: Without dead ends: 63 [2020-10-24 15:11:43,869 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:43,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-10-24 15:11:43,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2020-10-24 15:11:43,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-10-24 15:11:43,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 82 transitions. [2020-10-24 15:11:43,877 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 82 transitions. Word has length 24 [2020-10-24 15:11:43,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:43,878 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 82 transitions. [2020-10-24 15:11:43,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:43,878 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 82 transitions. [2020-10-24 15:11:43,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 15:11:43,879 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:43,879 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:44,098 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-24 15:11:44,099 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:44,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:44,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1344415000, now seen corresponding path program 1 times [2020-10-24 15:11:44,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:44,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825973873] [2020-10-24 15:11:44,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:44,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:44,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:44,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:44,257 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:44,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:44,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:44,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:44,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825973873] [2020-10-24 15:11:44,428 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:44,428 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-24 15:11:44,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406118161] [2020-10-24 15:11:44,429 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:11:44,429 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:44,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:11:44,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-24 15:11:44,435 INFO L87 Difference]: Start difference. First operand 63 states and 82 transitions. Second operand 10 states. [2020-10-24 15:11:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:44,799 INFO L93 Difference]: Finished difference Result 111 states and 140 transitions. [2020-10-24 15:11:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 15:11:44,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-10-24 15:11:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:44,801 INFO L225 Difference]: With dead ends: 111 [2020-10-24 15:11:44,801 INFO L226 Difference]: Without dead ends: 104 [2020-10-24 15:11:44,802 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2020-10-24 15:11:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-10-24 15:11:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2020-10-24 15:11:44,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-24 15:11:44,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 122 transitions. [2020-10-24 15:11:44,829 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 122 transitions. Word has length 25 [2020-10-24 15:11:44,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:44,830 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 122 transitions. [2020-10-24 15:11:44,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:11:44,830 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 122 transitions. [2020-10-24 15:11:44,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 15:11:44,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:44,833 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:45,055 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-24 15:11:45,056 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:45,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:45,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2020-10-24 15:11:45,058 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:45,058 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618968618] [2020-10-24 15:11:45,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:45,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:45,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:45,202 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:45,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:45,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:45,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:45,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:45,275 INFO L375 QuantifierPusher]: Applying distributivity to a DISJUNCTION[2, 2, 2, 1] term [2020-10-24 15:11:45,275 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-24 15:11:45,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:45,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618968618] [2020-10-24 15:11:45,326 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:45,327 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2020-10-24 15:11:45,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78450973] [2020-10-24 15:11:45,327 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 15:11:45,327 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:45,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 15:11:45,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-24 15:11:45,329 INFO L87 Difference]: Start difference. First operand 93 states and 122 transitions. Second operand 9 states. [2020-10-24 15:11:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:45,660 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2020-10-24 15:11:45,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 15:11:45,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-10-24 15:11:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:45,662 INFO L225 Difference]: With dead ends: 110 [2020-10-24 15:11:45,662 INFO L226 Difference]: Without dead ends: 100 [2020-10-24 15:11:45,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2020-10-24 15:11:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2020-10-24 15:11:45,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-24 15:11:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 121 transitions. [2020-10-24 15:11:45,673 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 121 transitions. Word has length 25 [2020-10-24 15:11:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:45,673 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 121 transitions. [2020-10-24 15:11:45,674 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 15:11:45,674 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 121 transitions. [2020-10-24 15:11:45,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 15:11:45,675 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:45,675 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:45,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-24 15:11:45,889 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:45,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:45,890 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2020-10-24 15:11:45,891 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:45,892 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2114922323] [2020-10-24 15:11:45,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:46,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:46,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:46,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:46,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:46,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:46,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:46,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:46,245 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2114922323] [2020-10-24 15:11:46,246 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:46,246 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-10-24 15:11:46,246 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851239188] [2020-10-24 15:11:46,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:11:46,247 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:11:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:11:46,248 INFO L87 Difference]: Start difference. First operand 93 states and 121 transitions. Second operand 12 states. [2020-10-24 15:11:46,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:46,997 INFO L93 Difference]: Finished difference Result 171 states and 202 transitions. [2020-10-24 15:11:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-24 15:11:46,998 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-10-24 15:11:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:46,999 INFO L225 Difference]: With dead ends: 171 [2020-10-24 15:11:46,999 INFO L226 Difference]: Without dead ends: 144 [2020-10-24 15:11:47,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=110, Invalid=310, Unknown=0, NotChecked=0, Total=420 [2020-10-24 15:11:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-10-24 15:11:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 91. [2020-10-24 15:11:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2020-10-24 15:11:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 111 transitions. [2020-10-24 15:11:47,012 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 111 transitions. Word has length 26 [2020-10-24 15:11:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:47,012 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 111 transitions. [2020-10-24 15:11:47,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:11:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 111 transitions. [2020-10-24 15:11:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 15:11:47,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:47,014 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:47,229 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-24 15:11:47,229 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:47,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:47,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1774318379, now seen corresponding path program 1 times [2020-10-24 15:11:47,231 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:47,232 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [818018886] [2020-10-24 15:11:47,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-10-24 15:11:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:47,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:47,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:47,362 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:47,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:47,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:47,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:47,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:47,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:47,522 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [818018886] [2020-10-24 15:11:47,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:47,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-24 15:11:47,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735855848] [2020-10-24 15:11:47,523 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:11:47,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:47,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:11:47,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-24 15:11:47,524 INFO L87 Difference]: Start difference. First operand 91 states and 111 transitions. Second operand 10 states. [2020-10-24 15:11:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:47,863 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2020-10-24 15:11:47,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 15:11:47,864 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-24 15:11:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:47,865 INFO L225 Difference]: With dead ends: 98 [2020-10-24 15:11:47,865 INFO L226 Difference]: Without dead ends: 87 [2020-10-24 15:11:47,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:47,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2020-10-24 15:11:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2020-10-24 15:11:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-24 15:11:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2020-10-24 15:11:47,892 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 26 [2020-10-24 15:11:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:47,892 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2020-10-24 15:11:47,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:11:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2020-10-24 15:11:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-24 15:11:47,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:47,896 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:48,115 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-10-24 15:11:48,116 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:48,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1439476872, now seen corresponding path program 1 times [2020-10-24 15:11:48,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:48,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [365440431] [2020-10-24 15:11:48,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:48,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:48,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2020-10-24 15:11:48,230 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:48,256 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:48,259 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:48,297 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:48,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:48,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [365440431] [2020-10-24 15:11:48,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:48,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2020-10-24 15:11:48,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743659052] [2020-10-24 15:11:48,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 15:11:48,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:48,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 15:11:48,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-10-24 15:11:48,410 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 10 states. [2020-10-24 15:11:48,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:48,756 INFO L93 Difference]: Finished difference Result 106 states and 129 transitions. [2020-10-24 15:11:48,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 15:11:48,757 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2020-10-24 15:11:48,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:48,757 INFO L225 Difference]: With dead ends: 106 [2020-10-24 15:11:48,758 INFO L226 Difference]: Without dead ends: 74 [2020-10-24 15:11:48,758 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:48,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2020-10-24 15:11:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2020-10-24 15:11:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-10-24 15:11:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2020-10-24 15:11:48,766 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 26 [2020-10-24 15:11:48,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:48,767 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2020-10-24 15:11:48,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 15:11:48,767 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2020-10-24 15:11:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-10-24 15:11:48,768 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:48,768 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:48,981 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-10-24 15:11:48,982 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:48,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:48,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1423958792, now seen corresponding path program 1 times [2020-10-24 15:11:48,984 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:48,984 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [298126325] [2020-10-24 15:11:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:49,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-24 15:11:49,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:49,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:49,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:49,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:49,420 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:49,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:49,596 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [298126325] [2020-10-24 15:11:49,597 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:49,597 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2020-10-24 15:11:49,597 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404425786] [2020-10-24 15:11:49,597 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-24 15:11:49,597 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:49,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-24 15:11:49,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2020-10-24 15:11:49,600 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand 12 states. [2020-10-24 15:11:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:51,178 INFO L93 Difference]: Finished difference Result 198 states and 219 transitions. [2020-10-24 15:11:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-24 15:11:51,179 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2020-10-24 15:11:51,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:51,181 INFO L225 Difference]: With dead ends: 198 [2020-10-24 15:11:51,181 INFO L226 Difference]: Without dead ends: 174 [2020-10-24 15:11:51,183 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=251, Invalid=805, Unknown=0, NotChecked=0, Total=1056 [2020-10-24 15:11:51,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2020-10-24 15:11:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 72. [2020-10-24 15:11:51,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2020-10-24 15:11:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2020-10-24 15:11:51,198 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 28 [2020-10-24 15:11:51,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:51,198 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2020-10-24 15:11:51,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-24 15:11:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2020-10-24 15:11:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-10-24 15:11:51,199 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:51,200 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:51,410 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-10-24 15:11:51,411 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:51,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:51,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2092804141, now seen corresponding path program 1 times [2020-10-24 15:11:51,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:51,413 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444890220] [2020-10-24 15:11:51,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:51,524 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:51,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:51,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:51,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:51,540 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444890220] [2020-10-24 15:11:51,540 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:51,540 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:51,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650089604] [2020-10-24 15:11:51,541 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:51,541 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:51,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:51,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:51,542 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand 4 states. [2020-10-24 15:11:51,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:51,589 INFO L93 Difference]: Finished difference Result 84 states and 98 transitions. [2020-10-24 15:11:51,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:51,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-10-24 15:11:51,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:51,591 INFO L225 Difference]: With dead ends: 84 [2020-10-24 15:11:51,591 INFO L226 Difference]: Without dead ends: 53 [2020-10-24 15:11:51,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-24 15:11:51,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-10-24 15:11:51,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2020-10-24 15:11:51,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-24 15:11:51,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2020-10-24 15:11:51,603 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 29 [2020-10-24 15:11:51,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:51,603 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2020-10-24 15:11:51,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2020-10-24 15:11:51,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 15:11:51,605 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:51,605 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:51,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-10-24 15:11:51,819 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:51,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:51,820 INFO L82 PathProgramCache]: Analyzing trace with hash 489956430, now seen corresponding path program 1 times [2020-10-24 15:11:51,821 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:51,821 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617249824] [2020-10-24 15:11:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:51,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-24 15:11:51,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:52,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:52,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:52,585 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617249824] [2020-10-24 15:11:52,585 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:52,585 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-24 15:11:52,585 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097124964] [2020-10-24 15:11:52,585 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 15:11:52,585 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 15:11:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:52,586 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 14 states. [2020-10-24 15:11:53,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:53,661 INFO L93 Difference]: Finished difference Result 85 states and 97 transitions. [2020-10-24 15:11:53,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 15:11:53,661 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-24 15:11:53,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:53,662 INFO L225 Difference]: With dead ends: 85 [2020-10-24 15:11:53,662 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 15:11:53,663 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2020-10-24 15:11:53,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 15:11:53,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2020-10-24 15:11:53,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 15:11:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2020-10-24 15:11:53,673 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 32 [2020-10-24 15:11:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:53,673 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2020-10-24 15:11:53,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 15:11:53,673 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2020-10-24 15:11:53,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-10-24 15:11:53,675 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:53,676 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:53,888 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2020-10-24 15:11:53,889 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:53,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1191021008, now seen corresponding path program 1 times [2020-10-24 15:11:53,892 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:53,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1085730732] [2020-10-24 15:11:53,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:54,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-24 15:11:54,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:54,072 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:54,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:54,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-24 15:11:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:54,167 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:54,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:54,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1085730732] [2020-10-24 15:11:54,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:54,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2020-10-24 15:11:54,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126392367] [2020-10-24 15:11:54,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 15:11:54,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:54,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 15:11:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2020-10-24 15:11:54,333 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 14 states. [2020-10-24 15:11:55,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:55,095 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2020-10-24 15:11:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 15:11:55,096 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2020-10-24 15:11:55,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:55,097 INFO L225 Difference]: With dead ends: 55 [2020-10-24 15:11:55,097 INFO L226 Difference]: Without dead ends: 41 [2020-10-24 15:11:55,097 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2020-10-24 15:11:55,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-24 15:11:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2020-10-24 15:11:55,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-24 15:11:55,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-10-24 15:11:55,107 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 32 [2020-10-24 15:11:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:55,108 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-10-24 15:11:55,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 15:11:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-10-24 15:11:55,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-10-24 15:11:55,111 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 15:11:55,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 15:11:55,323 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2020-10-24 15:11:55,324 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 15:11:55,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 15:11:55,325 INFO L82 PathProgramCache]: Analyzing trace with hash 798574185, now seen corresponding path program 1 times [2020-10-24 15:11:55,325 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-24 15:11:55,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [296617911] [2020-10-24 15:11:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 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 [2020-10-24 15:11:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 15:11:55,438 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-24 15:11:55,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-24 15:11:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:55,462 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-24 15:11:55,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 15:11:55,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [296617911] [2020-10-24 15:11:55,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-24 15:11:55,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-24 15:11:55,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919465493] [2020-10-24 15:11:55,467 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-24 15:11:55,467 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-24 15:11:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-24 15:11:55,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-24 15:11:55,468 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2020-10-24 15:11:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 15:11:55,497 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2020-10-24 15:11:55,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-24 15:11:55,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2020-10-24 15:11:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 15:11:55,498 INFO L225 Difference]: With dead ends: 39 [2020-10-24 15:11:55,498 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 15:11:55,499 INFO L677 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 [2020-10-24 15:11:55,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 15:11:55,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 15:11:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 15:11:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 15:11:55,499 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2020-10-24 15:11:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 15:11:55,500 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 15:11:55,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-24 15:11:55,500 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 15:11:55,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 15:11:55,701 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2020-10-24 15:11:55,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 15:11:55,968 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2020-10-24 15:11:56,286 WARN L193 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 56 [2020-10-24 15:11:56,484 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 57 [2020-10-24 15:11:56,949 WARN L193 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 48 [2020-10-24 15:11:57,104 WARN L193 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2020-10-24 15:11:57,291 WARN L193 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2020-10-24 15:11:57,555 WARN L193 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2020-10-24 15:11:57,848 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 66 [2020-10-24 15:11:58,194 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 69 [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L3-2(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L3-3(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L28(lines 28 34) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 34) no Hoare annotation was computed. [2020-10-24 15:11:58,298 INFO L274 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L70-2(line 70) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L70-3(lines 70 71) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L70-5(lines 70 86) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L70-7(lines 70 86) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L71(line 71) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L71-2(line 71) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L277 CegarLoopResult]: At program point L88(lines 61 89) the Hoare annotation is: true [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L31(lines 31 34) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L31-1(lines 31 34) no Hoare annotation was computed. [2020-10-24 15:11:58,299 INFO L274 CegarLoopResult]: For program point L40(lines 40 41) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L25(lines 25 34) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L25-1(lines 25 34) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L274 CegarLoopResult]: For program point L17-1(lines 17 21) no Hoare annotation was computed. [2020-10-24 15:11:58,300 INFO L270 CegarLoopResult]: At program point L17-2(lines 17 21) the Hoare annotation is: (let ((.cse3 (let ((.cse7 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse7 .cse7))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse6 .cse6)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) .cse1 .cse2 (not .cse3) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (let ((.cse5 (and (not (= (_ bv0 32) (bvadd ULTIMATE.start_main_~y~0 (_ bv2147483648 32)))) (not (= (_ bv0 32) ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~y) ((_ extract 30 23) ULTIMATE.start_fmin_float_~y) ((_ extract 22 0) ULTIMATE.start_fmin_float_~y)))) (fp.eq .cse4 .cse4))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (or (not |ULTIMATE.start_main_#t~short22|) .cse5) (or (not |ULTIMATE.start_main_#t~short23|) .cse5) (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~x) .cse3 (or (and (not .cse2) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 .cse2)))))) [2020-10-24 15:11:58,301 INFO L274 CegarLoopResult]: For program point L17-3(lines 14 35) no Hoare annotation was computed. [2020-10-24 15:11:58,301 INFO L274 CegarLoopResult]: For program point L17-5(lines 17 21) no Hoare annotation was computed. [2020-10-24 15:11:58,301 INFO L270 CegarLoopResult]: At program point L17-6(lines 17 21) the Hoare annotation is: (let ((.cse1 (and (not (= (_ bv0 32) (bvadd ULTIMATE.start_main_~y~0 (_ bv2147483648 32)))) (not (= (_ bv0 32) ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~y) ((_ extract 30 23) ULTIMATE.start_fmin_float_~y) ((_ extract 22 0) ULTIMATE.start_fmin_float_~y)))) (fp.eq .cse0 .cse0))) (or (not |ULTIMATE.start_main_#t~short22|) .cse1) (or (not |ULTIMATE.start_main_#t~short23|) .cse1) (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse2))))) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse3 .cse3))) (let ((.cse4 (let ((.cse5 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse5 .cse5)))) (or (and (not .cse4) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse4))))) [2020-10-24 15:11:58,301 INFO L274 CegarLoopResult]: For program point L17-7(lines 14 35) no Hoare annotation was computed. [2020-10-24 15:11:58,301 INFO L270 CegarLoopResult]: At program point L34(lines 14 35) the Hoare annotation is: (let ((.cse4 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (.cse5 (let ((.cse9 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse9 .cse9))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (let ((.cse8 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse8 .cse8)))) (or (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) (not (let ((.cse1 (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 .cse1 .cse1))) .cse2 .cse3 .cse4 (not .cse5) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (let ((.cse7 (and (not (= (_ bv0 32) (bvadd ULTIMATE.start_main_~y~0 (_ bv2147483648 32)))) (not (= (_ bv0 32) ULTIMATE.start_main_~y~0))))) (and (not (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~y) ((_ extract 30 23) ULTIMATE.start_fmin_float_~y) ((_ extract 22 0) ULTIMATE.start_fmin_float_~y)))) (fp.eq .cse6 .cse6))) (not .cse4) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (or (not |ULTIMATE.start_main_#t~short22|) .cse7) (= ULTIMATE.start___fpclassify_float_~x ULTIMATE.start_fmin_float_~x) (or (not |ULTIMATE.start_main_#t~short23|) .cse7) .cse5 (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~w~0) (or (and (not .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse2 .cse3)))))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L34-1(lines 14 35) the Hoare annotation is: (let ((.cse2 (and (not (= (_ bv0 32) (bvadd ULTIMATE.start_main_~y~0 (_ bv2147483648 32)))) (not (= (_ bv0 32) ULTIMATE.start_main_~y~0))))) (and (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))) (not (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~y) ((_ extract 30 23) ULTIMATE.start_fmin_float_~y) ((_ extract 22 0) ULTIMATE.start_fmin_float_~y)))) (fp.eq .cse1 .cse1))) (or (not |ULTIMATE.start_main_#t~short22|) .cse2) (or (not |ULTIMATE.start_main_#t~short23|) .cse2) (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse3 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse3 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse3))))) (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))) (let ((.cse5 (let ((.cse6 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse6 .cse6)))) (or (and (not .cse5) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse5))))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L59(line 59) the Hoare annotation is: (let ((.cse0 (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse1 .cse1)))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L59-1(line 59) the Hoare annotation is: (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) |ULTIMATE.start_main_#t~short19| (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L59-2(line 59) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short23|)) (.cse0 (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse4 .cse4))) (.cse3 (not |ULTIMATE.start_main_#t~short19|))) (or (and (not .cse0) .cse1 (or (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)) .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse3))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L59-3(line 59) the Hoare annotation is: (and (not |ULTIMATE.start_main_#t~short23|) (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0)) (not |ULTIMATE.start_main_#t~short19|) (let ((.cse1 (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)))) (or (and (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse1)))) [2020-10-24 15:11:58,302 INFO L270 CegarLoopResult]: At program point L59-4(line 59) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (or (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse1))))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmin_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmin_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmin_float_#res|)) .cse0)) (and (not (fp.eq .cse0 .cse0)) (not (let ((.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)))) (fp.eq .cse2 .cse2))) (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse3 .cse3)) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (let ((.cse4 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse4 .cse4))) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)))) [2020-10-24 15:11:58,303 INFO L270 CegarLoopResult]: At program point L59-5(line 59) the Hoare annotation is: (and (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (fp.eq .cse0 .cse0))) |ULTIMATE.start_main_#t~short27| (not (let ((.cse1 (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 .cse1 .cse1))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse3 .cse3))) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) [2020-10-24 15:11:58,303 INFO L270 CegarLoopResult]: At program point L59-6(line 59) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (let ((.cse4 (fp.eq .cse0 .cse0))) (let ((.cse3 (not .cse4))) (let ((.cse1 (or (and .cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse4 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))))) (or (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) .cse1 (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse2))))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmin_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmin_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmin_float_#res|)) .cse0)) (and .cse3 .cse1)))))) [2020-10-24 15:11:58,303 INFO L270 CegarLoopResult]: At program point L59-7(line 59) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (and (fp.eq (fp ((_ extract 31 31) ULTIMATE.start_main_~res~0) ((_ extract 30 23) ULTIMATE.start_main_~res~0) ((_ extract 22 0) ULTIMATE.start_main_~res~0)) .cse0) (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse1 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse1))))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmin_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmin_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmin_float_#res|)) .cse0) (let ((.cse2 (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse3 .cse3)))) (or (and (not .cse2) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse2))))) [2020-10-24 15:11:58,303 INFO L274 CegarLoopResult]: For program point L76(line 76) no Hoare annotation was computed. [2020-10-24 15:11:58,303 INFO L274 CegarLoopResult]: For program point L43(line 43) no Hoare annotation was computed. [2020-10-24 15:11:58,303 INFO L274 CegarLoopResult]: For program point L76-2(lines 76 79) no Hoare annotation was computed. [2020-10-24 15:11:58,304 INFO L274 CegarLoopResult]: For program point L43-2(line 43) no Hoare annotation was computed. [2020-10-24 15:11:58,304 INFO L270 CegarLoopResult]: At program point L43-3(lines 37 44) the Hoare annotation is: (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0)))) (or (and (not (fp.eq .cse0 .cse0)) (not (let ((.cse1 (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 .cse1 .cse1))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start_main_~y~0) ((_ extract 30 23) ULTIMATE.start_main_~y~0) ((_ extract 22 0) ULTIMATE.start_main_~y~0)))) (fp.eq .cse2 .cse2)) (= |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0) (not (let ((.cse3 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~x) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~x) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~x)))) (fp.eq .cse3 .cse3))) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (and (forall ((|v_ULTIMATE.start_fmin_float_#res_28| (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 30 23) |v_ULTIMATE.start_fmin_float_#res_28|) ((_ extract 22 0) |v_ULTIMATE.start_fmin_float_#res_28|)))) (or (fp.eq .cse4 (fp ((_ extract 31 31) ULTIMATE.start_main_~x~0) ((_ extract 30 23) ULTIMATE.start_main_~x~0) ((_ extract 22 0) ULTIMATE.start_main_~x~0))) (not (= (fp ((_ extract 31 31) ULTIMATE.start_fmin_float_~x) ((_ extract 30 23) ULTIMATE.start_fmin_float_~x) ((_ extract 22 0) ULTIMATE.start_fmin_float_~x)) .cse4))))) (fp.eq (fp ((_ extract 31 31) |ULTIMATE.start_fmin_float_#res|) ((_ extract 30 23) |ULTIMATE.start_fmin_float_#res|) ((_ extract 22 0) |ULTIMATE.start_fmin_float_#res|)) .cse0)))) [2020-10-24 15:11:58,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,334 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,335 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,343 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,344 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,353 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,355 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,366 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,368 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,384 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,386 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,390 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,391 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,412 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 03:11:58 BoogieIcfgContainer [2020-10-24 15:11:58,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 15:11:58,413 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-24 15:11:58,414 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-24 15:11:58,414 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-24 15:11:58,415 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 03:11:39" (3/4) ... [2020-10-24 15:11:58,423 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-24 15:11:58,444 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2020-10-24 15:11:58,445 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-10-24 15:11:58,446 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-24 15:11:58,446 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-24 15:11:58,491 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) [2020-10-24 15:11:58,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:11:58,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || !aux-isnan_float(x) && !isnan_float(y)-aux)) && 1bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) [2020-10-24 15:11:58,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:11:58,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && x == x) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-10-24 15:11:58,495 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && !(0bv32 == \result)) && x == x) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && x == w) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) [2020-10-24 15:11:58,496 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) [2020-10-24 15:11:58,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:11:58,497 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && res == y) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) [2020-10-24 15:11:58,498 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~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(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:11:58,499 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && res == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y [2020-10-24 15:11:58,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result))) [2020-10-24 15:11:58,500 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) [2020-10-24 15:11:58,563 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-24 15:11:58,564 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-24 15:11:58,566 INFO L168 Benchmark]: Toolchain (without parser) took 20952.39 ms. Allocated memory was 41.9 MB in the beginning and 88.1 MB in the end (delta: 46.1 MB). Free memory was 13.3 MB in the beginning and 21.5 MB in the end (delta: -8.2 MB). Peak memory consumption was 39.0 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,566 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 41.9 MB. Free memory is still 29.5 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-24 15:11:58,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.78 ms. Allocated memory is still 41.9 MB. Free memory was 27.8 MB in the beginning and 16.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.23 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 16.4 MB in the beginning and 34.6 MB in the end (delta: -18.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,569 INFO L168 Benchmark]: Boogie Preprocessor took 70.35 ms. Allocated memory is still 50.3 MB. Free memory was 34.6 MB in the beginning and 35.3 MB in the end (delta: -699.5 kB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,569 INFO L168 Benchmark]: RCFGBuilder took 1008.31 ms. Allocated memory is still 50.3 MB. Free memory was 35.3 MB in the beginning and 27.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,570 INFO L168 Benchmark]: TraceAbstraction took 19322.07 ms. Allocated memory was 50.3 MB in the beginning and 88.1 MB in the end (delta: 37.7 MB). Free memory was 27.1 MB in the beginning and 26.8 MB in the end (delta: 328.3 kB). Peak memory consumption was 47.8 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,570 INFO L168 Benchmark]: Witness Printer took 150.36 ms. Allocated memory is still 88.1 MB. Free memory was 26.8 MB in the beginning and 21.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-10-24 15:11:58,573 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29 ms. Allocated memory is still 41.9 MB. Free memory is still 29.5 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 306.78 ms. Allocated memory is still 41.9 MB. Free memory was 27.8 MB in the beginning and 16.5 MB in the end (delta: 11.3 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.23 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 16.4 MB in the beginning and 34.6 MB in the end (delta: -18.2 MB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 70.35 ms. Allocated memory is still 50.3 MB. Free memory was 34.6 MB in the beginning and 35.3 MB in the end (delta: -699.5 kB). Peak memory consumption was 4.9 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1008.31 ms. Allocated memory is still 50.3 MB. Free memory was 35.3 MB in the beginning and 27.6 MB in the end (delta: 7.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19322.07 ms. Allocated memory was 50.3 MB in the beginning and 88.1 MB in the end (delta: 37.7 MB). Free memory was 27.1 MB in the beginning and 26.8 MB in the end (delta: 328.3 kB). Peak memory consumption was 47.8 MB. Max. memory is 16.1 GB. * Witness Printer took 150.36 ms. Allocated memory is still 88.1 MB. Free memory was 26.8 MB in the beginning and 21.5 MB in the end (delta: 5.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 3]: 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: 17]: Loop Invariant Derived loop invariant: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && x == x) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && x == x) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) - InvariantResult [Line: 37]: Loop Invariant [2020-10-24 15:11:58,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,608 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,609 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,617 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,618 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,619 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) - InvariantResult [Line: 59]: Loop Invariant [2020-10-24 15:11:58,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,620 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,621 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,622 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,623 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: ((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 59]: Loop Invariant [2020-10-24 15:11:58,624 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,625 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,626 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,627 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 1bv32 == \result) || (~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result))) - InvariantResult [Line: 17]: Loop Invariant [2020-10-24 15:11:58,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,628 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,629 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: ((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && aux-isnan_float(x) && !isnan_float(y)-aux) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && res == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y - InvariantResult [Line: 14]: Loop Invariant [2020-10-24 15:11:58,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,637 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,638 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,639 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,640 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: ((((((!~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(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 59]: Loop Invariant [2020-10-24 15:11:58,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,641 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,642 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] [2020-10-24 15:11:58,644 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_fmin_float_#res_28,QUANTIFIED] Derived loop invariant: (((~fp.eq~FLOAT(~fp~LONGDOUBLE(res[31:31], res[30:23], res[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && 0bv32 == \result) && (forall v_ULTIMATE.start_fmin_float_#res_28 : bv32 :: ~fp.eq~FLOAT(~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) || !(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]) == ~fp~LONGDOUBLE(v_ULTIMATE.start_fmin_float_#res_28[31:31], v_ULTIMATE.start_fmin_float_#res_28[30:23], v_ULTIMATE.start_fmin_float_#res_28[22:0])))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(\result[31:31], \result[30:23], \result[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) || (((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && \result == y) && res == y) && 1bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !~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]))) && 0bv32 == \result) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))) && 0bv32 == \result) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && y == y) || ((((((((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && !(0bv32 == \result)) && x == x) && (!aux-!isnan_float(x) && isnan_float(y)-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && x == x) && (!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux || (!(0bv32 == ~bvadd64(y, 2147483648bv32)) && !(0bv32 == y)))) && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && x == w) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]))))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: ((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((!~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])))) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: (((!~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0])) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && (~fp.eq~FLOAT(~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0]), ~fp~LONGDOUBLE(y[31:31], y[30:23], y[22:0])) || !aux-isnan_float(x) && !isnan_float(y)-aux)) && 1bv32 == \result) || (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && ~fp.eq~FLOAT(~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]), ~fp~LONGDOUBLE(x[31:31], x[30:23], x[22:0]))) && 0bv32 == \result) && !aux-isnan_float(x) && !isnan_float(y)-aux) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 49 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 7.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1006 SDtfs, 1874 SDslu, 3332 SDs, 0 SdLazy, 1501 SolverSat, 204 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 948 GetRequests, 753 SyntacticMatches, 5 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=9, 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, 18 MinimizatonAttempts, 363 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 35 NumberOfFragments, 1468 HoareAnnotationTreeSize, 14 FomulaSimplifications, 127671 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 14 FomulaSimplificationsInter, 23534 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 864 ConstructedInterpolants, 12 QuantifiedInterpolants, 145804 SizeOfPredicates, 101 NumberOfNonLiveVariables, 1528 ConjunctsInSsa, 137 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...