./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 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:50:59,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:50:59,231 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:50:59,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:50:59,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:50:59,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:50:59,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:50:59,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:50:59,251 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:50:59,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:50:59,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:50:59,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:50:59,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:50:59,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:50:59,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:50:59,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:50:59,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:50:59,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:50:59,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:50:59,265 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:50:59,267 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:50:59,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:50:59,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:50:59,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:50:59,278 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:50:59,278 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:50:59,278 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:50:59,280 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:50:59,280 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:50:59,281 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:50:59,282 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:50:59,282 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:50:59,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:50:59,285 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:50:59,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:50:59,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:50:59,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:50:59,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:50:59,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:50:59,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:50:59,294 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:50:59,296 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:50:59,316 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:50:59,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:50:59,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:50:59,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:50:59,320 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:50:59,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:50:59,320 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:50:59,320 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:50:59,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:50:59,321 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:50:59,322 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:50:59,322 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:50:59,322 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:50:59,323 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:50:59,323 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:50:59,323 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:50:59,323 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:50:59,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:50:59,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:50:59,324 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:50:59,324 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:50:59,324 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:50:59,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:50:59,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:50:59,325 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:50:59,325 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:50:59,326 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:50:59,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:50:59,326 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-27 23:50:59,639 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:50:59,655 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:50:59,663 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:50:59,665 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:50:59,666 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:50:59,667 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-27 23:50:59,743 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876fa9c72/1276ed33cfd54dc8b6d5951e8d9dc3a6/FLAG3ed546782 [2019-11-27 23:51:00,255 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:00,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-27 23:51:00,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876fa9c72/1276ed33cfd54dc8b6d5951e8d9dc3a6/FLAG3ed546782 [2019-11-27 23:51:00,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/876fa9c72/1276ed33cfd54dc8b6d5951e8d9dc3a6 [2019-11-27 23:51:00,617 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:00,619 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:00,620 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:00,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:00,624 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:00,626 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:00" (1/1) ... [2019-11-27 23:51:00,629 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@717e9a17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:00, skipping insertion in model container [2019-11-27 23:51:00,629 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:00" (1/1) ... [2019-11-27 23:51:00,638 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:00,660 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:00,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:00,891 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:00,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:01,021 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:01,022 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01 WrapperNode [2019-11-27 23:51:01,022 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:01,023 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:01,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:01,023 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:01,032 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,042 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:01,088 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:01,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:01,089 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:01,099 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,107 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,127 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,133 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... [2019-11-27 23:51:01,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:01,148 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:01,148 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:01,148 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:01,149 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:51:01,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:01,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:51:01,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:01,704 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:01,704 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:51:01,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:01 BoogieIcfgContainer [2019-11-27 23:51:01,706 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:01,707 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:01,707 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:01,710 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:01,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:00" (1/3) ... [2019-11-27 23:51:01,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a534f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:01, skipping insertion in model container [2019-11-27 23:51:01,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:01" (2/3) ... [2019-11-27 23:51:01,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a534f6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:01, skipping insertion in model container [2019-11-27 23:51:01,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:01" (3/3) ... [2019-11-27 23:51:01,714 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-27 23:51:01,721 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:01,729 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-27 23:51:01,742 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-27 23:51:01,766 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:01,766 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:01,766 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:01,766 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:01,768 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:01,768 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:01,768 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:01,768 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:01,783 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:51:01,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:51:01,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:01,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:01,792 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:01,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:01,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-27 23:51:01,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:01,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781124972] [2019-11-27 23:51:01,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:01,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:01,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:01,960 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781124972] [2019-11-27 23:51:01,961 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:01,961 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:01,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738431540] [2019-11-27 23:51:01,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:01,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:01,983 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-27 23:51:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:02,091 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-27 23:51:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:51:02,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-27 23:51:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:02,104 INFO L225 Difference]: With dead ends: 90 [2019-11-27 23:51:02,105 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:51:02,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:02,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:51:02,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-27 23:51:02,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 23:51:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-27 23:51:02,143 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-27 23:51:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:02,144 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-27 23:51:02,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-27 23:51:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:02,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:02,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:02,146 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-27 23:51:02,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:02,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699118487] [2019-11-27 23:51:02,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:02,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:02,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:02,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699118487] [2019-11-27 23:51:02,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:02,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 23:51:02,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167140659] [2019-11-27 23:51:02,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:02,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:02,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:02,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:02,228 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-27 23:51:02,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:02,282 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-27 23:51:02,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:02,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-27 23:51:02,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:02,284 INFO L225 Difference]: With dead ends: 77 [2019-11-27 23:51:02,285 INFO L226 Difference]: Without dead ends: 64 [2019-11-27 23:51:02,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:02,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-27 23:51:02,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-27 23:51:02,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:51:02,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-27 23:51:02,294 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-27 23:51:02,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:02,295 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-27 23:51:02,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:02,295 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-27 23:51:02,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:51:02,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:02,297 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:02,297 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:02,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:02,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-27 23:51:02,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:02,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632416383] [2019-11-27 23:51:02,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:02,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:02,388 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632416383] [2019-11-27 23:51:02,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:02,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:51:02,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247109393] [2019-11-27 23:51:02,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:51:02,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:51:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:51:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:02,390 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-27 23:51:02,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:02,418 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-27 23:51:02,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:51:02,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-27 23:51:02,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:02,420 INFO L225 Difference]: With dead ends: 50 [2019-11-27 23:51:02,421 INFO L226 Difference]: Without dead ends: 48 [2019-11-27 23:51:02,421 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-27 23:51:02,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-27 23:51:02,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-27 23:51:02,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-27 23:51:02,429 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-27 23:51:02,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:02,429 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-27 23:51:02,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:51:02,429 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-27 23:51:02,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:51:02,431 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:02,431 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:02,431 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:02,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:02,432 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-27 23:51:02,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:51:02,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800217246] [2019-11-27 23:51:02,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:51:02,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:51:02,562 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:51:02,562 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:51:02,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:02 BoogieIcfgContainer [2019-11-27 23:51:02,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:02,604 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:02,604 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:02,604 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:02,604 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:01" (3/4) ... [2019-11-27 23:51:02,608 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:51:02,608 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:02,610 INFO L168 Benchmark]: Toolchain (without parser) took 1990.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.0 GB in the end (delta: -94.2 MB). Peak memory consumption was 46.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:02,611 INFO L168 Benchmark]: CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:02,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:02,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:02,613 INFO L168 Benchmark]: Boogie Preprocessor took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:02,614 INFO L168 Benchmark]: RCFGBuilder took 558.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:02,615 INFO L168 Benchmark]: TraceAbstraction took 896.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:02,615 INFO L168 Benchmark]: Witness Printer took 4.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:02,620 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.62 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 951.0 MB in the beginning and 1.1 GB in the end (delta: -180.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 65.14 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.48 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 558.00 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 896.54 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * Witness Printer took 4.22 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L71] float res = fmin_float(x, y); [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:51:04,710 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:51:04,712 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:51:04,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:51:04,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:51:04,733 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:51:04,735 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:51:04,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:51:04,750 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:51:04,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:51:04,756 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:51:04,758 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:51:04,759 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:51:04,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:51:04,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:51:04,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:51:04,766 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:51:04,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:51:04,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:51:04,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:51:04,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:51:04,784 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:51:04,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:51:04,788 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:51:04,791 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:51:04,791 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:51:04,791 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:51:04,792 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:51:04,793 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:51:04,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:51:04,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:51:04,794 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:51:04,795 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:51:04,796 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:51:04,797 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:51:04,797 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:51:04,798 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:51:04,798 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:51:04,798 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:51:04,799 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:51:04,799 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:51:04,800 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:51:04,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:51:04,815 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:51:04,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:51:04,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:51:04,817 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:51:04,817 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:51:04,817 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:51:04,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:51:04,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:51:04,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:51:04,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:51:04,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:51:04,818 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:51:04,819 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:51:04,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:51:04,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:51:04,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:51:04,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:51:04,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:51:04,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:51:04,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:51:04,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:51:04,821 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:04,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:51:04,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:51:04,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:51:04,822 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:51:04,822 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:51:04,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:51:04,822 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:51:04,823 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-27 23:51:05,181 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:51:05,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:51:05,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:51:05,208 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:51:05,208 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:51:05,210 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-27 23:51:05,283 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13975d15b/328f8e7f330d4e1d8bc8c3c2551bbd8d/FLAGf401ce4a8 [2019-11-27 23:51:05,760 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:51:05,761 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-27 23:51:05,768 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13975d15b/328f8e7f330d4e1d8bc8c3c2551bbd8d/FLAGf401ce4a8 [2019-11-27 23:51:06,144 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13975d15b/328f8e7f330d4e1d8bc8c3c2551bbd8d [2019-11-27 23:51:06,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:51:06,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:51:06,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:06,156 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:51:06,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:51:06,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381b270f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06, skipping insertion in model container [2019-11-27 23:51:06,164 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,172 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:51:06,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:51:06,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:06,488 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:51:06,593 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:51:06,627 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:51:06,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06 WrapperNode [2019-11-27 23:51:06,628 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:51:06,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:06,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:51:06,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:51:06,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,651 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,693 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:51:06,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:51:06,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:51:06,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:51:06,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,708 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,719 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... [2019-11-27 23:51:06,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:51:06,733 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:51:06,733 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:51:06,733 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:51:06,734 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:51:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:51:06,798 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:51:06,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:51:06,800 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:51:06,800 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-27 23:51:06,800 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:51:07,311 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:51:07,312 INFO L297 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-27 23:51:07,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:07 BoogieIcfgContainer [2019-11-27 23:51:07,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:51:07,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:51:07,315 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:51:07,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:51:07,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:51:06" (1/3) ... [2019-11-27 23:51:07,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1862e1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:07, skipping insertion in model container [2019-11-27 23:51:07,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:51:06" (2/3) ... [2019-11-27 23:51:07,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1862e1c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:51:07, skipping insertion in model container [2019-11-27 23:51:07,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:07" (3/3) ... [2019-11-27 23:51:07,322 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-27 23:51:07,333 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:51:07,341 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-27 23:51:07,355 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-27 23:51:07,382 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:51:07,382 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:51:07,382 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:51:07,382 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:51:07,383 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:51:07,383 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:51:07,383 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:51:07,383 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:51:07,400 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-27 23:51:07,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-27 23:51:07,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:07,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:07,409 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:07,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-27 23:51:07,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:07,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953629997] [2019-11-27 23:51:07,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:07,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:51:07,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:07,573 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:07,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953629997] [2019-11-27 23:51:07,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:07,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:51:07,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370031605] [2019-11-27 23:51:07,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:51:07,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:07,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:51:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:07,602 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-27 23:51:07,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:07,622 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-27 23:51:07,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:51:07,623 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-27 23:51:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:07,636 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:07,636 INFO L226 Difference]: Without dead ends: 43 [2019-11-27 23:51:07,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:51:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-27 23:51:07,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-27 23:51:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:51:07,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-27 23:51:07,684 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-27 23:51:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:07,684 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-27 23:51:07,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:51:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-27 23:51:07,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-27 23:51:07,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:07,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:07,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:51:07,889 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:07,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:07,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-27 23:51:07,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:07,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058052885] [2019-11-27 23:51:07,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:07,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:07,966 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:07,968 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:08,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:08,001 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:08,007 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:08,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058052885] [2019-11-27 23:51:08,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:08,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:51:08,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378779430] [2019-11-27 23:51:08,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:08,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:08,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:08,022 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-27 23:51:08,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:08,131 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-27 23:51:08,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 23:51:08,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-27 23:51:08,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:08,136 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:08,136 INFO L226 Difference]: Without dead ends: 50 [2019-11-27 23:51:08,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:08,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-27 23:51:08,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-27 23:51:08,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-27 23:51:08,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-27 23:51:08,162 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-27 23:51:08,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:08,163 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-27 23:51:08,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:08,164 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-27 23:51:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:51:08,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:08,168 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:08,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:51:08,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-27 23:51:08,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:08,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [873162043] [2019-11-27 23:51:08,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:08,447 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:08,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:08,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:08,474 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:08,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:08,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [873162043] [2019-11-27 23:51:08,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:08,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:08,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257969931] [2019-11-27 23:51:08,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:08,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:08,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:08,499 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-27 23:51:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:08,644 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-27 23:51:08,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:08,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-27 23:51:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:08,646 INFO L225 Difference]: With dead ends: 96 [2019-11-27 23:51:08,647 INFO L226 Difference]: Without dead ends: 83 [2019-11-27 23:51:08,648 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:51:08,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-27 23:51:08,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-27 23:51:08,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-27 23:51:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-27 23:51:08,656 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-27 23:51:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:08,656 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-27 23:51:08,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-27 23:51:08,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 23:51:08,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:08,658 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:08,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:51:08,880 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:08,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:08,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-27 23:51:08,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:08,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [449721698] [2019-11-27 23:51:08,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:08,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:08,978 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:09,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:09,004 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:09,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:09,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:09,070 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:09,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:09,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:09,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:09,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [449721698] [2019-11-27 23:51:09,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:09,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 23:51:09,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56001350] [2019-11-27 23:51:09,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:09,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:09,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:09,151 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-27 23:51:11,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:11,784 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-11-27 23:51:11,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:51:11,784 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-27 23:51:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:11,786 INFO L225 Difference]: With dead ends: 146 [2019-11-27 23:51:11,787 INFO L226 Difference]: Without dead ends: 137 [2019-11-27 23:51:11,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:11,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-27 23:51:11,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-11-27 23:51:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-27 23:51:11,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-27 23:51:11,806 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-27 23:51:11,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:11,808 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-27 23:51:11,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:11,809 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-27 23:51:11,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:51:11,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:11,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:12,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,027 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:12,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:12,028 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-27 23:51:12,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:12,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [304949351] [2019-11-27 23:51:12,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:12,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:12,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:12,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:12,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,289 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:12,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:12,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:12,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [304949351] [2019-11-27 23:51:12,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:12,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-27 23:51:12,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051149036] [2019-11-27 23:51:12,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:51:12,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:51:12,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:12,431 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-27 23:51:13,271 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-11-27 23:51:13,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:13,446 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-27 23:51:13,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-27 23:51:13,451 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-27 23:51:13,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:13,453 INFO L225 Difference]: With dead ends: 180 [2019-11-27 23:51:13,453 INFO L226 Difference]: Without dead ends: 178 [2019-11-27 23:51:13,454 INFO L630 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 [2019-11-27 23:51:13,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-27 23:51:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-27 23:51:13,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:13,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-27 23:51:13,486 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-27 23:51:13,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:13,487 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-27 23:51:13,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:51:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-27 23:51:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-27 23:51:13,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:13,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:13,689 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:51:13,690 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:13,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:13,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-27 23:51:13,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:13,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014291229] [2019-11-27 23:51:13,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:13,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:13,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:13,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:13,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,882 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:13,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,905 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:13,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014291229] [2019-11-27 23:51:13,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:13,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-27 23:51:13,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070778942] [2019-11-27 23:51:13,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:51:13,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:13,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:51:13,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:51:13,928 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-27 23:51:14,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:14,493 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-27 23:51:14,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:14,495 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-27 23:51:14,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:14,496 INFO L225 Difference]: With dead ends: 166 [2019-11-27 23:51:14,496 INFO L226 Difference]: Without dead ends: 131 [2019-11-27 23:51:14,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:14,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-27 23:51:14,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-27 23:51:14,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:14,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-27 23:51:14,508 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-27 23:51:14,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:14,509 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-27 23:51:14,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:51:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-27 23:51:14,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:51:14,512 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:14,512 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:14,713 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-27 23:51:14,714 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-27 23:51:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:14,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81500484] [2019-11-27 23:51:14,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:14,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:14,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:14,798 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:14,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:14,819 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:14,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81500484] [2019-11-27 23:51:14,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:14,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-27 23:51:14,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876871044] [2019-11-27 23:51:14,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 23:51:14,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:14,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 23:51:14,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 23:51:14,845 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-27 23:51:14,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:14,976 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-27 23:51:14,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:51:14,976 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-27 23:51:14,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:14,978 INFO L225 Difference]: With dead ends: 157 [2019-11-27 23:51:14,978 INFO L226 Difference]: Without dead ends: 141 [2019-11-27 23:51:14,979 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:51:14,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-27 23:51:14,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-27 23:51:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 23:51:14,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-27 23:51:14,991 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-27 23:51:14,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:14,991 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-27 23:51:14,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 23:51:14,991 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-27 23:51:14,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-27 23:51:14,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:14,993 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:15,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-27 23:51:15,206 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:15,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:15,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-27 23:51:15,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:15,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948041579] [2019-11-27 23:51:15,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:15,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:15,290 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:51:15,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:15,301 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:15,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:15,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948041579] [2019-11-27 23:51:15,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:15,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 23:51:15,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246537780] [2019-11-27 23:51:15,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:51:15,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:15,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:51:15,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:15,310 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-27 23:51:15,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:15,346 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-27 23:51:15,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:51:15,347 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-27 23:51:15,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:15,351 INFO L225 Difference]: With dead ends: 96 [2019-11-27 23:51:15,351 INFO L226 Difference]: Without dead ends: 94 [2019-11-27 23:51:15,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:51:15,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-27 23:51:15,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-27 23:51:15,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-27 23:51:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-27 23:51:15,365 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-27 23:51:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:15,366 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-27 23:51:15,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:51:15,367 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-27 23:51:15,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:15,368 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:15,368 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:15,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-27 23:51:15,584 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:15,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:15,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-27 23:51:15,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:15,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534870312] [2019-11-27 23:51:15,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:15,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:15,649 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:15,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:15,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:15,698 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:15,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:15,728 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:15,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:15,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:15,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534870312] [2019-11-27 23:51:15,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:15,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-27 23:51:15,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270903634] [2019-11-27 23:51:15,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:15,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:15,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:15,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:15,802 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-27 23:51:16,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:16,207 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-27 23:51:16,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-27 23:51:16,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-27 23:51:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:16,209 INFO L225 Difference]: With dead ends: 131 [2019-11-27 23:51:16,209 INFO L226 Difference]: Without dead ends: 118 [2019-11-27 23:51:16,210 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-27 23:51:16,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-27 23:51:16,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-27 23:51:16,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-27 23:51:16,219 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-27 23:51:16,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:16,220 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-27 23:51:16,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:16,220 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-27 23:51:16,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:16,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:16,221 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:16,440 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-27 23:51:16,441 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-27 23:51:16,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:16,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325697033] [2019-11-27 23:51:16,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:16,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:16,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-27 23:51:16,499 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:16,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:16,589 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:16,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:16,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:16,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325697033] [2019-11-27 23:51:16,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:16,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-27 23:51:16,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326922414] [2019-11-27 23:51:16,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 23:51:16,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 23:51:16,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:51:16,655 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-27 23:51:17,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:17,119 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-27 23:51:17,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:17,120 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-27 23:51:17,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:17,121 INFO L225 Difference]: With dead ends: 114 [2019-11-27 23:51:17,121 INFO L226 Difference]: Without dead ends: 78 [2019-11-27 23:51:17,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:51:17,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-27 23:51:17,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-27 23:51:17,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-27 23:51:17,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-27 23:51:17,130 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-27 23:51:17,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:17,130 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-27 23:51:17,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 23:51:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-27 23:51:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 23:51:17,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:17,131 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:17,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-27 23:51:17,337 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-27 23:51:17,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:17,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123079505] [2019-11-27 23:51:17,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:17,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:17,402 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:17,404 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:17,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,457 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:17,475 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:17,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:17,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:17,520 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123079505] [2019-11-27 23:51:17,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:17,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-27 23:51:17,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110832726] [2019-11-27 23:51:17,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:51:17,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:17,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:51:17,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:51:17,522 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-27 23:51:17,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:17,806 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-27 23:51:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:51:17,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-27 23:51:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:17,808 INFO L225 Difference]: With dead ends: 84 [2019-11-27 23:51:17,808 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:51:17,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-27 23:51:17,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:51:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:51:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:51:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-27 23:51:17,816 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-27 23:51:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-27 23:51:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:51:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-27 23:51:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:51:17,817 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:17,817 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:18,029 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-27 23:51:18,030 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:18,031 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-27 23:51:18,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:18,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [769551069] [2019-11-27 23:51:18,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:18,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:18,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-27 23:51:18,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:18,130 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:18,131 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:18,183 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:18,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:18,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:18,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [769551069] [2019-11-27 23:51:18,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:18,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-27 23:51:18,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819419459] [2019-11-27 23:51:18,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:18,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:18,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:18,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:18,503 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-27 23:51:18,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:18,975 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-27 23:51:18,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 23:51:18,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-27 23:51:18,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:18,977 INFO L225 Difference]: With dead ends: 82 [2019-11-27 23:51:18,979 INFO L226 Difference]: Without dead ends: 74 [2019-11-27 23:51:18,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:51:18,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-27 23:51:18,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-27 23:51:18,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-27 23:51:18,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-27 23:51:18,987 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-27 23:51:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:18,987 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-27 23:51:18,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-27 23:51:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:51:18,988 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:18,988 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:19,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-27 23:51:19,203 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-27 23:51:19,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:19,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717860093] [2019-11-27 23:51:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:19,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:19,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-27 23:51:19,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:19,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:19,437 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:19,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:19,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:19,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717860093] [2019-11-27 23:51:19,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:19,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-27 23:51:19,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614469072] [2019-11-27 23:51:19,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-27 23:51:19,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:19,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-27 23:51:19,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-27 23:51:19,670 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-27 23:51:21,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:21,180 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-27 23:51:21,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-27 23:51:21,181 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-27 23:51:21,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:21,182 INFO L225 Difference]: With dead ends: 154 [2019-11-27 23:51:21,183 INFO L226 Difference]: Without dead ends: 134 [2019-11-27 23:51:21,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-27 23:51:21,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-27 23:51:21,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-27 23:51:21,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-27 23:51:21,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-27 23:51:21,191 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-27 23:51:21,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:21,192 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-27 23:51:21,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-27 23:51:21,192 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-27 23:51:21,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-27 23:51:21,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:21,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:21,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-27 23:51:21,398 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:21,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-27 23:51:21,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:21,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183786410] [2019-11-27 23:51:21,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:21,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-27 23:51:21,461 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:21,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:21,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:21,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:21,803 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-27 23:51:21,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:21,809 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:21,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:21,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:21,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183786410] [2019-11-27 23:51:21,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:21,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-27 23:51:21,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87210167] [2019-11-27 23:51:21,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-27 23:51:21,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:21,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-27 23:51:21,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:21,996 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-27 23:51:23,499 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2019-11-27 23:51:24,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:24,325 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-27 23:51:24,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-27 23:51:24,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-27 23:51:24,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:24,327 INFO L225 Difference]: With dead ends: 195 [2019-11-27 23:51:24,327 INFO L226 Difference]: Without dead ends: 158 [2019-11-27 23:51:24,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-27 23:51:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-27 23:51:24,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-27 23:51:24,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-27 23:51:24,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-27 23:51:24,337 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-27 23:51:24,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:24,337 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-27 23:51:24,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-27 23:51:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-27 23:51:24,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-27 23:51:24,338 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:24,338 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:24,551 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-27 23:51:24,552 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-27 23:51:24,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:24,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932363185] [2019-11-27 23:51:24,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:24,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:24,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-27 23:51:24,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:24,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:24,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:24,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:24,867 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:24,992 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:25,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932363185] [2019-11-27 23:51:25,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:25,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-27 23:51:25,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954172305] [2019-11-27 23:51:25,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:51:25,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:25,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:51:25,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:51:25,034 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-27 23:51:26,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:26,093 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-27 23:51:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-27 23:51:26,094 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-27 23:51:26,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:26,095 INFO L225 Difference]: With dead ends: 125 [2019-11-27 23:51:26,095 INFO L226 Difference]: Without dead ends: 101 [2019-11-27 23:51:26,096 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-27 23:51:26,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-27 23:51:26,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-27 23:51:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:51:26,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-27 23:51:26,102 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-27 23:51:26,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:26,102 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-27 23:51:26,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:51:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-27 23:51:26,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:51:26,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:26,103 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:26,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-27 23:51:26,304 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-27 23:51:26,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:26,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766969542] [2019-11-27 23:51:26,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:26,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-27 23:51:26,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:26,449 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:26,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:26,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766969542] [2019-11-27 23:51:26,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:26,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-27 23:51:26,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439550981] [2019-11-27 23:51:26,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-27 23:51:26,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:26,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-27 23:51:26,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-27 23:51:26,661 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-27 23:51:27,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:27,271 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-27 23:51:27,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 23:51:27,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-27 23:51:27,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:27,272 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:51:27,272 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 23:51:27,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-27 23:51:27,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 23:51:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-27 23:51:27,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-27 23:51:27,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-27 23:51:27,279 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-27 23:51:27,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:27,280 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-27 23:51:27,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-27 23:51:27,280 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-27 23:51:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 23:51:27,280 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:27,281 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:27,486 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-27 23:51:27,486 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:27,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:27,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-27 23:51:27,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:27,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706432731] [2019-11-27 23:51:27,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:27,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:27,584 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-27 23:51:27,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:27,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:27,679 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:27,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:27,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:27,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706432731] [2019-11-27 23:51:27,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:27,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-27 23:51:27,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535718060] [2019-11-27 23:51:27,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-27 23:51:27,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:27,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-27 23:51:27,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-27 23:51:27,821 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-27 23:51:28,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:28,775 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-27 23:51:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-27 23:51:28,776 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-27 23:51:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:28,776 INFO L225 Difference]: With dead ends: 55 [2019-11-27 23:51:28,777 INFO L226 Difference]: Without dead ends: 41 [2019-11-27 23:51:28,777 INFO L630 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 [2019-11-27 23:51:28,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-27 23:51:28,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-27 23:51:28,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:51:28,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-27 23:51:28,785 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-27 23:51:28,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:28,785 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-27 23:51:28,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-27 23:51:28,785 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-27 23:51:28,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-27 23:51:28,786 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:28,786 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:28,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-27 23:51:28,987 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:28,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:28,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-27 23:51:28,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:28,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1746851897] [2019-11-27 23:51:28,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:29,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:29,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-27 23:51:29,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:29,114 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:29,187 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:29,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:51:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:29,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1746851897] [2019-11-27 23:51:29,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:29,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-27 23:51:29,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974463384] [2019-11-27 23:51:29,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-27 23:51:29,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:29,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-27 23:51:29,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:51:29,311 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-27 23:51:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:29,920 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-27 23:51:29,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:51:29,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-27 23:51:29,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:29,921 INFO L225 Difference]: With dead ends: 79 [2019-11-27 23:51:29,921 INFO L226 Difference]: Without dead ends: 61 [2019-11-27 23:51:29,922 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-27 23:51:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-27 23:51:29,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-27 23:51:29,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-27 23:51:29,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-27 23:51:29,927 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-27 23:51:29,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:29,927 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-27 23:51:29,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-27 23:51:29,928 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-27 23:51:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 23:51:29,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:51:29,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:51:30,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,140 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:51:30,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:51:30,141 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-27 23:51:30,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:51:30,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362605300] [2019-11-27 23:51:30,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:51:30,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-27 23:51:30,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:51:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:30,226 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:51:30,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:51:30,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [362605300] [2019-11-27 23:51:30,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:51:30,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-27 23:51:30,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235892673] [2019-11-27 23:51:30,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 23:51:30,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:51:30,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 23:51:30,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 23:51:30,229 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-27 23:51:30,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:51:30,265 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-27 23:51:30,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 23:51:30,266 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-27 23:51:30,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:51:30,266 INFO L225 Difference]: With dead ends: 39 [2019-11-27 23:51:30,266 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:51:30,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 23:51:30,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:51:30,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:51:30,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:51:30,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:51:30,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-27 23:51:30,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:51:30,271 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:51:30,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 23:51:30,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:51:30,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:51:30,471 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-27 23:51:30,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:51:30,704 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-11-27 23:51:30,849 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 135 [2019-11-27 23:51:31,904 WARN L192 SmtUtils]: Spent 783.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-27 23:51:32,888 WARN L192 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-11-27 23:51:33,466 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-27 23:51:33,811 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-27 23:51:34,079 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-27 23:51:34,418 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-27 23:51:34,949 WARN L192 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-11-27 23:51:35,660 WARN L192 SmtUtils]: Spent 709.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-11-27 23:51:35,910 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-27 23:51:35,950 INFO L246 CegarLoopResult]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-27 23:51:35,950 INFO L246 CegarLoopResult]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-27 23:51:35,950 INFO L246 CegarLoopResult]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-27 23:51:35,950 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L249 CegarLoopResult]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-27 23:51:35,951 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-27 23:51:35,952 INFO L242 CegarLoopResult]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-27 23:51:35,952 INFO L246 CegarLoopResult]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-27 23:51:35,953 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-27 23:51:35,953 INFO L242 CegarLoopResult]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-27 23:51:35,953 INFO L246 CegarLoopResult]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse1 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse2) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-27 23:51:35,954 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (not .cse3) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-27 23:51:35,954 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (not .cse0)))) [2019-11-27 23:51:35,954 INFO L242 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-11-27 23:51:35,955 INFO L242 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (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))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1))) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-27 23:51:35,955 INFO L242 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and .cse0 |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-27 23:51:35,955 INFO L242 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-11-27 23:51:35,955 INFO L242 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-27 23:51:35,955 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-27 23:51:35,955 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-27 23:51:35,955 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L242 CegarLoopResult]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse2) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-27 23:51:35,956 INFO L246 CegarLoopResult]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-27 23:51:35,987 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:51:35 BoogieIcfgContainer [2019-11-27 23:51:35,987 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:51:35,988 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:51:35,988 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:51:35,988 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:51:35,989 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:51:07" (3/4) ... [2019-11-27 23:51:35,992 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-27 23:51:36,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-27 23:51:36,010 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-27 23:51:36,011 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-27 23:51:36,041 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:36,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-27 23:51:36,042 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:36,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-27 23:51:36,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-27 23:51:36,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-27 23:51:36,043 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-27 23:51:36,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-27 23:51:36,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-27 23:51:36,044 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-27 23:51:36,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) [2019-11-27 23:51:36,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-27 23:51:36,045 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-27 23:51:36,086 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 23:51:36,086 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:51:36,088 INFO L168 Benchmark]: Toolchain (without parser) took 29939.04 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 346.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -98.9 MB). Peak memory consumption was 247.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,088 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:36,089 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,089 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,089 INFO L168 Benchmark]: Boogie Preprocessor took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:51:36,090 INFO L168 Benchmark]: RCFGBuilder took 581.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,090 INFO L168 Benchmark]: TraceAbstraction took 28673.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 418.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,090 INFO L168 Benchmark]: Witness Printer took 98.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2019-11-27 23:51:36,093 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -169.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 64.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.05 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 581.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 28673.03 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 205.0 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.4 MB). Peak memory consumption was 418.5 MB. Max. memory is 11.5 GB. * Witness Printer took 98.63 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: 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: 35]: Loop Invariant Derived loop invariant: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 23.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 5.4s, HoareTripleCheckerStatistics: 1147 SDtfs, 2730 SDslu, 4439 SDs, 0 SdLazy, 1925 SolverSat, 267 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 605 HoareAnnotationTreeSize, 14 FomulaSimplifications, 572522 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62940 FormulaSimplificationTreeSizeReductionInter, 4.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93581 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...