./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 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51c288f40d68a666851060907ab6bc13e9c502d2 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 51c288f40d68a666851060907ab6bc13e9c502d2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2020-12-03 01:08:55,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 01:08:55,525 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 01:08:55,578 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 01:08:55,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 01:08:55,585 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 01:08:55,587 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 01:08:55,594 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 01:08:55,598 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 01:08:55,604 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 01:08:55,606 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 01:08:55,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 01:08:55,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 01:08:55,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 01:08:55,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 01:08:55,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 01:08:55,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 01:08:55,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 01:08:55,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 01:08:55,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 01:08:55,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 01:08:55,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 01:08:55,640 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 01:08:55,641 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 01:08:55,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 01:08:55,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 01:08:55,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 01:08:55,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 01:08:55,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 01:08:55,655 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 01:08:55,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 01:08:55,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 01:08:55,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 01:08:55,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 01:08:55,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 01:08:55,661 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 01:08:55,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 01:08:55,664 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 01:08:55,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 01:08:55,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 01:08:55,667 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 01:08:55,668 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-03 01:08:55,728 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 01:08:55,728 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 01:08:55,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 01:08:55,731 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 01:08:55,731 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 01:08:55,732 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 01:08:55,732 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 01:08:55,732 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-03 01:08:55,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 01:08:55,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 01:08:55,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 01:08:55,735 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 01:08:55,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 01:08:55,735 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 01:08:55,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 01:08:55,736 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 01:08:55,736 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 01:08:55,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 01:08:55,737 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 01:08:55,737 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 01:08:55,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:08:55,738 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 01:08:55,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 01:08:55,738 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 01:08:55,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-03 01:08:55,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-03 01:08:55,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 01:08:55,739 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 01:08:55,740 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c288f40d68a666851060907ab6bc13e9c502d2 [2020-12-03 01:08:56,146 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 01:08:56,186 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 01:08:56,189 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 01:08:56,190 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 01:08:56,193 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 01:08:56,195 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-12-03 01:08:56,269 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4648c9153/cecfc178a243445c90196fe7eb45329f/FLAG85f31591b [2020-12-03 01:08:56,827 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 01:08:56,828 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-12-03 01:08:56,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4648c9153/cecfc178a243445c90196fe7eb45329f/FLAG85f31591b [2020-12-03 01:08:57,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4648c9153/cecfc178a243445c90196fe7eb45329f [2020-12-03 01:08:57,180 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 01:08:57,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 01:08:57,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 01:08:57,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 01:08:57,190 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 01:08:57,191 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2863488c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57, skipping insertion in model container [2020-12-03 01:08:57,196 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,204 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 01:08:57,223 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 01:08:57,418 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2020-12-03 01:08:57,422 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:08:57,432 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 01:08:57,458 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2020-12-03 01:08:57,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:08:57,476 INFO L208 MainTranslator]: Completed translation [2020-12-03 01:08:57,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57 WrapperNode [2020-12-03 01:08:57,477 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 01:08:57,478 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 01:08:57,478 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 01:08:57,479 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 01:08:57,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,499 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,537 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 01:08:57,537 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 01:08:57,538 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 01:08:57,538 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 01:08:57,546 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,559 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (1/1) ... [2020-12-03 01:08:57,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 01:08:57,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 01:08:57,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 01:08:57,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 01:08:57,574 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (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 [2020-12-03 01:08:57,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-03 01:08:57,688 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 01:08:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-03 01:08:57,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 01:08:57,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 01:08:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-03 01:08:57,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 01:08:58,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 01:08:58,257 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-03 01:08:58,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:08:58 BoogieIcfgContainer [2020-12-03 01:08:58,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 01:08:58,261 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 01:08:58,261 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 01:08:58,267 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 01:08:58,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:08:57" (1/3) ... [2020-12-03 01:08:58,268 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d9955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:08:58, skipping insertion in model container [2020-12-03 01:08:58,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:08:57" (2/3) ... [2020-12-03 01:08:58,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44d9955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:08:58, skipping insertion in model container [2020-12-03 01:08:58,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:08:58" (3/3) ... [2020-12-03 01:08:58,271 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-12-03 01:08:58,291 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 01:08:58,295 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 01:08:58,307 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 01:08:58,335 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 01:08:58,335 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 01:08:58,335 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 01:08:58,336 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 01:08:58,336 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 01:08:58,336 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 01:08:58,336 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 01:08:58,336 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 01:08:58,350 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-03 01:08:58,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 01:08:58,356 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:58,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:58,357 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-03 01:08:58,374 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:58,374 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486935357] [2020-12-03 01:08:58,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:08:58,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:08:58,535 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486935357] [2020-12-03 01:08:58,536 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:08:58,536 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 01:08:58,537 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119429010] [2020-12-03 01:08:58,542 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 01:08:58,543 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:08:58,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 01:08:58,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:08:58,560 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-03 01:08:58,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:08:58,581 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-03 01:08:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 01:08:58,583 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-03 01:08:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:08:58,593 INFO L225 Difference]: With dead ends: 56 [2020-12-03 01:08:58,594 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:08:58,597 INFO L677 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 [2020-12-03 01:08:58,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:08:58,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:08:58,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:08:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-03 01:08:58,636 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-03 01:08:58,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:08:58,636 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-03 01:08:58,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 01:08:58,637 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-03 01:08:58,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 01:08:58,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:58,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:58,638 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-03 01:08:58,638 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:58,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-03 01:08:58,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:58,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653467205] [2020-12-03 01:08:58,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:58,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:08:58,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:08:58,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653467205] [2020-12-03 01:08:58,731 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:08:58,731 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:08:58,731 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196517637] [2020-12-03 01:08:58,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:08:58,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:08:58,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:08:58,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:08:58,735 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-12-03 01:08:58,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:08:58,793 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-12-03 01:08:58,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:08:58,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-03 01:08:58,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:08:58,795 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:08:58,795 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:08:58,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:08:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:08:58,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:08:58,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:08:58,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:08:58,803 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-03 01:08:58,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:08:58,803 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:08:58,804 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:08:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:08:58,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 01:08:58,805 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:58,805 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:58,805 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-03 01:08:58,805 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:58,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:58,806 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2020-12-03 01:08:58,806 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:58,806 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886931614] [2020-12-03 01:08:58,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:08:58,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:08:58,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886931614] [2020-12-03 01:08:58,919 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:08:58,919 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:08:58,919 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032265817] [2020-12-03 01:08:58,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:08:58,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:08:58,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:08:58,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:08:58,923 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:08:58,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:08:58,980 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:08:58,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:08:58,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-03 01:08:58,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:08:58,982 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:08:58,982 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:08:58,983 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:08:58,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:08:58,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:08:58,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:08:58,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:08:58,989 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-12-03 01:08:58,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:08:58,990 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:08:58,990 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:08:58,990 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:08:58,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-03 01:08:58,991 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:58,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:58,992 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-03 01:08:58,992 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:58,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:58,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2020-12-03 01:08:58,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:58,994 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521971438] [2020-12-03 01:08:58,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:59,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:08:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:08:59,068 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521971438] [2020-12-03 01:08:59,068 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:08:59,068 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:08:59,068 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093896127] [2020-12-03 01:08:59,069 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:08:59,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:08:59,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:08:59,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:08:59,072 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:08:59,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:08:59,142 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-12-03 01:08:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:08:59,144 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-03 01:08:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:08:59,145 INFO L225 Difference]: With dead ends: 44 [2020-12-03 01:08:59,145 INFO L226 Difference]: Without dead ends: 40 [2020-12-03 01:08:59,148 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:08:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-03 01:08:59,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2020-12-03 01:08:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:08:59,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:08:59,157 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-12-03 01:08:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:08:59,158 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:08:59,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:08:59,160 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:08:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:08:59,161 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:59,161 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:59,161 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-03 01:08:59,161 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:59,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-12-03 01:08:59,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:59,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075854593] [2020-12-03 01:08:59,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:08:59,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:08:59,246 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075854593] [2020-12-03 01:08:59,247 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:08:59,247 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:08:59,247 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767666859] [2020-12-03 01:08:59,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:08:59,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-03 01:08:59,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:08:59,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:08:59,249 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:08:59,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:08:59,295 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:08:59,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:08:59,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-03 01:08:59,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:08:59,296 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:08:59,297 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:08:59,297 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:08:59,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:08:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:08:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:08:59,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:08:59,303 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-12-03 01:08:59,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:08:59,303 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:08:59,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:08:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:08:59,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:08:59,304 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:08:59,304 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:08:59,305 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-03 01:08:59,305 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:08:59,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:08:59,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-03 01:08:59,306 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-03 01:08:59,306 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814063182] [2020-12-03 01:08:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-03 01:08:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:08:59,333 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:08:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-03 01:08:59,355 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-03 01:08:59,396 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-03 01:08:59,396 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-03 01:08:59,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-03 01:08:59,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:08:59 BoogieIcfgContainer [2020-12-03 01:08:59,441 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 01:08:59,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 01:08:59,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 01:08:59,442 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 01:08:59,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:08:58" (3/4) ... [2020-12-03 01:08:59,446 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-03 01:08:59,446 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 01:08:59,449 INFO L168 Benchmark]: Toolchain (without parser) took 2265.56 ms. Allocated memory was 48.2 MB in the beginning and 71.3 MB in the end (delta: 23.1 MB). Free memory was 25.2 MB in the beginning and 38.6 MB in the end (delta: -13.4 MB). Peak memory consumption was 10.9 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,449 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 48.2 MB. Free memory was 30.1 MB in the beginning and 30.0 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:08:59,450 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.14 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 25.8 MB in the end (delta: -769.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,451 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.68 ms. Allocated memory is still 48.2 MB. Free memory was 25.8 MB in the beginning and 24.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,452 INFO L168 Benchmark]: Boogie Preprocessor took 32.03 ms. Allocated memory is still 48.2 MB. Free memory was 24.0 MB in the beginning and 22.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,453 INFO L168 Benchmark]: RCFGBuilder took 689.05 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 41.6 MB in the end (delta: -19.1 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,454 INFO L168 Benchmark]: TraceAbstraction took 1179.99 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 41.0 MB in the beginning and 39.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. [2020-12-03 01:08:59,455 INFO L168 Benchmark]: Witness Printer took 4.56 ms. Allocated memory is still 71.3 MB. Free memory was 39.0 MB in the beginning and 38.6 MB in the end (delta: 371.7 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:08:59,460 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.40 ms. Allocated memory is still 48.2 MB. Free memory was 30.1 MB in the beginning and 30.0 MB in the end (delta: 63.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 294.14 ms. Allocated memory is still 48.2 MB. Free memory was 25.0 MB in the beginning and 25.8 MB in the end (delta: -769.2 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 58.68 ms. Allocated memory is still 48.2 MB. Free memory was 25.8 MB in the beginning and 24.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.03 ms. Allocated memory is still 48.2 MB. Free memory was 24.0 MB in the beginning and 22.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 689.05 ms. Allocated memory was 48.2 MB in the beginning and 58.7 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 41.6 MB in the end (delta: -19.1 MB). Peak memory consumption was 12.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1179.99 ms. Allocated memory was 58.7 MB in the beginning and 71.3 MB in the end (delta: 12.6 MB). Free memory was 41.0 MB in the beginning and 39.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 13.7 MB. Max. memory is 16.1 GB. * Witness Printer took 4.56 ms. Allocated memory is still 71.3 MB. Free memory was 39.0 MB in the beginning and 38.6 MB in the end (delta: 371.7 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 70]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 69, overapproximation of someBinaryArithmeticDOUBLEoperation at line 63. Possible FailurePath: [L62] double x = __VERIFIER_nondet_double(); [L63] double y = 0.0 / 0.0; [L18] return x != x; [L64] COND TRUE !isnan_double(x) [L20] __uint32_t msw, lsw; [L23] ieee_double_shape_type ew_u; [L24] ew_u.value = (x) [L25] EXPR ew_u.parts.msw [L25] (msw) = ew_u.parts.msw [L26] EXPR ew_u.parts.lsw [L26] (lsw) = ew_u.parts.lsw [L29-L30] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L32-L33] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L35-L36] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L39-L40] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L43] return 0; [L47] COND TRUE __fpclassify_double(x) == 0 [L48] return y; [L66] double res = fmin_double(x, y); [L69] COND TRUE res != x [L70] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 40 SDslu, 242 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 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, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-7b2dab5 [2020-12-03 01:09:01,989 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-03 01:09:01,992 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-03 01:09:02,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-03 01:09:02,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-03 01:09:02,048 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-03 01:09:02,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-03 01:09:02,058 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-03 01:09:02,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-03 01:09:02,069 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-03 01:09:02,071 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-03 01:09:02,072 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-03 01:09:02,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-03 01:09:02,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-03 01:09:02,079 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-03 01:09:02,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-03 01:09:02,082 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-03 01:09:02,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-03 01:09:02,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-03 01:09:02,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-03 01:09:02,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-03 01:09:02,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-03 01:09:02,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-03 01:09:02,102 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-03 01:09:02,106 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-03 01:09:02,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-03 01:09:02,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-03 01:09:02,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-03 01:09:02,110 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-03 01:09:02,111 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-03 01:09:02,111 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-03 01:09:02,112 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-03 01:09:02,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-03 01:09:02,116 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-03 01:09:02,119 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-03 01:09:02,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-03 01:09:02,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-03 01:09:02,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-03 01:09:02,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-03 01:09:02,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-03 01:09:02,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-03 01:09:02,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-03 01:09:02,177 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-03 01:09:02,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-03 01:09:02,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-03 01:09:02,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-03 01:09:02,181 INFO L138 SettingsManager]: * Use SBE=true [2020-12-03 01:09:02,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-03 01:09:02,182 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-03 01:09:02,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-03 01:09:02,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-03 01:09:02,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-03 01:09:02,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-03 01:09:02,184 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-03 01:09:02,184 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-03 01:09:02,184 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-03 01:09:02,184 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-03 01:09:02,185 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-03 01:09:02,185 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-03 01:09:02,185 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-03 01:09:02,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-03 01:09:02,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-03 01:09:02,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-03 01:09:02,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-03 01:09:02,187 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-03 01:09:02,187 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-03 01:09:02,187 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-03 01:09:02,187 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-03 01:09:02,188 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-03 01:09:02,188 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-03 01:09:02,188 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-03 01:09:02,188 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-03 01:09:02,189 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 51c288f40d68a666851060907ab6bc13e9c502d2 [2020-12-03 01:09:02,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-03 01:09:02,622 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-03 01:09:02,626 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-03 01:09:02,628 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-03 01:09:02,629 INFO L275 PluginConnector]: CDTParser initialized [2020-12-03 01:09:02,630 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-12-03 01:09:02,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a07a1cdb/0be95ab5b86940bbaf143f84f048d25b/FLAG750a1d719 [2020-12-03 01:09:03,283 INFO L306 CDTParser]: Found 1 translation units. [2020-12-03 01:09:03,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2020-12-03 01:09:03,292 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a07a1cdb/0be95ab5b86940bbaf143f84f048d25b/FLAG750a1d719 [2020-12-03 01:09:03,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a07a1cdb/0be95ab5b86940bbaf143f84f048d25b [2020-12-03 01:09:03,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-03 01:09:03,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-03 01:09:03,681 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-03 01:09:03,681 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-03 01:09:03,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-03 01:09:03,686 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:09:03" (1/1) ... [2020-12-03 01:09:03,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18dbb8a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:03, skipping insertion in model container [2020-12-03 01:09:03,694 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 01:09:03" (1/1) ... [2020-12-03 01:09:03,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-03 01:09:03,732 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-03 01:09:03,937 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2020-12-03 01:09:03,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:03,967 INFO L203 MainTranslator]: Completed pre-run [2020-12-03 01:09:04,020 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c[1765,1778] [2020-12-03 01:09:04,023 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-03 01:09:04,059 INFO L208 MainTranslator]: Completed translation [2020-12-03 01:09:04,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04 WrapperNode [2020-12-03 01:09:04,060 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-03 01:09:04,061 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:04,061 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-03 01:09:04,062 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-03 01:09:04,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,096 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-03 01:09:04,141 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-03 01:09:04,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-03 01:09:04,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-03 01:09:04,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,164 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,169 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (1/1) ... [2020-12-03 01:09:04,175 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-03 01:09:04,176 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-03 01:09:04,176 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-03 01:09:04,176 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-03 01:09:04,177 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (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 [2020-12-03 01:09:04,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-03 01:09:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-03 01:09:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-03 01:09:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-03 01:09:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-03 01:09:04,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-03 01:09:04,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-03 01:09:04,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-03 01:09:04,685 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-03 01:09:04,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:04 BoogieIcfgContainer [2020-12-03 01:09:04,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-03 01:09:04,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-03 01:09:04,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-03 01:09:04,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-03 01:09:04,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 01:09:03" (1/3) ... [2020-12-03 01:09:04,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfc15b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:04, skipping insertion in model container [2020-12-03 01:09:04,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 01:09:04" (2/3) ... [2020-12-03 01:09:04,696 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bfc15b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 01:09:04, skipping insertion in model container [2020-12-03 01:09:04,696 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:04" (3/3) ... [2020-12-03 01:09:04,697 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2020-12-03 01:09:04,714 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-03 01:09:04,718 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-03 01:09:04,731 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-03 01:09:04,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-03 01:09:04,760 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-03 01:09:04,760 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-03 01:09:04,760 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-03 01:09:04,760 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-03 01:09:04,760 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-03 01:09:04,761 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-03 01:09:04,761 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-03 01:09:04,777 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-03 01:09:04,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-03 01:09:04,784 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:04,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:04,785 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:04,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:04,792 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-03 01:09:04,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:04,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220996055] [2020-12-03 01:09:04,806 INFO L95 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 [2020-12-03 01:09:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:04,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-03 01:09:04,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:05,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:05,003 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:05,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220996055] [2020-12-03 01:09:05,005 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:05,005 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-03 01:09:05,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945878065] [2020-12-03 01:09:05,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-03 01:09:05,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:05,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-03 01:09:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:09:05,030 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-03 01:09:05,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:05,051 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-03 01:09:05,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-03 01:09:05,053 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-03 01:09:05,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:05,063 INFO L225 Difference]: With dead ends: 56 [2020-12-03 01:09:05,063 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:09:05,066 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-03 01:09:05,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:09:05,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:09:05,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-03 01:09:05,105 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-03 01:09:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:05,106 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-03 01:09:05,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-03 01:09:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-03 01:09:05,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-03 01:09:05,107 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:05,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:05,322 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-03 01:09:05,322 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:05,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:05,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-03 01:09:05,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:05,326 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [478544771] [2020-12-03 01:09:05,326 INFO L95 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 [2020-12-03 01:09:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:05,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:05,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:05,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:05,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:05,557 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [478544771] [2020-12-03 01:09:05,557 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:05,558 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:05,558 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786533858] [2020-12-03 01:09:05,559 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:05,559 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:05,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:05,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:05,561 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:05,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:05,761 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-12-03 01:09:05,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:05,762 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-03 01:09:05,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:05,763 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:05,763 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:05,764 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:05,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:05,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:05,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:05,771 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-03 01:09:05,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:05,771 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:05,771 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:05,771 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:05,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-03 01:09:05,772 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:05,772 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:05,986 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-03 01:09:05,986 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:05,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:05,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2020-12-03 01:09:05,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:05,989 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109222662] [2020-12-03 01:09:05,989 INFO L95 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 [2020-12-03 01:09:06,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:06,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:06,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:06,125 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:06,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109222662] [2020-12-03 01:09:06,126 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:06,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:06,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055467904] [2020-12-03 01:09:06,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:06,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:06,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:06,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:06,128 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:06,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:06,285 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:06,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:06,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-03 01:09:06,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:06,286 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:06,286 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:06,287 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:06,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:06,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:06,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:06,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:06,293 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-12-03 01:09:06,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:06,293 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:06,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:06,293 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:06,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-03 01:09:06,294 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:06,294 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:06,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-03 01:09:06,512 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:06,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:06,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2020-12-03 01:09:06,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:06,515 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1103454733] [2020-12-03 01:09:06,516 INFO L95 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 [2020-12-03 01:09:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:06,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:06,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:06,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:06,684 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1103454733] [2020-12-03 01:09:06,684 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:06,684 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:06,684 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745354253] [2020-12-03 01:09:06,685 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:06,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:06,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:06,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:06,688 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:06,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:06,767 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:06,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-03 01:09:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:06,769 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:06,770 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:06,771 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:06,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:06,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:06,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:06,787 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-12-03 01:09:06,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:06,787 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:06,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:06,788 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:06,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:06,789 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:06,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:07,012 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-03 01:09:07,013 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:07,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:07,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-12-03 01:09:07,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:07,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [120966289] [2020-12-03 01:09:07,016 INFO L95 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 [2020-12-03 01:09:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:07,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:07,112 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:07,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:07,134 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:07,135 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [120966289] [2020-12-03 01:09:07,135 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:07,135 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:07,135 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125767352] [2020-12-03 01:09:07,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:07,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:07,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:07,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:07,137 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-03 01:09:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:07,196 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-03 01:09:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:07,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-03 01:09:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:07,198 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:07,198 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:07,198 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:07,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:07,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:07,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:07,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-03 01:09:07,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-12-03 01:09:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:07,204 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-03 01:09:07,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:07,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-03 01:09:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-03 01:09:07,205 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:07,205 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:07,424 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-03 01:09:07,425 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:07,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-03 01:09:07,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:07,428 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496447543] [2020-12-03 01:09:07,428 INFO L95 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 [2020-12-03 01:09:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:07,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-03 01:09:07,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:07,651 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-03 01:09:07,658 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-03 01:09:07,661 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:07,662 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-03 01:09:07,670 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:07,672 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-03 01:09:07,673 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-12-03 01:09:09,678 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~lsw~0))) is different from true [2020-12-03 01:09:17,327 WARN L197 SmtUtils]: Spent 7.48 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-03 01:09:21,521 WARN L197 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2020-12-03 01:09:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:21,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:21,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496447543] [2020-12-03 01:09:21,543 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:21,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-03 01:09:21,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903679954] [2020-12-03 01:09:21,544 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-03 01:09:21,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:21,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-03 01:09:21,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=31, Unknown=1, NotChecked=10, Total=56 [2020-12-03 01:09:21,546 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 8 states. [2020-12-03 01:09:25,761 WARN L197 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 28 [2020-12-03 01:09:29,881 WARN L197 SmtUtils]: Spent 4.09 s on a formula simplification that was a NOOP. DAG size: 44 [2020-12-03 01:09:34,285 WARN L197 SmtUtils]: Spent 4.23 s on a formula simplification that was a NOOP. DAG size: 42 [2020-12-03 01:09:38,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:38,469 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2020-12-03 01:09:38,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-03 01:09:38,470 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2020-12-03 01:09:38,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:38,471 INFO L225 Difference]: With dead ends: 62 [2020-12-03 01:09:38,471 INFO L226 Difference]: Without dead ends: 46 [2020-12-03 01:09:38,472 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=56, Invalid=128, Unknown=2, NotChecked=24, Total=210 [2020-12-03 01:09:38,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-03 01:09:38,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 26. [2020-12-03 01:09:38,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:38,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-12-03 01:09:38,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2020-12-03 01:09:38,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:38,479 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-12-03 01:09:38,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-03 01:09:38,479 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-12-03 01:09:38,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-03 01:09:38,480 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:38,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:38,692 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-03 01:09:38,693 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:38,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:38,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2020-12-03 01:09:38,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:38,695 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1129386360] [2020-12-03 01:09:38,696 INFO L95 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 [2020-12-03 01:09:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:38,793 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:38,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:38,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:38,822 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:38,823 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1129386360] [2020-12-03 01:09:38,823 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:38,823 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:38,824 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156442557] [2020-12-03 01:09:38,824 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:38,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:38,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:38,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:38,837 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 4 states. [2020-12-03 01:09:38,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:38,936 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2020-12-03 01:09:38,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:38,937 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-12-03 01:09:38,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:38,938 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:38,938 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:38,938 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:38,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:38,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:38,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:38,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-03 01:09:38,946 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2020-12-03 01:09:38,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:38,946 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-03 01:09:38,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:38,946 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-03 01:09:38,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-03 01:09:38,947 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:38,947 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:39,160 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-03 01:09:39,161 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:39,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:39,162 INFO L82 PathProgramCache]: Analyzing trace with hash -666515868, now seen corresponding path program 1 times [2020-12-03 01:09:39,163 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:39,163 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [719469121] [2020-12-03 01:09:39,163 INFO L95 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 [2020-12-03 01:09:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:39,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:39,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:39,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:39,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:39,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [719469121] [2020-12-03 01:09:39,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:39,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:39,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638188502] [2020-12-03 01:09:39,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:39,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:39,308 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:39,400 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2020-12-03 01:09:39,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:39,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-12-03 01:09:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:39,401 INFO L225 Difference]: With dead ends: 42 [2020-12-03 01:09:39,401 INFO L226 Difference]: Without dead ends: 38 [2020-12-03 01:09:39,402 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-03 01:09:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-03 01:09:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:39,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-03 01:09:39,408 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 18 [2020-12-03 01:09:39,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:39,408 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-03 01:09:39,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:39,408 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-03 01:09:39,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:09:39,409 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:39,409 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:39,623 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-03 01:09:39,623 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2020-12-03 01:09:39,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:39,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923723563] [2020-12-03 01:09:39,626 INFO L95 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 [2020-12-03 01:09:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:39,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-03 01:09:39,724 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:39,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:39,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:39,824 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923723563] [2020-12-03 01:09:39,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:39,825 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:39,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474924763] [2020-12-03 01:09:39,825 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:39,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:39,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:39,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:39,827 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 4 states. [2020-12-03 01:09:39,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:39,894 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-03 01:09:39,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:39,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-12-03 01:09:39,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:39,898 INFO L225 Difference]: With dead ends: 33 [2020-12-03 01:09:39,898 INFO L226 Difference]: Without dead ends: 28 [2020-12-03 01:09:39,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:39,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-03 01:09:39,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-03 01:09:39,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:39,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-03 01:09:39,908 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2020-12-03 01:09:39,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:39,908 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-03 01:09:39,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:39,909 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-03 01:09:39,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-03 01:09:39,913 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:39,913 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:40,132 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-03 01:09:40,133 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:40,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2020-12-03 01:09:40,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:40,135 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416351631] [2020-12-03 01:09:40,135 INFO L95 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 [2020-12-03 01:09:40,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:40,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-03 01:09:40,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:40,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:40,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:40,403 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416351631] [2020-12-03 01:09:40,403 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:40,403 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:09:40,403 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890981320] [2020-12-03 01:09:40,403 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:09:40,403 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:09:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:09:40,404 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2020-12-03 01:09:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:42,917 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2020-12-03 01:09:42,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:09:42,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-03 01:09:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:42,919 INFO L225 Difference]: With dead ends: 38 [2020-12-03 01:09:42,919 INFO L226 Difference]: Without dead ends: 28 [2020-12-03 01:09:42,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2020-12-03 01:09:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-03 01:09:42,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-12-03 01:09:42,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:42,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2020-12-03 01:09:42,926 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2020-12-03 01:09:42,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:42,926 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2020-12-03 01:09:42,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:09:42,926 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2020-12-03 01:09:42,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:09:42,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:42,927 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:43,138 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-03 01:09:43,141 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:43,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:43,142 INFO L82 PathProgramCache]: Analyzing trace with hash 782688991, now seen corresponding path program 1 times [2020-12-03 01:09:43,143 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:43,143 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353378182] [2020-12-03 01:09:43,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:43,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:43,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:43,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:43,281 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:43,283 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353378182] [2020-12-03 01:09:43,283 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:43,283 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:43,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283496344] [2020-12-03 01:09:43,284 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:43,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:43,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:43,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:43,287 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 4 states. [2020-12-03 01:09:43,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:43,514 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2020-12-03 01:09:43,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:43,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-12-03 01:09:43,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:43,517 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:43,519 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:43,519 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:43,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:43,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-03 01:09:43,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-03 01:09:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-12-03 01:09:43,541 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-12-03 01:09:43,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:43,543 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-12-03 01:09:43,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:43,544 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-12-03 01:09:43,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-03 01:09:43,545 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:43,545 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:43,760 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-12-03 01:09:43,761 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:43,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2020-12-03 01:09:43,762 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:43,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017837273] [2020-12-03 01:09:43,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:43,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-03 01:09:43,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:43,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-03 01:09:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:44,398 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:44,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017837273] [2020-12-03 01:09:44,398 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:44,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:09:44,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198317597] [2020-12-03 01:09:44,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:09:44,399 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:09:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:09:44,400 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 7 states. [2020-12-03 01:09:44,652 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 29 [2020-12-03 01:09:44,956 WARN L197 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 25 [2020-12-03 01:09:45,188 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 27 [2020-12-03 01:09:45,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:45,255 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2020-12-03 01:09:45,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-03 01:09:45,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-12-03 01:09:45,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:45,256 INFO L225 Difference]: With dead ends: 50 [2020-12-03 01:09:45,256 INFO L226 Difference]: Without dead ends: 46 [2020-12-03 01:09:45,257 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 9 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:09:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-03 01:09:45,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 36. [2020-12-03 01:09:45,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-03 01:09:45,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-12-03 01:09:45,264 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2020-12-03 01:09:45,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:45,265 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-12-03 01:09:45,265 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:09:45,265 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-12-03 01:09:45,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-03 01:09:45,265 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:45,266 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:45,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2020-12-03 01:09:45,480 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:45,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:45,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1085928516, now seen corresponding path program 1 times [2020-12-03 01:09:45,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:45,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2061071898] [2020-12-03 01:09:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:45,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 01:09:45,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:45,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:45,802 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:45,803 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2061071898] [2020-12-03 01:09:45,803 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:45,803 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-03 01:09:45,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344364476] [2020-12-03 01:09:45,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-03 01:09:45,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:45,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-03 01:09:45,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-03 01:09:45,804 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 7 states. [2020-12-03 01:09:45,989 WARN L197 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2020-12-03 01:09:46,138 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2020-12-03 01:09:46,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:46,243 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2020-12-03 01:09:46,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-03 01:09:46,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-12-03 01:09:46,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:46,251 INFO L225 Difference]: With dead ends: 40 [2020-12-03 01:09:46,251 INFO L226 Difference]: Without dead ends: 36 [2020-12-03 01:09:46,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-03 01:09:46,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-03 01:09:46,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 26. [2020-12-03 01:09:46,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:46,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2020-12-03 01:09:46,261 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 21 [2020-12-03 01:09:46,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:46,261 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2020-12-03 01:09:46,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-03 01:09:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2020-12-03 01:09:46,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:09:46,264 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:46,264 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:46,478 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2020-12-03 01:09:46,478 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:46,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:46,479 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2020-12-03 01:09:46,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:46,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382542008] [2020-12-03 01:09:46,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:46,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-03 01:09:46,575 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:46,673 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-03 01:09:46,685 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-03 01:09:46,688 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:46,690 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-03 01:09:46,715 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-03 01:09:46,716 INFO L547 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. [2020-12-03 01:09:46,717 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2020-12-03 01:09:46,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:46,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:46,826 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382542008] [2020-12-03 01:09:46,827 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:46,827 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-03 01:09:46,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895197455] [2020-12-03 01:09:46,828 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-03 01:09:46,828 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:46,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-03 01:09:46,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-03 01:09:46,829 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 6 states. [2020-12-03 01:09:47,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:47,299 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-12-03 01:09:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-03 01:09:47,305 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-03 01:09:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:47,306 INFO L225 Difference]: With dead ends: 34 [2020-12-03 01:09:47,306 INFO L226 Difference]: Without dead ends: 26 [2020-12-03 01:09:47,306 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-12-03 01:09:47,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-03 01:09:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-03 01:09:47,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-03 01:09:47,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2020-12-03 01:09:47,312 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2020-12-03 01:09:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:47,312 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2020-12-03 01:09:47,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-03 01:09:47,312 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2020-12-03 01:09:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-03 01:09:47,313 INFO L414 BasicCegarLoop]: Found error trace [2020-12-03 01:09:47,313 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-03 01:09:47,526 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2020-12-03 01:09:47,527 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-03 01:09:47,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-03 01:09:47,528 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2020-12-03 01:09:47,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-03 01:09:47,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396993568] [2020-12-03 01:09:47,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2020-12-03 01:09:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-03 01:09:47,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-03 01:09:47,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-03 01:09:47,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-03 01:09:47,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2020-12-03 01:09:47,675 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396993568] [2020-12-03 01:09:47,675 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-03 01:09:47,675 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-03 01:09:47,676 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43259158] [2020-12-03 01:09:47,677 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-03 01:09:47,678 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-03 01:09:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-03 01:09:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-03 01:09:47,678 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 4 states. [2020-12-03 01:09:47,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-03 01:09:47,749 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2020-12-03 01:09:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-03 01:09:47,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-03 01:09:47,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-03 01:09:47,750 INFO L225 Difference]: With dead ends: 26 [2020-12-03 01:09:47,750 INFO L226 Difference]: Without dead ends: 0 [2020-12-03 01:09:47,750 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-03 01:09:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-03 01:09:47,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-03 01:09:47,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-03 01:09:47,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-03 01:09:47,752 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-12-03 01:09:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-03 01:09:47,752 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-03 01:09:47,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-03 01:09:47,752 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-03 01:09:47,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-03 01:09:47,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2020-12-03 01:09:47,956 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-03 01:09:48,097 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 47 [2020-12-03 01:09:48,706 WARN L197 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 36 [2020-12-03 01:09:49,143 WARN L197 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 42 [2020-12-03 01:09:54,190 WARN L197 SmtUtils]: Spent 5.05 s on a formula simplification. DAG size of input: 121 DAG size of output: 34 [2020-12-03 01:09:54,340 WARN L197 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2020-12-03 01:09:54,342 INFO L262 CegarLoopResult]: For program point L64(lines 64 73) no Hoare annotation was computed. [2020-12-03 01:09:54,342 INFO L262 CegarLoopResult]: For program point L64-2(lines 64 73) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L52(line 52) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L52-2(line 52) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L258 CegarLoopResult]: At program point L52-3(lines 46 53) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= |ULTIMATE.start_fmin_double_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (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|))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L69(lines 69 72) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L32(lines 32 43) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point L32-1(lines 32 43) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-03 01:09:54,343 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-03 01:09:54,344 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2020-12-03 01:09:54,344 INFO L262 CegarLoopResult]: For program point L49(lines 49 50) no Hoare annotation was computed. [2020-12-03 01:09:54,344 INFO L262 CegarLoopResult]: For program point L70(line 70) no Hoare annotation was computed. [2020-12-03 01:09:54,344 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-03 01:09:54,344 INFO L265 CegarLoopResult]: At program point L75(lines 55 76) the Hoare annotation is: true [2020-12-03 01:09:54,344 INFO L262 CegarLoopResult]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2020-12-03 01:09:54,345 INFO L258 CegarLoopResult]: At program point L22-2(lines 22 27) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~x ULTIMATE.start___fpclassify_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) [2020-12-03 01:09:54,345 INFO L262 CegarLoopResult]: For program point L22-3(lines 19 44) no Hoare annotation was computed. [2020-12-03 01:09:54,345 INFO L258 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))))) [2020-12-03 01:09:54,345 INFO L262 CegarLoopResult]: For program point L22-5(lines 22 27) no Hoare annotation was computed. [2020-12-03 01:09:54,345 INFO L258 CegarLoopResult]: At program point L22-6(lines 22 27) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:09:54,345 INFO L262 CegarLoopResult]: For program point L47(lines 47 48) no Hoare annotation was computed. [2020-12-03 01:09:54,345 INFO L262 CegarLoopResult]: For program point L22-7(lines 19 44) no Hoare annotation was computed. [2020-12-03 01:09:54,346 INFO L258 CegarLoopResult]: At program point L43(lines 19 44) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= ULTIMATE.start_fmin_double_~x (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|))))) (= ULTIMATE.start_fmin_double_~x ULTIMATE.start___fpclassify_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (or (= (_ bv3 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv1 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv2 32) |ULTIMATE.start___fpclassify_double_#res|) (= (_ bv4 32) |ULTIMATE.start___fpclassify_double_#res|)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) [2020-12-03 01:09:54,346 INFO L258 CegarLoopResult]: At program point L43-1(lines 19 44) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (= ULTIMATE.start___fpclassify_double_~lsw~0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-03 01:09:54,346 INFO L262 CegarLoopResult]: For program point L39(lines 39 43) no Hoare annotation was computed. [2020-12-03 01:09:54,346 INFO L262 CegarLoopResult]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2020-12-03 01:09:54,346 INFO L262 CegarLoopResult]: For program point L35(lines 35 43) no Hoare annotation was computed. [2020-12-03 01:09:54,346 INFO L262 CegarLoopResult]: For program point L35-1(lines 35 43) no Hoare annotation was computed. [2020-12-03 01:09:54,356 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,358 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,359 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,369 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,370 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,371 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,372 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,373 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,374 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,375 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,376 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,377 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,378 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,379 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,380 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,381 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,382 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,383 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 01:09:54 BoogieIcfgContainer [2020-12-03 01:09:54,385 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-03 01:09:54,386 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-03 01:09:54,386 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-03 01:09:54,386 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-03 01:09:54,386 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 01:09:04" (3/4) ... [2020-12-03 01:09:54,390 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-03 01:09:54,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2020-12-03 01:09:54,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-03 01:09:54,402 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-03 01:09:54,403 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-03 01:09:54,430 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) [2020-12-03 01:09:54,431 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result [2020-12-03 01:09:54,431 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ~fp.eq~DOUBLE(x, x)) && x == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && x == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && (((3bv32 == \result || 1bv32 == \result) || 2bv32 == \result) || 4bv32 == \result)) && 0bv32 == \result [2020-12-03 01:09:54,432 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && \result == x) && x == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:09:54,432 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:09:54,432 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-03 01:09:54,454 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-03 01:09:54,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-03 01:09:54,455 INFO L168 Benchmark]: Toolchain (without parser) took 50776.99 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 27.1 MB in the beginning and 32.0 MB in the end (delta: -4.8 MB). Peak memory consumption was 8.7 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,455 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 39.8 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:09:54,456 INFO L168 Benchmark]: CACSL2BoogieTranslator took 379.32 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 27.1 MB in the end (delta: -212.9 kB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,456 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 50.3 MB. Free memory was 27.1 MB in the beginning and 25.3 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-03 01:09:54,457 INFO L168 Benchmark]: Boogie Preprocessor took 34.02 ms. Allocated memory is still 50.3 MB. Free memory was 25.3 MB in the beginning and 23.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,457 INFO L168 Benchmark]: RCFGBuilder took 511.72 ms. Allocated memory is still 50.3 MB. Free memory was 23.7 MB in the beginning and 29.7 MB in the end (delta: -6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,458 INFO L168 Benchmark]: TraceAbstraction took 49695.44 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 29.4 MB in the beginning and 35.6 MB in the end (delta: -6.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,458 INFO L168 Benchmark]: Witness Printer took 68.33 ms. Allocated memory is still 60.8 MB. Free memory was 35.6 MB in the beginning and 32.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-03 01:09:54,461 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 39.8 MB. Free memory was 17.9 MB in the beginning and 17.8 MB in the end (delta: 69.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 379.32 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 27.1 MB in the end (delta: -212.9 kB). Peak memory consumption was 7.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.63 ms. Allocated memory is still 50.3 MB. Free memory was 27.1 MB in the beginning and 25.3 MB in the end (delta: 1.9 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 34.02 ms. Allocated memory is still 50.3 MB. Free memory was 25.3 MB in the beginning and 23.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 511.72 ms. Allocated memory is still 50.3 MB. Free memory was 23.7 MB in the beginning and 29.7 MB in the end (delta: -6.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 49695.44 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 29.4 MB in the beginning and 35.6 MB in the end (delta: -6.2 MB). Peak memory consumption was 28.4 MB. Max. memory is 16.1 GB. * Witness Printer took 68.33 ms. Allocated memory is still 60.8 MB. Free memory was 35.6 MB in the beginning and 32.0 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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[currentRoundingMode,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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[currentRoundingMode,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 Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 70]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant [2020-12-03 01:09:54,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,468 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,469 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,470 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,471 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 22]: Loop Invariant [2020-12-03 01:09:54,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,472 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2020-12-03 01:09:54,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,473 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,474 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-03 01:09:54,475 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ~fp.eq~DOUBLE(x, x)) && x == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && x == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && (((3bv32 == \result || 1bv32 == \result) || 2bv32 == \result) || 4bv32 == \result)) && 0bv32 == \result - InvariantResult [Line: 46]: Loop Invariant [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,476 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,477 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-03 01:09:54,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,478 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && \result == x) && x == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 18]: Loop Invariant [2020-12-03 01:09:54,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) - InvariantResult [Line: 22]: Loop Invariant [2020-12-03 01:09:54,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,479 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-03 01:09:54,480 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 43.1s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 486 SDtfs, 406 SDslu, 710 SDs, 0 SdLazy, 365 SolverSat, 18 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 192 SyntacticMatches, 9 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 28.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 14 NumberOfFragments, 246 HoareAnnotationTreeSize, 7 FomulaSimplifications, 11244 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 4093 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 15.7s InterpolantComputationTime, 258 NumberOfCodeBlocks, 258 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 243 ConstructedInterpolants, 55 QuantifiedInterpolants, 26914 SizeOfPredicates, 60 NumberOfNonLiveVariables, 994 ConjunctsInSsa, 88 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...