./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 20ed64ec 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.1-dev-20ed64e [2021-08-26 01:42:06,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:06,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:06,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:06,682 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:06,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:06,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:06,691 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:06,692 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:06,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:06,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:06,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:06,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:06,701 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:06,702 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:06,707 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:06,708 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:06,708 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:06,710 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:06,715 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:06,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:06,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:06,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:06,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:06,721 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:06,721 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:06,722 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:06,723 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:06,723 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:06,724 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:06,724 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:06,725 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:06,726 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:06,727 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:06,728 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:06,728 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:06,729 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:06,729 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:06,730 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:06,731 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:06,732 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:06,733 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 01:42:06,764 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:06,765 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:06,765 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:06,765 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:06,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:06,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:06,767 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:06,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:06,768 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:06,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 01:42:06,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:06,769 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:06,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:06,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:06,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:06,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:06,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:06,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:06,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:06,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:06,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 01:42:06,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 01:42:06,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:06,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:06,771 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 [2021-08-26 01:42:07,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:07,079 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:07,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:07,082 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:07,082 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:07,083 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 [2021-08-26 01:42:07,135 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d5927a1/30f9616d648b4a4a82dc1fba51d92e7f/FLAGaf835b133 [2021-08-26 01:42:07,478 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:07,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-08-26 01:42:07,484 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d5927a1/30f9616d648b4a4a82dc1fba51d92e7f/FLAGaf835b133 [2021-08-26 01:42:07,497 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d5927a1/30f9616d648b4a4a82dc1fba51d92e7f [2021-08-26 01:42:07,499 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:07,500 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:07,503 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:07,503 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:07,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:07,506 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7959fb99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07, skipping insertion in model container [2021-08-26 01:42:07,507 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,512 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:07,521 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:07,644 WARN L228 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] [2021-08-26 01:42:07,684 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:07,695 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:07,725 WARN L228 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] [2021-08-26 01:42:07,730 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:07,738 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:07,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07 WrapperNode [2021-08-26 01:42:07,740 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:07,741 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:07,741 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:07,741 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:07,745 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:07,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:07,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:07,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:07,786 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,787 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:07,816 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:07,816 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:07,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:07,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (1/1) ... [2021-08-26 01:42:07,822 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:07,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:07,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:07,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 01:42:07,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:07,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2021-08-26 01:42:07,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:07,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:07,973 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-26 01:42:07,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:08,341 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:08,344 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-08-26 01:42:08,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:08 BoogieIcfgContainer [2021-08-26 01:42:08,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:08,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:08,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:08,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:08,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:07" (1/3) ... [2021-08-26 01:42:08,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1716a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:08, skipping insertion in model container [2021-08-26 01:42:08,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:07" (2/3) ... [2021-08-26 01:42:08,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1716a4d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:08, skipping insertion in model container [2021-08-26 01:42:08,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:08" (3/3) ... [2021-08-26 01:42:08,352 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2021-08-26 01:42:08,355 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:08,355 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:08,393 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:08,399 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:08,400 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:08,412 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,413 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,417 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2021-08-26 01:42:08,422 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,423 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159633844] [2021-08-26 01:42:08,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:08,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:08,537 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159633844] [2021-08-26 01:42:08,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159633844] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:08,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:08,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 01:42:08,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042464369] [2021-08-26 01:42:08,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:08,542 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:08,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:08,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:08,552 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:08,565 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2021-08-26 01:42:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:08,566 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:08,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:08,571 INFO L225 Difference]: With dead ends: 56 [2021-08-26 01:42:08,571 INFO L226 Difference]: Without dead ends: 26 [2021-08-26 01:42:08,573 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:08,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-26 01:42:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-26 01:42:08,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2021-08-26 01:42:08,594 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2021-08-26 01:42:08,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:08,595 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-08-26 01:42:08,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,595 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-08-26 01:42:08,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:42:08,596 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 01:42:08,596 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2021-08-26 01:42:08,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,599 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857394125] [2021-08-26 01:42:08,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,599 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:08,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:08,705 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:08,705 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857394125] [2021-08-26 01:42:08,706 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857394125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:08,706 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:08,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:08,706 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834548267] [2021-08-26 01:42:08,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:08,707 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:08,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:08,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:08,709 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:08,748 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2021-08-26 01:42:08,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:08,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:42:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:08,750 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:42:08,750 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:42:08,750 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:08,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:42:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2021-08-26 01:42:08,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:08,754 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2021-08-26 01:42:08,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:08,754 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:08,754 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:08,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 01:42:08,755 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,755 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,755 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 01:42:08,756 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2021-08-26 01:42:08,756 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,757 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553050257] [2021-08-26 01:42:08,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,757 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:08,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:08,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:08,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553050257] [2021-08-26 01:42:08,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553050257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:08,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:08,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:08,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892579124] [2021-08-26 01:42:08,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:08,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:08,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:08,789 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:08,815 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2021-08-26 01:42:08,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 01:42:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:08,816 INFO L225 Difference]: With dead ends: 42 [2021-08-26 01:42:08,816 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 01:42:08,817 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:08,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 01:42:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2021-08-26 01:42:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:08,820 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2021-08-26 01:42:08,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:08,820 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:08,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:08,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-26 01:42:08,821 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,821 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 01:42:08,821 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2021-08-26 01:42:08,822 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,822 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536862918] [2021-08-26 01:42:08,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,822 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:08,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:08,852 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:08,853 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536862918] [2021-08-26 01:42:08,853 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536862918] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:08,853 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:08,853 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:08,853 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591015801] [2021-08-26 01:42:08,854 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:08,854 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:08,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:08,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:08,855 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:08,881 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2021-08-26 01:42:08,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:08,882 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-26 01:42:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:08,882 INFO L225 Difference]: With dead ends: 44 [2021-08-26 01:42:08,882 INFO L226 Difference]: Without dead ends: 40 [2021-08-26 01:42:08,883 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-08-26 01:42:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2021-08-26 01:42:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:08,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2021-08-26 01:42:08,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:08,886 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:08,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,886 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:08,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:08,887 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,887 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 01:42:08,887 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2021-08-26 01:42:08,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998634894] [2021-08-26 01:42:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,888 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:08,919 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 01:42:08,919 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998634894] [2021-08-26 01:42:08,919 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [998634894] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:08,919 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:08,919 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 01:42:08,919 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159778862] [2021-08-26 01:42:08,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:42:08,920 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 01:42:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:42:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:42:08,921 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:08,950 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2021-08-26 01:42:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:08,951 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 01:42:08,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:08,951 INFO L225 Difference]: With dead ends: 42 [2021-08-26 01:42:08,951 INFO L226 Difference]: Without dead ends: 38 [2021-08-26 01:42:08,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:42:08,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-08-26 01:42:08,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2021-08-26 01:42:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:08,955 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2021-08-26 01:42:08,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:08,955 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:08,955 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:08,955 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:08,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:08,956 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:08,956 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:08,956 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 01:42:08,956 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:08,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:08,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2021-08-26 01:42:08,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 01:42:08,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622453588] [2021-08-26 01:42:08,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:08,957 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 01:42:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:08,972 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 01:42:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 01:42:08,996 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 01:42:08,997 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 01:42:08,997 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:42:08,998 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 01:42:09,002 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:42:09,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:42:09 BoogieIcfgContainer [2021-08-26 01:42:09,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:42:09,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:42:09,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:42:09,016 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:42:09,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:08" (3/4) ... [2021-08-26 01:42:09,018 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-26 01:42:09,018 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:42:09,020 INFO L168 Benchmark]: Toolchain (without parser) took 1518.87 ms. Allocated memory was 62.9 MB in the beginning and 90.2 MB in the end (delta: 27.3 MB). Free memory was 43.1 MB in the beginning and 59.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 11.8 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:09,020 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 62.9 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:09,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 237.61 ms. Allocated memory is still 62.9 MB. Free memory was 42.8 MB in the beginning and 45.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:09,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 43.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:09,021 INFO L168 Benchmark]: Boogie Preprocessor took 35.83 ms. Allocated memory is still 62.9 MB. Free memory was 43.6 MB in the beginning and 42.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:09,022 INFO L168 Benchmark]: RCFGBuilder took 529.45 ms. Allocated memory was 62.9 MB in the beginning and 90.2 MB in the end (delta: 27.3 MB). Free memory was 42.2 MB in the beginning and 67.6 MB in the end (delta: -25.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:09,022 INFO L168 Benchmark]: TraceAbstraction took 668.99 ms. Allocated memory is still 90.2 MB. Free memory was 67.2 MB in the beginning and 59.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:42:09,022 INFO L168 Benchmark]: Witness Printer took 2.47 ms. Allocated memory is still 90.2 MB. Free memory is still 59.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:42:09,026 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.14 ms. Allocated memory is still 62.9 MB. Free memory is still 44.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 237.61 ms. Allocated memory is still 62.9 MB. Free memory was 42.8 MB in the beginning and 45.5 MB in the end (delta: -2.7 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 37.72 ms. Allocated memory is still 62.9 MB. Free memory was 45.3 MB in the beginning and 43.6 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.83 ms. Allocated memory is still 62.9 MB. Free memory was 43.6 MB in the beginning and 42.2 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 529.45 ms. Allocated memory was 62.9 MB in the beginning and 90.2 MB in the end (delta: 27.3 MB). Free memory was 42.2 MB in the beginning and 67.6 MB in the end (delta: -25.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 668.99 ms. Allocated memory is still 90.2 MB. Free memory was 67.2 MB in the beginning and 59.8 MB in the end (delta: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 16.1 GB. * Witness Printer took 2.47 ms. Allocated memory is still 90.2 MB. Free memory is still 59.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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. OverallTime: 609.9ms, OverallIterations: 6, TraceHistogramMax: 1, EmptinessCheckTime: 8.1ms, AutomataDifference: 162.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 7.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 209 SDtfs, 40 SDslu, 242 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.8ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 24.5ms AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 15.9ms SsaConstructionTime, 82.8ms SatisfiabilityAnalysisTime, 170.4ms InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 76 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 [2021-08-26 01:42:09,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.1-dev-20ed64e [2021-08-26 01:42:11,077 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 01:42:11,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 01:42:11,115 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 01:42:11,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 01:42:11,119 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 01:42:11,120 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 01:42:11,125 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 01:42:11,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 01:42:11,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 01:42:11,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 01:42:11,142 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 01:42:11,142 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 01:42:11,144 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 01:42:11,145 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 01:42:11,149 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 01:42:11,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 01:42:11,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 01:42:11,154 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 01:42:11,155 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 01:42:11,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 01:42:11,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 01:42:11,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 01:42:11,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 01:42:11,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 01:42:11,165 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 01:42:11,165 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 01:42:11,165 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 01:42:11,166 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 01:42:11,167 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 01:42:11,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 01:42:11,167 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 01:42:11,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 01:42:11,169 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 01:42:11,170 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 01:42:11,170 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 01:42:11,171 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 01:42:11,171 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 01:42:11,171 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 01:42:11,173 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 01:42:11,173 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 01:42:11,176 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-08-26 01:42:11,199 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 01:42:11,199 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 01:42:11,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 01:42:11,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 01:42:11,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 01:42:11,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 01:42:11,202 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 01:42:11,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 01:42:11,202 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 01:42:11,202 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-08-26 01:42:11,203 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 01:42:11,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 01:42:11,204 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 01:42:11,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:11,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 01:42:11,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 01:42:11,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 01:42:11,205 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-08-26 01:42:11,205 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-08-26 01:42:11,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 01:42:11,206 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 01:42:11,206 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-08-26 01:42:11,206 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 [2021-08-26 01:42:11,445 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 01:42:11,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 01:42:11,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 01:42:11,463 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 01:42:11,463 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 01:42:11,464 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 [2021-08-26 01:42:11,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412a5956c/b45404fe7d6945979185550bd9f8bb2b/FLAG5e0bd25e4 [2021-08-26 01:42:11,876 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 01:42:11,878 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1231b.c [2021-08-26 01:42:11,883 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412a5956c/b45404fe7d6945979185550bd9f8bb2b/FLAG5e0bd25e4 [2021-08-26 01:42:11,910 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/412a5956c/b45404fe7d6945979185550bd9f8bb2b [2021-08-26 01:42:11,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 01:42:11,914 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 01:42:11,915 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:11,915 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 01:42:11,917 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 01:42:11,918 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:11" (1/1) ... [2021-08-26 01:42:11,919 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487ef055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:11, skipping insertion in model container [2021-08-26 01:42:11,919 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 01:42:11" (1/1) ... [2021-08-26 01:42:11,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 01:42:11,933 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 01:42:12,057 WARN L228 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] [2021-08-26 01:42:12,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:12,074 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 01:42:12,120 WARN L228 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] [2021-08-26 01:42:12,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 01:42:12,136 INFO L208 MainTranslator]: Completed translation [2021-08-26 01:42:12,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12 WrapperNode [2021-08-26 01:42:12,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 01:42:12,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:12,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 01:42:12,138 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 01:42:12,142 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,156 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,176 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 01:42:12,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 01:42:12,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 01:42:12,177 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 01:42:12,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,211 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,213 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 01:42:12,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 01:42:12,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 01:42:12,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 01:42:12,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (1/1) ... [2021-08-26 01:42:12,221 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 01:42:12,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 01:42:12,232 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 01:42:12,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 01:42:12,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2021-08-26 01:42:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-08-26 01:42:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 01:42:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-08-26 01:42:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 01:42:12,267 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 01:42:12,267 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 01:42:12,605 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 01:42:12,606 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-08-26 01:42:12,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:12 BoogieIcfgContainer [2021-08-26 01:42:12,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 01:42:12,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 01:42:12,623 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 01:42:12,625 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 01:42:12,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 01:42:11" (1/3) ... [2021-08-26 01:42:12,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe00dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:12, skipping insertion in model container [2021-08-26 01:42:12,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 01:42:12" (2/3) ... [2021-08-26 01:42:12,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe00dbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 01:42:12, skipping insertion in model container [2021-08-26 01:42:12,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:12" (3/3) ... [2021-08-26 01:42:12,627 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1231b.c [2021-08-26 01:42:12,630 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 01:42:12,630 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-08-26 01:42:12,684 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 01:42:12,688 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 01:42:12,688 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-08-26 01:42:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:12,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 01:42:12,712 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:12,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:12,713 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2021-08-26 01:42:12,725 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:12,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252920146] [2021-08-26 01:42:12,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:12,730 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:12,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:12,732 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:12,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-08-26 01:42:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:12,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2021-08-26 01:42:12,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:12,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:12,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:12,972 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:12,972 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252920146] [2021-08-26 01:42:12,972 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252920146] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:12,973 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:12,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2021-08-26 01:42:12,974 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503664845] [2021-08-26 01:42:12,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-08-26 01:42:12,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:12,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-08-26 01:42:12,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:12,986 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:12,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:12,996 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2021-08-26 01:42:12,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-08-26 01:42:12,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 01:42:12,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:13,008 INFO L225 Difference]: With dead ends: 56 [2021-08-26 01:42:13,008 INFO L226 Difference]: Without dead ends: 26 [2021-08-26 01:42:13,009 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-08-26 01:42:13,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-08-26 01:42:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-08-26 01:42:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 25 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2021-08-26 01:42:13,031 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2021-08-26 01:42:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:13,031 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2021-08-26 01:42:13,032 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:13,032 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2021-08-26 01:42:13,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 01:42:13,033 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:13,033 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:13,044 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:13,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:13,243 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:13,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:13,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2021-08-26 01:42:13,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:13,246 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299197516] [2021-08-26 01:42:13,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:13,246 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:13,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:13,247 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-08-26 01:42:13,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:13,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:42:13,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:13,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:13,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:13,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:13,441 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:13,441 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299197516] [2021-08-26 01:42:13,441 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299197516] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:13,441 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:13,442 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:13,442 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198382758] [2021-08-26 01:42:13,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:13,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:13,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:13,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:13,444 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:13,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:13,511 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2021-08-26 01:42:13,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:42:13,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 01:42:13,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:13,513 INFO L225 Difference]: With dead ends: 50 [2021-08-26 01:42:13,513 INFO L226 Difference]: Without dead ends: 46 [2021-08-26 01:42:13,513 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 30.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:13,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-08-26 01:42:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2021-08-26 01:42:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 27 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2021-08-26 01:42:13,517 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2021-08-26 01:42:13,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:13,517 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2021-08-26 01:42:13,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:13,518 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2021-08-26 01:42:13,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-26 01:42:13,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:13,518 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:13,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:13,726 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:13,727 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2021-08-26 01:42:13,728 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:13,728 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026704090] [2021-08-26 01:42:13,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:13,729 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:13,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:13,730 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:13,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-08-26 01:42:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:13,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2021-08-26 01:42:13,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:13,919 INFO L388 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 35 treesize of output 33 [2021-08-26 01:42:15,565 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= c_ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~lsw~0) (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)))) is different from true [2021-08-26 01:42:17,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:17,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:19,459 INFO L388 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 75 treesize of output 71 [2021-08-26 01:42:19,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:19,829 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:19,829 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026704090] [2021-08-26 01:42:19,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026704090] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:19,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:19,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2021-08-26 01:42:19,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963565182] [2021-08-26 01:42:19,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-08-26 01:42:19,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:19,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-08-26 01:42:19,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2021-08-26 01:42:19,837 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:57,051 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2021-08-26 01:42:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-08-26 01:42:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-26 01:42:57,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:57,053 INFO L225 Difference]: With dead ends: 78 [2021-08-26 01:42:57,053 INFO L226 Difference]: Without dead ends: 62 [2021-08-26 01:42:57,053 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 19722.0ms TimeCoverageRelationStatistics Valid=153, Invalid=352, Unknown=5, NotChecked=42, Total=552 [2021-08-26 01:42:57,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-08-26 01:42:57,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 26. [2021-08-26 01:42:57,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2021-08-26 01:42:57,057 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2021-08-26 01:42:57,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:57,057 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2021-08-26 01:42:57,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 13 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,057 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2021-08-26 01:42:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-26 01:42:57,057 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:57,057 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:57,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:57,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:57,258 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:57,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:57,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2021-08-26 01:42:57,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:57,259 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [637751885] [2021-08-26 01:42:57,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:57,259 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:57,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:57,261 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:57,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-08-26 01:42:57,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:57,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:42:57,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:57,418 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:57,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:57,464 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:57,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [637751885] [2021-08-26 01:42:57,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [637751885] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:57,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:57,465 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:57,465 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4457434] [2021-08-26 01:42:57,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:57,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:57,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:57,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:57,466 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:57,527 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2021-08-26 01:42:57,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 01:42:57,528 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-26 01:42:57,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:57,529 INFO L225 Difference]: With dead ends: 48 [2021-08-26 01:42:57,529 INFO L226 Difference]: Without dead ends: 44 [2021-08-26 01:42:57,529 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-26 01:42:57,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2021-08-26 01:42:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2021-08-26 01:42:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.3333333333333333) internal successors, (36), 27 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2021-08-26 01:42:57,536 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2021-08-26 01:42:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:57,537 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2021-08-26 01:42:57,537 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2021-08-26 01:42:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:42:57,538 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:57,538 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:57,561 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:57,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:57,748 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:57,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2021-08-26 01:42:57,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:57,749 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450531886] [2021-08-26 01:42:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:57,749 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:57,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:57,750 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:57,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-08-26 01:42:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:57,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-26 01:42:57,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:58,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:58,505 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:58,506 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450531886] [2021-08-26 01:42:58,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450531886] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:58,509 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:58,509 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2021-08-26 01:42:58,509 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498187973] [2021-08-26 01:42:58,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 01:42:58,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 01:42:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-26 01:42:58,510 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:58,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:42:58,564 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-08-26 01:42:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:42:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 01:42:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:42:58,568 INFO L225 Difference]: With dead ends: 33 [2021-08-26 01:42:58,568 INFO L226 Difference]: Without dead ends: 28 [2021-08-26 01:42:58,569 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 273.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-26 01:42:58,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-08-26 01:42:58,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-08-26 01:42:58,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2021-08-26 01:42:58,572 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2021-08-26 01:42:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:42:58,572 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2021-08-26 01:42:58,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:42:58,572 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2021-08-26 01:42:58,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 01:42:58,572 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:42:58,572 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:42:58,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-08-26 01:42:58,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:42:58,783 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:42:58,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:42:58,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2021-08-26 01:42:58,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:42:58,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [212970891] [2021-08-26 01:42:58,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:42:58,784 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:42:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:42:58,788 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:42:58,789 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-08-26 01:42:58,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:42:58,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2021-08-26 01:42:58,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:42:59,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:59,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:42:59,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:42:59,497 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:42:59,497 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [212970891] [2021-08-26 01:42:59,497 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [212970891] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:42:59,497 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:42:59,497 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:42:59,497 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645769926] [2021-08-26 01:42:59,498 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:42:59,498 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:42:59,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:42:59,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:42:59,498 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:01,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:01,366 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2021-08-26 01:43:01,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 01:43:01,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 01:43:01,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:01,368 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:43:01,368 INFO L226 Difference]: Without dead ends: 32 [2021-08-26 01:43:01,368 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 413.0ms TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2021-08-26 01:43:01,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-08-26 01:43:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2021-08-26 01:43:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:01,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-08-26 01:43:01,373 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2021-08-26 01:43:01,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:01,373 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-08-26 01:43:01,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 10 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-08-26 01:43:01,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-26 01:43:01,373 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:01,373 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:01,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:01,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:01,574 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:01,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:01,575 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2021-08-26 01:43:01,575 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:01,575 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836106656] [2021-08-26 01:43:01,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:01,575 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:01,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:01,576 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:01,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-08-26 01:43:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:01,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2021-08-26 01:43:01,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:03,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:03,270 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:03,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:03,513 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:03,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836106656] [2021-08-26 01:43:03,513 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836106656] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:03,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:03,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2021-08-26 01:43:03,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109309896] [2021-08-26 01:43:03,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-08-26 01:43:03,514 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:03,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-08-26 01:43:03,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-08-26 01:43:03,514 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:04,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:04,260 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2021-08-26 01:43:04,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-26 01:43:04,260 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-08-26 01:43:04,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:04,261 INFO L225 Difference]: With dead ends: 70 [2021-08-26 01:43:04,261 INFO L226 Difference]: Without dead ends: 64 [2021-08-26 01:43:04,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 853.0ms TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2021-08-26 01:43:04,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-08-26 01:43:04,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2021-08-26 01:43:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2021-08-26 01:43:04,267 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2021-08-26 01:43:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:04,267 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2021-08-26 01:43:04,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:04,267 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2021-08-26 01:43:04,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:43:04,268 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:04,268 INFO L512 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] [2021-08-26 01:43:04,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:04,468 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:04,468 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:04,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:04,469 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2021-08-26 01:43:04,469 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:04,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074214632] [2021-08-26 01:43:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:04,469 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:04,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:04,470 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:04,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-08-26 01:43:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:04,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-26 01:43:04,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:04,807 INFO L388 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 32 treesize of output 30 [2021-08-26 01:43:04,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:04,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:05,079 INFO L388 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 58 treesize of output 54 [2021-08-26 01:43:05,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:05,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:05,401 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074214632] [2021-08-26 01:43:05,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074214632] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:05,403 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:05,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2021-08-26 01:43:05,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363644883] [2021-08-26 01:43:05,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-26 01:43:05,405 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:05,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-26 01:43:05,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2021-08-26 01:43:05,405 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:05,743 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2021-08-26 01:43:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 01:43:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 01:43:05,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:05,744 INFO L225 Difference]: With dead ends: 44 [2021-08-26 01:43:05,744 INFO L226 Difference]: Without dead ends: 36 [2021-08-26 01:43:05,745 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 350.6ms TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2021-08-26 01:43:05,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-08-26 01:43:05,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-08-26 01:43:05,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:05,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2021-08-26 01:43:05,748 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2021-08-26 01:43:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:05,748 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2021-08-26 01:43:05,749 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:05,749 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2021-08-26 01:43:05,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-26 01:43:05,749 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:05,749 INFO L512 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] [2021-08-26 01:43:05,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:05,957 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:05,957 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:05,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:05,957 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2021-08-26 01:43:05,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:05,958 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714610375] [2021-08-26 01:43:05,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:05,958 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:05,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:05,959 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:05,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-08-26 01:43:06,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:06,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-26 01:43:06,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:06,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:06,218 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:06,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:06,266 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:06,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714610375] [2021-08-26 01:43:06,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714610375] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:06,266 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:06,266 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2021-08-26 01:43:06,267 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6556034] [2021-08-26 01:43:06,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 01:43:06,267 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:06,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 01:43:06,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 01:43:06,269 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:06,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:06,308 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2021-08-26 01:43:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 01:43:06,309 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-08-26 01:43:06,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:06,311 INFO L225 Difference]: With dead ends: 40 [2021-08-26 01:43:06,311 INFO L226 Difference]: Without dead ends: 24 [2021-08-26 01:43:06,312 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 01:43:06,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-08-26 01:43:06,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-08-26 01:43:06,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0) internal successors, (23), 23 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:06,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2021-08-26 01:43:06,324 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2021-08-26 01:43:06,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:06,325 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2021-08-26 01:43:06,325 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:06,326 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2021-08-26 01:43:06,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 01:43:06,327 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 01:43:06,327 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 01:43:06,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:06,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:06,538 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-08-26 01:43:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 01:43:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2021-08-26 01:43:06,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-08-26 01:43:06,539 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1586010046] [2021-08-26 01:43:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 01:43:06,539 INFO L170 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-08-26 01:43:06,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-08-26 01:43:06,540 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-08-26 01:43:06,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-08-26 01:43:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 01:43:06,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2021-08-26 01:43:06,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-26 01:43:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:07,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-08-26 01:43:08,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 01:43:08,059 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-08-26 01:43:08,059 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1586010046] [2021-08-26 01:43:08,059 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1586010046] provided 2 perfect and 0 imperfect interpolant sequences [2021-08-26 01:43:08,059 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2021-08-26 01:43:08,059 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2021-08-26 01:43:08,059 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924939807] [2021-08-26 01:43:08,059 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2021-08-26 01:43:08,059 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-08-26 01:43:08,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-08-26 01:43:08,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-08-26 01:43:08,060 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 01:43:08,595 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2021-08-26 01:43:08,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-26 01:43:08,595 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 01:43:08,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 01:43:08,595 INFO L225 Difference]: With dead ends: 24 [2021-08-26 01:43:08,595 INFO L226 Difference]: Without dead ends: 0 [2021-08-26 01:43:08,595 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 784.3ms TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2021-08-26 01:43:08,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-26 01:43:08,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-26 01:43:08,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-26 01:43:08,596 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2021-08-26 01:43:08,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 01:43:08,596 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-26 01:43:08,596 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.75) internal successors, (44), 16 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 01:43:08,596 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-26 01:43:08,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-26 01:43:08,599 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 01:43:08,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-08-26 01:43:08,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-08-26 01:43:08,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-26 01:43:08,805 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:08,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:08,926 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:08,927 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:08,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:09,001 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:43:09,002 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-26 01:44:03,129 WARN L207 SmtUtils]: Spent 53.03 s on a formula simplification. DAG size of input: 148 DAG size of output: 70 [2021-08-26 01:44:04,050 INFO L857 garLoopResultBuilder]: For program point L64(lines 64 73) no Hoare annotation was computed. [2021-08-26 01:44:04,050 INFO L857 garLoopResultBuilder]: For program point L64-2(lines 64 73) no Hoare annotation was computed. [2021-08-26 01:44:04,050 INFO L857 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2021-08-26 01:44:04,050 INFO L857 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2021-08-26 01:44:04,050 INFO L853 garLoopResultBuilder]: 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___fpclassify_double_~x)) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (fp.eq |ULTIMATE.start_fmin_double_#res| ULTIMATE.start_main_~x~0) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,050 INFO L857 garLoopResultBuilder]: For program point L69(lines 69 72) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L32(lines 32 43) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L32-1(lines 32 43) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 70) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L49(lines 49 50) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L70(line 70) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L860 garLoopResultBuilder]: At program point L75(lines 55 76) the Hoare annotation is: true [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L22-1(lines 22 27) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L853 garLoopResultBuilder]: At program point L22-2(lines 22 27) the Hoare annotation is: (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_double_~x) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_fmin_double_~x ULTIMATE.start___fpclassify_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L22-3(lines 19 44) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L853 garLoopResultBuilder]: At program point L18(line 18) the Hoare annotation is: (and (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|)))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L22-5(lines 22 27) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L853 garLoopResultBuilder]: 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___fpclassify_double_~x)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L47(lines 47 48) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L857 garLoopResultBuilder]: For program point L22-7(lines 19 44) no Hoare annotation was computed. [2021-08-26 01:44:04,051 INFO L853 garLoopResultBuilder]: At program point L43(lines 19 44) the Hoare annotation is: (and (= 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_fmin_double_~y)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (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_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|)))) (let ((.cse0 (let ((.cse3 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse3 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))))) (.cse1 (not (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32))))) (or (and .cse0 .cse1 (or (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32))) (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32)))) (and (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|)) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) ULTIMATE.start___fpclassify_double_~lsw~0) (let ((.cse2 (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 .cse2 .cse2)))) .cse0 .cse1))) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,052 INFO L853 garLoopResultBuilder]: 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___fpclassify_double_~x)) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmin_double_~y)) (= |ULTIMATE.start___fpclassify_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (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|)) (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|) ULTIMATE.start___fpclassify_double_~msw~0) (= ULTIMATE.start___fpclassify_double_~lsw~0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (fp.eq ULTIMATE.start_fmin_double_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= ULTIMATE.start_main_~y~0 (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53))))) [2021-08-26 01:44:04,052 INFO L857 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2021-08-26 01:44:04,052 INFO L857 garLoopResultBuilder]: For program point L39-1(lines 39 43) no Hoare annotation was computed. [2021-08-26 01:44:04,052 INFO L857 garLoopResultBuilder]: For program point L35(lines 35 43) no Hoare annotation was computed. [2021-08-26 01:44:04,052 INFO L857 garLoopResultBuilder]: For program point L35-1(lines 35 43) no Hoare annotation was computed. [2021-08-26 01:44:04,054 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 01:44:04,058 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,062 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,063 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,064 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,065 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,066 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,066 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,066 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,066 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,066 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,067 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,068 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,069 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,070 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,071 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,072 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,073 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,074 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,075 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 01:44:04 BoogieIcfgContainer [2021-08-26 01:44:04,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 01:44:04,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 01:44:04,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 01:44:04,076 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 01:44:04,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 01:42:12" (3/4) ... [2021-08-26 01:44:04,078 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-26 01:44:04,084 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2021-08-26 01:44:04,084 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2021-08-26 01:44:04,085 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-26 01:44:04,085 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-26 01:44:04,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,097 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && ~fp.eq~DOUBLE(x, x)) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((x == x && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x && msw == v_skolemized_q#valueAsBitvector_7[63:32])) && (((((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && !(\result == 0bv32)) && (((~bvuge32(msw, 2147483648bv32) && ~bvule32(msw, 2148532223bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || ~bvule32(msw, 2146435071bv32))) || (((~fp.eq~DOUBLE(x, x) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: (msw == v_skolemized_q#valueAsBitvector_5[63:32] && v_skolemized_q#valueAsBitvector_5[31:0] == lsw) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0])))) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result))) && !(\result == 0bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(\result, x)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,098 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_8[63:32] == msw) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) [2021-08-26 01:44:04,106 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 01:44:04,107 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 01:44:04,107 INFO L168 Benchmark]: Toolchain (without parser) took 112193.25 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 49.4 MB in the beginning and 36.2 MB in the end (delta: 13.2 MB). Peak memory consumption was 38.0 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,107 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 46.1 MB. Free memory was 27.4 MB in the beginning and 27.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:44:04,108 INFO L168 Benchmark]: CACSL2BoogieTranslator took 222.49 ms. Allocated memory is still 65.0 MB. Free memory was 49.2 MB in the beginning and 47.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,108 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 65.0 MB. Free memory was 47.0 MB in the beginning and 45.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 01:44:04,108 INFO L168 Benchmark]: Boogie Preprocessor took 37.51 ms. Allocated memory is still 65.0 MB. Free memory was 45.4 MB in the beginning and 43.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,108 INFO L168 Benchmark]: RCFGBuilder took 406.74 ms. Allocated memory is still 65.0 MB. Free memory was 43.6 MB in the beginning and 39.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,109 INFO L168 Benchmark]: TraceAbstraction took 111452.71 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 39.0 MB in the beginning and 40.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,109 INFO L168 Benchmark]: Witness Printer took 30.79 ms. Allocated memory is still 90.2 MB. Free memory was 40.4 MB in the beginning and 36.2 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 01:44:04,110 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.14 ms. Allocated memory is still 46.1 MB. Free memory was 27.4 MB in the beginning and 27.3 MB in the end (delta: 40.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 222.49 ms. Allocated memory is still 65.0 MB. Free memory was 49.2 MB in the beginning and 47.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.62 ms. Allocated memory is still 65.0 MB. Free memory was 47.0 MB in the beginning and 45.4 MB in the end (delta: 1.6 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 37.51 ms. Allocated memory is still 65.0 MB. Free memory was 45.4 MB in the beginning and 43.8 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 406.74 ms. Allocated memory is still 65.0 MB. Free memory was 43.6 MB in the beginning and 39.6 MB in the end (delta: 4.0 MB). Peak memory consumption was 16.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 111452.71 ms. Allocated memory was 65.0 MB in the beginning and 90.2 MB in the end (delta: 25.2 MB). Free memory was 39.0 MB in the beginning and 40.4 MB in the end (delta: -1.5 MB). Peak memory consumption was 42.3 MB. Max. memory is 16.1 GB. * Witness Printer took 30.79 ms. Allocated memory is still 90.2 MB. Free memory was 40.4 MB in the beginning and 36.2 MB in the end (delta: 4.2 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[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[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[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[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[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[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[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,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[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,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[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[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[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[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] - 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: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 70]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 111371.8ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 10.0ms, AutomataDifference: 40985.3ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 55249.4ms, InitialAbstractionConstructionTime: 17.9ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 268 SDtfs, 626 SDslu, 543 SDs, 0 SdLazy, 370 SolverSat, 52 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 24812.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 22460.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 55.6ms AutomataMinimizationTime, 10 MinimizatonAttempts, 102 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 307 HoareAnnotationTreeSize, 7 FomulaSimplifications, 3968 FormulaSimplificationTreeSizeReduction, 201.9ms HoareSimplificationTime, 7 FomulaSimplificationsInter, 8218 FormulaSimplificationTreeSizeReductionInter, 55040.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 110.9ms SsaConstructionTime, 448.3ms SatisfiabilityAnalysisTime, 11459.6ms InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 105 QuantifiedInterpolants, 2756 SizeOfPredicates, 70 NumberOfNonLiveVariables, 681 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2021-08-26 01:44:04,120 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 19]: Loop Invariant [2021-08-26 01:44:04,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,121 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,122 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2021-08-26 01:44:04,123 WARN L418 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()) == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_8[63:32] == msw) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 19]: Loop Invariant [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,124 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,125 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,126 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_5,QUANTIFIED] [2021-08-26 01:44:04,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((x == x && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x && msw == v_skolemized_q#valueAsBitvector_7[63:32])) && (((((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) && !(\result == 0bv32)) && (((~bvuge32(msw, 2147483648bv32) && ~bvule32(msw, 2148532223bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || ~bvule32(msw, 2146435071bv32))) || (((~fp.eq~DOUBLE(x, x) && (\exists v_skolemized_q#valueAsBitvector_5 : bv64 :: (msw == v_skolemized_q#valueAsBitvector_5[63:32] && v_skolemized_q#valueAsBitvector_5[31:0] == lsw) && ~fp.eq~DOUBLE(~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0]), ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_5[63:63], v_skolemized_q#valueAsBitvector_5[62:52], v_skolemized_q#valueAsBitvector_5[51:0])))) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result))) && !(\result == 0bv32)))) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 46]: Loop Invariant [2021-08-26 01:44:04,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,127 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,128 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,129 WARN L418 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()) == x) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_6[63:32] == msw)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && ~fp.eq~DOUBLE(\result, x)) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 22]: Loop Invariant [2021-08-26 01:44:04,129 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((x == x && ~fp.eq~DOUBLE(x, x)) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 22]: Loop Invariant [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,130 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,131 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2021-08-26 01:44:04,131 WARN L418 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()) == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: y == ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE())) RESULT: Ultimate proved your program to be correct! [2021-08-26 01:44:04,357 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2021-08-26 01:44:04,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...