./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 ............................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1231b.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 c714d208cb0b1f96f572e8a6108248eb76c73a94 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 21:12:26,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:26,205 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:26,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:26,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:26,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:26,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:26,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:26,225 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:26,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:26,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:26,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:26,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:26,229 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:26,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:26,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:26,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:26,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:26,236 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:26,238 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:26,240 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:26,241 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:26,242 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:26,243 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:26,245 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:26,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:26,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:26,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:26,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:26,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:26,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:26,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:26,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:26,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:26,252 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:26,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:26,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:26,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:26,254 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:26,255 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:26,256 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:26,256 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:12:26,274 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:26,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:26,276 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:26,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:26,277 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:26,277 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:26,277 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:26,278 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:12:26,278 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:26,278 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:26,279 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:26,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:26,280 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:26,280 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:26,281 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:26,281 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:26,281 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:26,281 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:26,282 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:26,282 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:26,283 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:26,283 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:26,283 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:26,283 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:26,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:26,284 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:12:26,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:12:26,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:26,285 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-19 21:12:26,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:26,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:26,671 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:26,673 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:26,676 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:26,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 21:12:26,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75987b86/7cbab687acaf4807a46639691e075808/FLAGf6f06ce25 [2019-11-19 21:12:27,264 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:27,265 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 21:12:27,274 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75987b86/7cbab687acaf4807a46639691e075808/FLAGf6f06ce25 [2019-11-19 21:12:27,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a75987b86/7cbab687acaf4807a46639691e075808 [2019-11-19 21:12:27,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:27,618 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:27,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:27,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:27,623 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:27,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:27" (1/1) ... [2019-11-19 21:12:27,628 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25c2d6dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:27, skipping insertion in model container [2019-11-19 21:12:27,628 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:27" (1/1) ... [2019-11-19 21:12:27,636 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:27,656 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:27,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:27,892 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:27,944 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:28,039 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:28,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28 WrapperNode [2019-11-19 21:12:28,040 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:28,041 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:28,042 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:28,042 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:28,051 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,071 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,113 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:28,115 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:28,115 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:28,116 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:28,126 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,144 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (1/1) ... [2019-11-19 21:12:28,149 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:28,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:28,150 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:28,150 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:28,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (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-19 21:12:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 21:12:28,212 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:28,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 21:12:28,213 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:28,636 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:28,636 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-19 21:12:28,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:28 BoogieIcfgContainer [2019-11-19 21:12:28,638 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:28,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:28,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:28,642 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:28,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:27" (1/3) ... [2019-11-19 21:12:28,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ede67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:28, skipping insertion in model container [2019-11-19 21:12:28,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:28" (2/3) ... [2019-11-19 21:12:28,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78ede67b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:28, skipping insertion in model container [2019-11-19 21:12:28,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:28" (3/3) ... [2019-11-19 21:12:28,648 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-19 21:12:28,656 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:28,665 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:28,677 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:28,698 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:28,699 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:28,699 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:28,699 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:28,699 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:28,700 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:28,700 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:28,700 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:28,712 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-19 21:12:28,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:12:28,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:28,719 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:28,720 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:28,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-19 21:12:28,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:28,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186202111] [2019-11-19 21:12:28,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:28,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:28,848 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-19 21:12:28,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186202111] [2019-11-19 21:12:28,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:28,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:12:28,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139840808] [2019-11-19 21:12:28,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:28,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:28,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:28,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:28,868 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-19 21:12:28,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:28,886 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-19 21:12:28,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:28,887 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 21:12:28,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:28,895 INFO L225 Difference]: With dead ends: 56 [2019-11-19 21:12:28,896 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 21:12:28,898 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:28,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 21:12:28,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 21:12:28,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:12:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-19 21:12:28,930 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-19 21:12:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:28,930 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-19 21:12:28,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:28,930 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-19 21:12:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:12:28,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:28,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:28,932 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:28,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:28,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-19 21:12:28,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:28,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568462952] [2019-11-19 21:12:28,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:29,031 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-19 21:12:29,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568462952] [2019-11-19 21:12:29,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:29,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:12:29,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046551493] [2019-11-19 21:12:29,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:12:29,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:12:29,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:12:29,036 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2019-11-19 21:12:29,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:29,102 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2019-11-19 21:12:29,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:12:29,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-19 21:12:29,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:29,104 INFO L225 Difference]: With dead ends: 40 [2019-11-19 21:12:29,104 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 21:12:29,105 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-19 21:12:29,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 21:12:29,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-11-19 21:12:29,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:12:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 21:12:29,115 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-19 21:12:29,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:29,116 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 21:12:29,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:12:29,117 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 21:12:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:12:29,119 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:29,119 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:29,120 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:29,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:29,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2019-11-19 21:12:29,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:29,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396981166] [2019-11-19 21:12:29,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:29,217 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-19 21:12:29,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396981166] [2019-11-19 21:12:29,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:29,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 21:12:29,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934483137] [2019-11-19 21:12:29,218 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:12:29,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:12:29,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:12:29,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:12:29,220 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2019-11-19 21:12:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:29,274 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-19 21:12:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:12:29,274 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-19 21:12:29,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:29,275 INFO L225 Difference]: With dead ends: 42 [2019-11-19 21:12:29,276 INFO L226 Difference]: Without dead ends: 38 [2019-11-19 21:12:29,276 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-19 21:12:29,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-19 21:12:29,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2019-11-19 21:12:29,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:12:29,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 21:12:29,282 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2019-11-19 21:12:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:29,282 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 21:12:29,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:12:29,283 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 21:12:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:12:29,283 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:29,284 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:29,284 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:29,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:29,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-19 21:12:29,285 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:12:29,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724824463] [2019-11-19 21:12:29,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:12:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:29,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:12:29,390 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:12:29,390 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:12:29,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:12:29 BoogieIcfgContainer [2019-11-19 21:12:29,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:12:29,420 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:12:29,421 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:12:29,421 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:12:29,422 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:28" (3/4) ... [2019-11-19 21:12:29,426 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 21:12:29,426 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:12:29,429 INFO L168 Benchmark]: Toolchain (without parser) took 1810.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -96.5 MB). Peak memory consumption was 42.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:29,430 INFO L168 Benchmark]: CDTParser took 0.69 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-19 21:12:29,431 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:29,432 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:29,433 INFO L168 Benchmark]: Boogie Preprocessor took 34.23 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-19 21:12:29,433 INFO L168 Benchmark]: RCFGBuilder took 487.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:29,434 INFO L168 Benchmark]: TraceAbstraction took 781.49 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:12:29,435 INFO L168 Benchmark]: Witness Printer took 5.71 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-19 21:12:29,439 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.69 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 421.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.23 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 487.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 781.49 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: 45.7 MB). Peak memory consumption was 45.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 68]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 67, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L60] double x = __VERIFIER_nondet_double(); [L61] double y = 0.0 / 0.0; [L16] return x != x; [L62] COND TRUE !isnan_double(x) [L18] __uint32_t msw, lsw; [L21] ieee_double_shape_type ew_u; [L22] ew_u.value = (x) [L23] EXPR ew_u.parts.msw [L23] (msw) = ew_u.parts.msw [L24] EXPR ew_u.parts.lsw [L24] (lsw) = ew_u.parts.lsw [L27-L28] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L30-L31] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L33-L34] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L37-L38] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L41] return 0; [L45] COND TRUE __fpclassify_double(x) == 0 [L46] return y; [L64] double res = fmin_double(x, y); [L67] COND TRUE res != x [L68] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 20 SDslu, 112 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 18 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 35 ConstructedInterpolants, 0 QuantifiedInterpolants, 517 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-678e011 [2019-11-19 21:12:31,523 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:12:31,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:12:31,540 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:12:31,540 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:12:31,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:12:31,543 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:12:31,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:12:31,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:12:31,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:12:31,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:12:31,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:12:31,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:12:31,552 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:12:31,553 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:12:31,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:12:31,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:12:31,557 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:12:31,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:12:31,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:12:31,567 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:12:31,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:12:31,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:12:31,578 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:12:31,583 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:12:31,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:12:31,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:12:31,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:12:31,590 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:12:31,591 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:12:31,592 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:12:31,593 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:12:31,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:12:31,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:12:31,597 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:12:31,601 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:12:31,602 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:12:31,603 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:12:31,603 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:12:31,604 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:12:31,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:12:31,609 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 21:12:31,636 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:12:31,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:12:31,639 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:12:31,639 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:12:31,640 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:12:31,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:12:31,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:12:31,641 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:12:31,641 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:12:31,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:12:31,642 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:12:31,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:12:31,643 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 21:12:31,644 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 21:12:31,644 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:12:31,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:12:31,644 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:12:31,645 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:12:31,645 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:12:31,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:12:31,646 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:12:31,646 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:12:31,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:12:31,647 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:12:31,647 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:12:31,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:12:31,647 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 21:12:31,648 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 21:12:31,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:12:31,648 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 21:12:31,648 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 -> c714d208cb0b1f96f572e8a6108248eb76c73a94 [2019-11-19 21:12:31,951 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:12:31,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:12:31,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:12:31,977 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:12:31,978 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:12:31,980 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 21:12:32,056 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a917bda94/e9e3da7e27de463e84a52926071c605c/FLAG5cd9096da [2019-11-19 21:12:32,526 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:12:32,527 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2019-11-19 21:12:32,535 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a917bda94/e9e3da7e27de463e84a52926071c605c/FLAG5cd9096da [2019-11-19 21:12:32,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a917bda94/e9e3da7e27de463e84a52926071c605c [2019-11-19 21:12:32,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:12:32,879 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:12:32,881 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:32,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:12:32,885 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:12:32,886 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:32" (1/1) ... [2019-11-19 21:12:32,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bbc8973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:32, skipping insertion in model container [2019-11-19 21:12:32,890 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:12:32" (1/1) ... [2019-11-19 21:12:32,899 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:12:32,921 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:12:33,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:33,209 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:12:33,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:12:33,352 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:12:33,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33 WrapperNode [2019-11-19 21:12:33,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:12:33,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:33,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:12:33,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:12:33,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,411 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:12:33,411 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:12:33,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:12:33,412 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:12:33,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,424 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,439 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,441 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (1/1) ... [2019-11-19 21:12:33,445 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:12:33,445 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:12:33,446 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:12:33,446 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:12:33,447 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (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-19 21:12:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-19 21:12:33,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 21:12:33,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 21:12:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:12:33,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:12:33,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 21:12:33,966 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:12:33,966 INFO L285 CfgBuilder]: Removed 16 assume(true) statements. [2019-11-19 21:12:33,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:33 BoogieIcfgContainer [2019-11-19 21:12:33,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:12:33,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:12:33,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:12:33,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:12:33,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:12:32" (1/3) ... [2019-11-19 21:12:33,975 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c41f0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:33, skipping insertion in model container [2019-11-19 21:12:33,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:12:33" (2/3) ... [2019-11-19 21:12:33,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c41f0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:12:33, skipping insertion in model container [2019-11-19 21:12:33,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:33" (3/3) ... [2019-11-19 21:12:33,978 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2019-11-19 21:12:33,988 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:12:33,996 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 21:12:34,008 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 21:12:34,033 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:12:34,033 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:12:34,034 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:12:34,034 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:12:34,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:12:34,035 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:12:34,035 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:12:34,035 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:12:34,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-19 21:12:34,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-19 21:12:34,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:34,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:34,060 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:34,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:34,067 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2019-11-19 21:12:34,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:34,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [837493746] [2019-11-19 21:12:34,079 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-19 21:12:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:34,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 21:12:34,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:34,181 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-19 21:12:34,182 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:34,186 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-19 21:12:34,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [837493746] [2019-11-19 21:12:34,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:34,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 21:12:34,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756232616] [2019-11-19 21:12:34,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 21:12:34,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:34,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 21:12:34,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 21:12:34,213 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2019-11-19 21:12:34,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:34,236 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2019-11-19 21:12:34,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 21:12:34,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2019-11-19 21:12:34,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:34,250 INFO L225 Difference]: With dead ends: 56 [2019-11-19 21:12:34,251 INFO L226 Difference]: Without dead ends: 26 [2019-11-19 21:12:34,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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-19 21:12:34,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-19 21:12:34,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-19 21:12:34,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:12:34,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-19 21:12:34,296 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2019-11-19 21:12:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:34,296 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-19 21:12:34,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 21:12:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2019-11-19 21:12:34,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-19 21:12:34,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:34,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:34,512 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 21:12:34,512 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:34,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:34,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2019-11-19 21:12:34,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:34,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [956466483] [2019-11-19 21:12:34,516 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-19 21:12:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:34,632 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:12:34,634 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:34,666 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-19 21:12:34,666 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:34,693 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-19 21:12:34,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [956466483] [2019-11-19 21:12:34,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:34,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:12:34,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398454704] [2019-11-19 21:12:34,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:12:34,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:34,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:12:34,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:12:34,697 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2019-11-19 21:12:34,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:12:34,829 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2019-11-19 21:12:34,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:12:34,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-11-19 21:12:34,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:12:34,831 INFO L225 Difference]: With dead ends: 50 [2019-11-19 21:12:34,832 INFO L226 Difference]: Without dead ends: 46 [2019-11-19 21:12:34,833 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 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-19 21:12:34,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-19 21:12:34,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2019-11-19 21:12:34,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:12:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2019-11-19 21:12:34,841 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2019-11-19 21:12:34,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:12:34,841 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2019-11-19 21:12:34,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:12:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2019-11-19 21:12:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-19 21:12:34,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:12:34,843 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:12:35,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 21:12:35,057 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:12:35,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:12:35,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2019-11-19 21:12:35,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:12:35,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2004961857] [2019-11-19 21:12:35,060 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-19 21:12:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:12:35,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 21:12:35,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:12:35,341 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 56 [2019-11-19 21:12:35,371 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 58 [2019-11-19 21:12:35,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:35,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:35,430 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 21:12:35,432 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:35,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:35,463 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:35,464 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 21:12:35,465 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:35,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:35,480 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:35,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:35,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 21:12:35,506 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:77, output treesize:33 [2019-11-19 21:12:36,770 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|))) (and (let ((.cse0 (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) c_ULTIMATE.start___fpclassify_double_~msw~0) (= .cse1 c_ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_2_3) .cse1)))) is different from true [2019-11-19 21:12:49,116 WARN L191 SmtUtils]: Spent 12.29 s on a formula simplification. DAG size of input: 36 DAG size of output: 35 [2019-11-19 21:12:51,310 WARN L191 SmtUtils]: Spent 2.12 s on a formula simplification. DAG size of input: 81 DAG size of output: 48 [2019-11-19 21:12:51,326 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-19 21:12:51,326 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:12:53,324 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2019-11-19 21:12:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:12:53,549 INFO L237 Elim1Store]: Index analysis took 125 ms [2019-11-19 21:12:53,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:53,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 21:12:53,731 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:53,733 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 21:12:53,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:53,849 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2019-11-19 21:12:53,850 INFO L567 ElimStorePlain]: treesize reduction 16, result has 84.8 percent of original size [2019-11-19 21:12:53,887 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2019-11-19 21:12:53,888 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:53,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:53,944 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 30 [2019-11-19 21:12:53,946 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:53,971 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:53,972 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,100 INFO L237 Elim1Store]: Index analysis took 106 ms [2019-11-19 21:12:54,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 21:12:54,299 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,299 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 21:12:54,301 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,406 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-19 21:12:54,407 INFO L567 ElimStorePlain]: treesize reduction 7, result has 92.5 percent of original size [2019-11-19 21:12:54,439 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2019-11-19 21:12:54,441 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,498 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2019-11-19 21:12:54,499 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,529 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,530 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,656 INFO L237 Elim1Store]: Index analysis took 105 ms [2019-11-19 21:12:54,691 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 21:12:54,825 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 21:12:54,829 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,912 INFO L567 ElimStorePlain]: treesize reduction 23, result has 78.1 percent of original size [2019-11-19 21:12:54,943 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 21:12:54,944 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:54,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:54,999 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2019-11-19 21:12:55,000 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,018 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,158 INFO L237 Elim1Store]: Index analysis took 118 ms [2019-11-19 21:12:55,190 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,190 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 21:12:55,333 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 21:12:55,335 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,412 INFO L567 ElimStorePlain]: treesize reduction 14, result has 84.9 percent of original size [2019-11-19 21:12:55,440 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 21:12:55,441 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,468 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,487 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-19 21:12:55,487 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,507 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,507 INFO L496 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,640 INFO L237 Elim1Store]: Index analysis took 109 ms [2019-11-19 21:12:55,667 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,668 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 21:12:55,845 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:55,846 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 21:12:55,847 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,856 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-19 21:12:55,869 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_21 vanished before elimination [2019-11-19 21:12:55,870 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_23 vanished before elimination [2019-11-19 21:12:55,870 INFO L496 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:55,991 INFO L237 Elim1Store]: Index analysis took 106 ms [2019-11-19 21:12:56,019 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,019 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 21:12:56,148 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 21:12:56,150 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,154 INFO L567 ElimStorePlain]: treesize reduction 106, result has 0.9 percent of original size [2019-11-19 21:12:56,163 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_25 vanished before elimination [2019-11-19 21:12:56,164 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_27 vanished before elimination [2019-11-19 21:12:56,164 INFO L496 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,316 INFO L237 Elim1Store]: Index analysis took 132 ms [2019-11-19 21:12:56,348 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,349 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 96 treesize of output 94 [2019-11-19 21:12:56,482 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 60 treesize of output 71 [2019-11-19 21:12:56,485 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,488 INFO L567 ElimStorePlain]: treesize reduction 92, result has 1.1 percent of original size [2019-11-19 21:12:56,500 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_29 vanished before elimination [2019-11-19 21:12:56,500 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_32 vanished before elimination [2019-11-19 21:12:56,501 INFO L496 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,537 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,538 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 118 treesize of output 112 [2019-11-19 21:12:56,600 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,601 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 74 treesize of output 81 [2019-11-19 21:12:56,603 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,607 INFO L567 ElimStorePlain]: treesize reduction 102, result has 1.0 percent of original size [2019-11-19 21:12:56,611 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_35 vanished before elimination [2019-11-19 21:12:56,612 INFO L464 ElimStorePlain]: Eliminatee v_arrayElimArr_34 vanished before elimination [2019-11-19 21:12:56,612 INFO L496 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:12:56,750 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-19 21:12:56,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:12:56,755 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-11-19 21:12:56,755 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 4 variables, input treesize:857, output treesize:137 [2019-11-19 21:12:56,949 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-19 21:12:56,950 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2004961857] [2019-11-19 21:12:56,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:12:56,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2019-11-19 21:12:56,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661325506] [2019-11-19 21:12:56,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 21:12:56,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:12:56,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 21:12:56,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2019-11-19 21:12:56,953 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 13 states. [2019-11-19 21:13:01,357 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2019-11-19 21:13:05,435 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-19 21:13:07,789 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 30 [2019-11-19 21:13:12,114 WARN L191 SmtUtils]: Spent 4.22 s on a formula simplification that was a NOOP. DAG size: 51 [2019-11-19 21:13:18,538 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 28 [2019-11-19 21:13:18,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:18,591 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-19 21:13:18,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 21:13:18,592 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-11-19 21:13:18,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:18,594 INFO L225 Difference]: With dead ends: 70 [2019-11-19 21:13:18,595 INFO L226 Difference]: Without dead ends: 54 [2019-11-19 21:13:18,596 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 33.1s TimeCoverageRelationStatistics Valid=140, Invalid=323, Unknown=3, NotChecked=40, Total=506 [2019-11-19 21:13:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-19 21:13:18,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 26. [2019-11-19 21:13:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-19 21:13:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-19 21:13:18,604 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-11-19 21:13:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:18,604 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-19 21:13:18,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 21:13:18,605 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-19 21:13:18,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 21:13:18,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:18,606 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:13:18,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 21:13:18,810 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:18,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:18,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2019-11-19 21:13:18,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:18,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137745957] [2019-11-19 21:13:18,811 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-19 21:13:18,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:18,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:13:18,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:18,903 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-19 21:13:18,904 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:18,929 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-19 21:13:18,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137745957] [2019-11-19 21:13:18,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:18,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:13:18,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356932307] [2019-11-19 21:13:18,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:13:18,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:18,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:13:18,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:13:18,932 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 6 states. [2019-11-19 21:13:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:19,159 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-11-19 21:13:19,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:13:19,160 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-11-19 21:13:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:19,161 INFO L225 Difference]: With dead ends: 48 [2019-11-19 21:13:19,161 INFO L226 Difference]: Without dead ends: 44 [2019-11-19 21:13:19,162 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 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-19 21:13:19,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-19 21:13:19,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2019-11-19 21:13:19,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:13:19,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-19 21:13:19,169 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2019-11-19 21:13:19,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:19,169 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-19 21:13:19,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:13:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-11-19 21:13:19,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:13:19,170 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:19,170 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:13:19,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 21:13:19,378 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:19,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:19,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2019-11-19 21:13:19,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:19,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1130595828] [2019-11-19 21:13:19,380 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-19 21:13:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:19,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 21:13:19,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:19,476 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-19 21:13:19,477 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:19,719 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-19 21:13:19,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1130595828] [2019-11-19 21:13:19,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:19,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 21:13:19,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685645808] [2019-11-19 21:13:19,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 21:13:19,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:19,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 21:13:19,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 21:13:19,721 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2019-11-19 21:13:19,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:19,752 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2019-11-19 21:13:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:13:19,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-19 21:13:19,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:19,755 INFO L225 Difference]: With dead ends: 33 [2019-11-19 21:13:19,755 INFO L226 Difference]: Without dead ends: 28 [2019-11-19 21:13:19,756 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-19 21:13:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-19 21:13:19,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-19 21:13:19,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:13:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-19 21:13:19,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2019-11-19 21:13:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:19,763 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-19 21:13:19,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 21:13:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-19 21:13:19,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-19 21:13:19,763 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:19,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:13:19,968 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 21:13:19,969 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:19,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:19,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2019-11-19 21:13:19,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:19,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727160728] [2019-11-19 21:13:19,971 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-19 21:13:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:20,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 21:13:20,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:20,159 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-19 21:13:20,160 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:20,371 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-19 21:13:20,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727160728] [2019-11-19 21:13:20,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:20,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 21:13:20,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133702904] [2019-11-19 21:13:20,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:13:20,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:20,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:13:20,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:13:20,372 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2019-11-19 21:13:20,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:20,779 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2019-11-19 21:13:20,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 21:13:20,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-19 21:13:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:20,781 INFO L225 Difference]: With dead ends: 40 [2019-11-19 21:13:20,781 INFO L226 Difference]: Without dead ends: 32 [2019-11-19 21:13:20,782 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-11-19 21:13:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-11-19 21:13:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-11-19 21:13:20,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-19 21:13:20,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2019-11-19 21:13:20,788 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2019-11-19 21:13:20,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:20,788 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2019-11-19 21:13:20,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:13:20,789 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2019-11-19 21:13:20,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-19 21:13:20,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:20,790 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] [2019-11-19 21:13:20,990 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 21:13:20,991 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:20,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:20,992 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2019-11-19 21:13:20,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:20,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1784353074] [2019-11-19 21:13:20,993 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-19 21:13:21,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:21,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 21:13:21,083 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:21,207 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-19 21:13:21,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:21,557 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-19 21:13:21,558 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:21,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:21,824 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-19 21:13:21,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1784353074] [2019-11-19 21:13:21,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:21,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-19 21:13:21,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371386373] [2019-11-19 21:13:21,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 21:13:21,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 21:13:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-19 21:13:21,828 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2019-11-19 21:13:22,199 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 36 [2019-11-19 21:13:22,910 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 34 [2019-11-19 21:13:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:23,197 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2019-11-19 21:13:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-19 21:13:23,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-19 21:13:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:23,199 INFO L225 Difference]: With dead ends: 70 [2019-11-19 21:13:23,199 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 21:13:23,200 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-19 21:13:23,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 21:13:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2019-11-19 21:13:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 21:13:23,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2019-11-19 21:13:23,208 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2019-11-19 21:13:23,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:23,209 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2019-11-19 21:13:23,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 21:13:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2019-11-19 21:13:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:13:23,210 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:23,210 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-19 21:13:23,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 21:13:23,426 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:23,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2019-11-19 21:13:23,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:23,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595945529] [2019-11-19 21:13:23,428 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-19 21:13:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:23,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 21:13:23,535 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:23,564 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 69 [2019-11-19 21:13:23,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 62 [2019-11-19 21:13:23,576 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,607 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,617 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2019-11-19 21:13:23,617 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,636 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,642 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,643 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 16 [2019-11-19 21:13:23,643 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,652 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,653 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,671 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-19 21:13:23,671 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:85, output treesize:30 [2019-11-19 21:13:23,705 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-19 21:13:23,705 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:23,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:23,807 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,807 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-19 21:13:23,861 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,861 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-19 21:13:23,862 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,904 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,913 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 24 [2019-11-19 21:13:23,914 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,940 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,948 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 21:13:23,949 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,963 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,964 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:13:23,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:23,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 4 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 80 [2019-11-19 21:13:24,047 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,047 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 51 treesize of output 66 [2019-11-19 21:13:24,048 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:24,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,089 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-19 21:13:24,090 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:24,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,122 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,122 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 20 [2019-11-19 21:13:24,123 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-19 21:13:24,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,140 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-19 21:13:24,183 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-19 21:13:24,184 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2019-11-19 21:13:24,184 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:157, output treesize:69 [2019-11-19 21:13:24,372 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-19 21:13:24,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595945529] [2019-11-19 21:13:24,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:24,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 21:13:24,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416323215] [2019-11-19 21:13:24,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 21:13:24,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:24,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 21:13:24,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 21:13:24,375 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2019-11-19 21:13:24,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:24,653 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2019-11-19 21:13:24,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-19 21:13:24,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-19 21:13:24,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:24,656 INFO L225 Difference]: With dead ends: 44 [2019-11-19 21:13:24,656 INFO L226 Difference]: Without dead ends: 36 [2019-11-19 21:13:24,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-11-19 21:13:24,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-19 21:13:24,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-19 21:13:24,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-19 21:13:24,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2019-11-19 21:13:24,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2019-11-19 21:13:24,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:24,668 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2019-11-19 21:13:24,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 21:13:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2019-11-19 21:13:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 21:13:24,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:24,670 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-19 21:13:24,871 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-19 21:13:24,871 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:24,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:24,872 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2019-11-19 21:13:24,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:24,873 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1279202856] [2019-11-19 21:13:24,873 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-19 21:13:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:24,998 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 21:13:24,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:25,016 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-19 21:13:25,017 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:25,019 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-19 21:13:25,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1279202856] [2019-11-19 21:13:25,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:25,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 21:13:25,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375413671] [2019-11-19 21:13:25,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 21:13:25,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:25,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 21:13:25,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 21:13:25,022 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2019-11-19 21:13:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:25,076 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-11-19 21:13:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 21:13:25,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-19 21:13:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:25,078 INFO L225 Difference]: With dead ends: 40 [2019-11-19 21:13:25,078 INFO L226 Difference]: Without dead ends: 24 [2019-11-19 21:13:25,079 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 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-19 21:13:25,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-19 21:13:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-11-19 21:13:25,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-19 21:13:25,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2019-11-19 21:13:25,084 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2019-11-19 21:13:25,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:25,084 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2019-11-19 21:13:25,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 21:13:25,085 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2019-11-19 21:13:25,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 21:13:25,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:13:25,086 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-19 21:13:25,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-19 21:13:25,290 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:13:25,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:13:25,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2019-11-19 21:13:25,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 21:13:25,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1192227204] [2019-11-19 21:13:25,292 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-19 21:13:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:13:25,371 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-19 21:13:25,373 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 21:13:25,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:25,857 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-19 21:13:25,964 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-19 21:13:25,965 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 21:13:26,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 21:13:26,400 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-19 21:13:26,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1192227204] [2019-11-19 21:13:26,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:13:26,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-19 21:13:26,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813808924] [2019-11-19 21:13:26,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 21:13:26,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 21:13:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 21:13:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2019-11-19 21:13:26,402 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 16 states. [2019-11-19 21:13:27,677 WARN L191 SmtUtils]: Spent 845.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2019-11-19 21:13:28,002 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 35 [2019-11-19 21:13:28,294 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2019-11-19 21:13:28,541 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2019-11-19 21:13:28,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:13:28,543 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2019-11-19 21:13:28,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 21:13:28,543 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2019-11-19 21:13:28,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:13:28,544 INFO L225 Difference]: With dead ends: 24 [2019-11-19 21:13:28,544 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 21:13:28,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2019-11-19 21:13:28,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 21:13:28,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 21:13:28,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 21:13:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 21:13:28,545 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-11-19 21:13:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:13:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 21:13:28,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 21:13:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 21:13:28,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 21:13:28,748 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-19 21:13:28,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 21:13:28,931 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 184 DAG size of output: 184 [2019-11-19 21:13:30,234 WARN L191 SmtUtils]: Spent 1.18 s on a formula simplification. DAG size of input: 184 DAG size of output: 29 [2019-11-19 21:13:30,877 WARN L191 SmtUtils]: Spent 550.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 38 [2019-11-19 21:13:31,032 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 17 [2019-11-19 21:13:32,161 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 176 DAG size of output: 48 [2019-11-19 21:13:32,163 INFO L447 ceAbstractionStarter]: At program point L73(lines 53 74) the Hoare annotation is: true [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point L20-1(lines 20 25) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L440 ceAbstractionStarter]: At program point L20-2(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y .cse0) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point L20-3(lines 17 42) no Hoare annotation was computed. [2019-11-19 21:13:32,164 INFO L440 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start_main_~y~0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|)) (and (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) .cse0)))) [2019-11-19 21:13:32,164 INFO L444 ceAbstractionStarter]: For program point L20-5(lines 20 25) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L440 ceAbstractionStarter]: At program point L20-6(lines 20 25) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point L45(lines 45 46) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point L20-7(lines 17 42) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L440 ceAbstractionStarter]: At program point L41(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 .cse0) (exists ((v_skolemized_v_prenex_2_4 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_4) ((_ extract 62 52) v_skolemized_v_prenex_2_4) ((_ extract 51 0) v_skolemized_v_prenex_2_4)) ULTIMATE.start_fmin_double_~x) (= ((_ extract 63 32) v_skolemized_v_prenex_2_4) ULTIMATE.start___fpclassify_double_~msw~0))) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmin_double_~x) (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)) (and (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32)) (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32))) (= (_ bv0 32) ULTIMATE.start___fpclassify_double_~lsw~0)) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-11-19 21:13:32,165 INFO L440 ceAbstractionStarter]: At program point L41-1(lines 17 42) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64)) (v_skolemized_v_prenex_3_3 (_ BitVec 64))) (let ((.cse1 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_7|))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))) (= .cse1 ULTIMATE.start___fpclassify_double_~lsw~0) (= ((_ extract 63 32) v_skolemized_v_prenex_3_3) ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) v_skolemized_v_prenex_3_3) .cse1)))) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 41) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 41) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 41) no Hoare annotation was computed. [2019-11-19 21:13:32,165 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 21:13:32,166 INFO L444 ceAbstractionStarter]: For program point L33-1(lines 33 41) no Hoare annotation was computed. [2019-11-19 21:13:32,166 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 71) no Hoare annotation was computed. [2019-11-19 21:13:32,166 INFO L444 ceAbstractionStarter]: For program point L62-2(lines 62 71) no Hoare annotation was computed. [2019-11-19 21:13:32,166 INFO L444 ceAbstractionStarter]: For program point L50(line 50) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L50-2(line 50) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L440 ceAbstractionStarter]: At program point L50-3(lines 44 51) the Hoare annotation is: (let ((.cse0 (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53)))) (and (= ULTIMATE.start_main_~y~0 .cse0) (fp.eq |ULTIMATE.start_fmin_double_#res| ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div roundNearestTiesToEven (_ +zero 11 53) (_ +zero 11 53))))))) [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L67(lines 67 70) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L30-1(lines 30 41) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 48) no Hoare annotation was computed. [2019-11-19 21:13:32,167 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-19 21:13:32,173 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,174 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,174 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,175 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,195 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,196 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,197 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,198 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,203 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,203 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,204 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,207 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,208 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,211 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,212 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,214 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,220 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,221 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,222 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,223 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,223 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,224 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,224 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,226 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:13:32 BoogieIcfgContainer [2019-11-19 21:13:32,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:13:32,227 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:13:32,227 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:13:32,227 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:13:32,228 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:12:33" (3/4) ... [2019-11-19 21:13:32,231 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 21:13:32,242 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-19 21:13:32,243 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 21:13:32,243 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 21:13:32,266 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) [2019-11-19 21:13:32,266 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) [2019-11-19 21:13:32,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-19 21:13:32,267 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2019-11-19 21:13:32,268 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) [2019-11-19 21:13:32,268 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result [2019-11-19 21:13:32,297 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-19 21:13:32,298 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:13:32,299 INFO L168 Benchmark]: Toolchain (without parser) took 59421.10 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 261.1 MB). Free memory was 955.0 MB in the beginning and 913.5 MB in the end (delta: 41.5 MB). Peak memory consumption was 302.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:32,300 INFO L168 Benchmark]: CDTParser took 0.37 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-19 21:13:32,300 INFO L168 Benchmark]: CACSL2BoogieTranslator took 472.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:32,301 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:32,301 INFO L168 Benchmark]: Boogie Preprocessor took 33.62 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-19 21:13:32,301 INFO L168 Benchmark]: RCFGBuilder took 523.06 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:32,302 INFO L168 Benchmark]: TraceAbstraction took 58257.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 180.3 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. [2019-11-19 21:13:32,302 INFO L168 Benchmark]: Witness Printer took 70.89 ms. Allocated memory is still 1.3 GB. Free memory is still 913.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:13:32,304 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.37 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 472.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -170.1 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.62 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 523.06 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: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 58257.03 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 132.1 MB). Free memory was 1.1 GB in the beginning and 913.5 MB in the end (delta: 180.3 MB). Peak memory consumption was 312.4 MB. Max. memory is 11.5 GB. * Witness Printer took 70.89 ms. Allocated memory is still 1.3 GB. Free memory is still 913.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 44]: Loop Invariant [2019-11-19 21:13:32,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,320 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,321 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,322 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,322 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,323 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,324 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2019-11-19 21:13:32,324 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ~fp.eq~DOUBLE(\result, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64 :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 16]: Loop Invariant [2019-11-19 21:13:32,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && ((!~fp.eq~DOUBLE(x, x) && 1bv32 == \result) || (0bv32 == \result && ~fp.eq~DOUBLE(x, x))) - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 21:13:32,325 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,326 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result) && x == x) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && ~fp.eq~DOUBLE(x, x) - InvariantResult [Line: 17]: Loop Invariant [2019-11-19 21:13:32,327 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,327 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,328 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,328 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,329 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,329 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,330 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,330 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,331 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_3,QUANTIFIED] [2019-11-19 21:13:32,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-19 21:13:32,333 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,333 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64, v_skolemized_v_prenex_3_3 : bv64 :: (((v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && v_skolemized_q#valueAsBitvector_7[31:0] == lsw) && v_skolemized_v_prenex_3_3[63:32] == msw) && v_skolemized_v_prenex_3_3[31:0] == v_skolemized_q#valueAsBitvector_7[31:0])) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && 0bv32 == \result - InvariantResult [Line: 20]: Loop Invariant [2019-11-19 21:13:32,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && 0bv32 == \result) && ~fp.eq~DOUBLE(x, x)) && x == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 53]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 17]: Loop Invariant [2019-11-19 21:13:32,336 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,337 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2019-11-19 21:13:32,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_4,QUANTIFIED] [2019-11-19 21:13:32,339 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((x == x && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_2_4 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_4[63:63], v_skolemized_v_prenex_2_4[62:52], v_skolemized_v_prenex_2_4[51:0]) == x && v_skolemized_v_prenex_2_4[63:32] == msw)) && ~fp.eq~DOUBLE(x, x)) && !(0bv32 == \result)) && 0bv32 == \result) && x == x) && ((((~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32)) || ~bvule32(msw, 2146435071bv32)) || (~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32))) || 0bv32 == lsw)) && y == ~fp.div~DOUBLE(~roundNearestTiesToEven, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 58.1s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 26.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.4s, HoareTripleCheckerStatistics: 268 SDtfs, 696 SDslu, 493 SDs, 0 SdLazy, 358 SolverSat, 52 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 248 HoareAnnotationTreeSize, 7 FomulaSimplifications, 1097 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 12268 FormulaSimplificationTreeSizeReductionInter, 3.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 25.1s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 74 QuantifiedInterpolants, 70858 SizeOfPredicates, 62 NumberOfNonLiveVariables, 633 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...