./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3e5ce664 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.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 0dca3295f12b1ef36cf31c463cf879069525072f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.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 0dca3295f12b1ef36cf31c463cf879069525072f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-3e5ce66 [2020-12-02 21:37:27,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 21:37:27,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 21:37:28,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 21:37:28,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 21:37:28,028 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 21:37:28,030 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 21:37:28,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 21:37:28,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 21:37:28,037 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 21:37:28,038 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 21:37:28,040 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 21:37:28,040 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 21:37:28,041 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 21:37:28,043 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 21:37:28,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 21:37:28,045 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 21:37:28,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 21:37:28,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 21:37:28,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 21:37:28,054 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 21:37:28,056 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 21:37:28,057 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 21:37:28,058 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 21:37:28,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 21:37:28,063 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 21:37:28,063 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 21:37:28,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 21:37:28,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 21:37:28,067 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 21:37:28,067 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 21:37:28,068 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 21:37:28,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 21:37:28,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 21:37:28,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 21:37:28,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 21:37:28,075 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 21:37:28,075 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 21:37:28,076 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 21:37:28,077 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 21:37:28,079 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 21:37:28,081 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-02 21:37:28,118 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 21:37:28,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 21:37:28,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 21:37:28,122 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 21:37:28,123 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 21:37:28,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 21:37:28,123 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 21:37:28,123 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-02 21:37:28,123 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 21:37:28,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 21:37:28,124 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 21:37:28,124 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 21:37:28,124 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 21:37:28,124 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 21:37:28,125 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 21:37:28,125 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 21:37:28,126 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 21:37:28,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 21:37:28,127 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 21:37:28,127 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 21:37:28,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:37:28,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 21:37:28,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 21:37:28,128 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 21:37:28,128 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-02 21:37:28,128 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-02 21:37:28,128 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 21:37:28,128 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 21:37:28,129 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2020-12-02 21:37:28,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 21:37:28,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 21:37:28,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 21:37:28,621 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 21:37:28,621 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 21:37:28,623 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-12-02 21:37:28,706 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f35cdd/ba9051470baa42698e866937989b96fa/FLAG55d23c3ad [2020-12-02 21:37:29,355 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 21:37:29,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-12-02 21:37:29,371 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f35cdd/ba9051470baa42698e866937989b96fa/FLAG55d23c3ad [2020-12-02 21:37:29,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/934f35cdd/ba9051470baa42698e866937989b96fa [2020-12-02 21:37:29,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 21:37:29,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 21:37:29,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 21:37:29,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 21:37:29,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 21:37:29,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:37:29" (1/1) ... [2020-12-02 21:37:29,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253e7c45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:29, skipping insertion in model container [2020-12-02 21:37:29,739 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:37:29" (1/1) ... [2020-12-02 21:37:29,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 21:37:29,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 21:37:30,071 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-02 21:37:30,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:37:30,086 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 21:37:30,120 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-02 21:37:30,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:37:30,140 INFO L208 MainTranslator]: Completed translation [2020-12-02 21:37:30,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30 WrapperNode [2020-12-02 21:37:30,141 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 21:37:30,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 21:37:30,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 21:37:30,143 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 21:37:30,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,164 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,191 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 21:37:30,192 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 21:37:30,192 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 21:37:30,193 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 21:37:30,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,204 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,207 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,207 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,217 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,223 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... [2020-12-02 21:37:30,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 21:37:30,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 21:37:30,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 21:37:30,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 21:37:30,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:37:30,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-02 21:37:30,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 21:37:30,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-12-02 21:37:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 21:37:30,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 21:37:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-12-02 21:37:30,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 21:37:30,874 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 21:37:30,876 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-02 21:37:30,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:30 BoogieIcfgContainer [2020-12-02 21:37:30,881 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 21:37:30,885 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 21:37:30,885 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 21:37:30,890 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 21:37:30,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:37:29" (1/3) ... [2020-12-02 21:37:30,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:37:30, skipping insertion in model container [2020-12-02 21:37:30,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:30" (2/3) ... [2020-12-02 21:37:30,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ecc91a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:37:30, skipping insertion in model container [2020-12-02 21:37:30,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:30" (3/3) ... [2020-12-02 21:37:30,896 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-12-02 21:37:30,923 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 21:37:30,930 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 21:37:30,948 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 21:37:31,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 21:37:31,002 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 21:37:31,003 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 21:37:31,003 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 21:37:31,003 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 21:37:31,003 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 21:37:31,004 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 21:37:31,004 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 21:37:31,023 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-02 21:37:31,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 21:37:31,031 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:31,032 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:31,033 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:31,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:31,043 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-02 21:37:31,055 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:31,056 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561759418] [2020-12-02 21:37:31,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:31,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:31,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561759418] [2020-12-02 21:37:31,325 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:31,325 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-02 21:37:31,327 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261367600] [2020-12-02 21:37:31,335 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 21:37:31,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:37:31,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 21:37:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:37:31,359 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-02 21:37:31,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:31,387 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-02 21:37:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 21:37:31,390 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-02 21:37:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:31,414 INFO L225 Difference]: With dead ends: 56 [2020-12-02 21:37:31,415 INFO L226 Difference]: Without dead ends: 26 [2020-12-02 21:37:31,420 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:37:31,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-02 21:37:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-02 21:37:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-02 21:37:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-02 21:37:31,479 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-02 21:37:31,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:31,480 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-02 21:37:31,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 21:37:31,480 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-02 21:37:31,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 21:37:31,481 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:31,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:31,482 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-02 21:37:31,482 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-02 21:37:31,485 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:31,486 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861322288] [2020-12-02 21:37:31,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:31,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:31,656 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861322288] [2020-12-02 21:37:31,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:31,656 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 21:37:31,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830809055] [2020-12-02 21:37:31,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 21:37:31,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:37:31,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 21:37:31,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 21:37:31,660 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 4 states. [2020-12-02 21:37:31,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:31,745 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2020-12-02 21:37:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:37:31,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-12-02 21:37:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:31,749 INFO L225 Difference]: With dead ends: 40 [2020-12-02 21:37:31,750 INFO L226 Difference]: Without dead ends: 36 [2020-12-02 21:37:31,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 21:37:31,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-02 21:37:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-12-02 21:37:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:37:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-02 21:37:31,770 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-02 21:37:31,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:31,772 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-02 21:37:31,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 21:37:31,772 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-02 21:37:31,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-02 21:37:31,774 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:31,774 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:31,775 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-02 21:37:31,775 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:31,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:31,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1913129681, now seen corresponding path program 1 times [2020-12-02 21:37:31,777 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:31,778 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166198686] [2020-12-02 21:37:31,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:31,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:31,873 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166198686] [2020-12-02 21:37:31,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:31,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 21:37:31,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62317476] [2020-12-02 21:37:31,874 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 21:37:31,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:37:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 21:37:31,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 21:37:31,876 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-02 21:37:31,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:31,927 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-02 21:37:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:37:31,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-12-02 21:37:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:31,934 INFO L225 Difference]: With dead ends: 42 [2020-12-02 21:37:31,935 INFO L226 Difference]: Without dead ends: 38 [2020-12-02 21:37:31,935 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 21:37:31,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-02 21:37:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-02 21:37:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:37:31,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-02 21:37:31,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 13 [2020-12-02 21:37:31,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:31,942 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-02 21:37:31,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 21:37:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-02 21:37:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-02 21:37:31,943 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:31,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:31,944 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-02 21:37:31,944 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:31,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1959363189, now seen corresponding path program 1 times [2020-12-02 21:37:31,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:31,946 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780481120] [2020-12-02 21:37:31,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:31,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780481120] [2020-12-02 21:37:31,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:31,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 21:37:31,997 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351755494] [2020-12-02 21:37:31,998 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 21:37:31,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:37:31,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 21:37:31,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 21:37:31,999 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-02 21:37:32,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:32,047 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-12-02 21:37:32,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:37:32,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-02 21:37:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:32,050 INFO L225 Difference]: With dead ends: 44 [2020-12-02 21:37:32,050 INFO L226 Difference]: Without dead ends: 40 [2020-12-02 21:37:32,051 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 21:37:32,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-12-02 21:37:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 28. [2020-12-02 21:37:32,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:37:32,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-02 21:37:32,061 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 14 [2020-12-02 21:37:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:32,061 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-02 21:37:32,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 21:37:32,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-02 21:37:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 21:37:32,063 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:32,063 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:32,063 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-02 21:37:32,063 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:32,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:32,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1045511114, now seen corresponding path program 1 times [2020-12-02 21:37:32,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:32,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998964438] [2020-12-02 21:37:32,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:32,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:32,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:32,113 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998964438] [2020-12-02 21:37:32,113 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:32,114 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-02 21:37:32,114 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840722681] [2020-12-02 21:37:32,114 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 21:37:32,115 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-02 21:37:32,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 21:37:32,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 21:37:32,116 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 4 states. [2020-12-02 21:37:32,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:32,196 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2020-12-02 21:37:32,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:37:32,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-12-02 21:37:32,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:32,198 INFO L225 Difference]: With dead ends: 42 [2020-12-02 21:37:32,198 INFO L226 Difference]: Without dead ends: 38 [2020-12-02 21:37:32,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 21:37:32,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-12-02 21:37:32,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2020-12-02 21:37:32,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:37:32,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-02 21:37:32,208 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 15 [2020-12-02 21:37:32,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:32,209 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-02 21:37:32,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 21:37:32,209 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-02 21:37:32,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 21:37:32,210 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:32,210 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:32,211 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-02 21:37:32,211 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:32,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:32,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-02 21:37:32,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-02 21:37:32,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961549599] [2020-12-02 21:37:32,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-02 21:37:32,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 21:37:32,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 21:37:32,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-02 21:37:32,268 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-02 21:37:32,310 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-02 21:37:32,310 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-02 21:37:32,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-02 21:37:32,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:37:32 BoogieIcfgContainer [2020-12-02 21:37:32,360 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 21:37:32,361 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 21:37:32,361 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 21:37:32,361 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 21:37:32,362 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:30" (3/4) ... [2020-12-02 21:37:32,366 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-12-02 21:37:32,366 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 21:37:32,369 INFO L168 Benchmark]: Toolchain (without parser) took 2647.76 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 27.1 MB in the beginning and 34.4 MB in the end (delta: -7.3 MB). Peak memory consumption was 4.4 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,370 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 50.3 MB. Free memory was 34.5 MB in the beginning and 34.4 MB in the end (delta: 32.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:37:32,370 INFO L168 Benchmark]: CACSL2BoogieTranslator took 418.34 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 29.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,371 INFO L168 Benchmark]: Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 50.3 MB. Free memory was 29.7 MB in the beginning and 28.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,372 INFO L168 Benchmark]: Boogie Preprocessor took 36.21 ms. Allocated memory is still 50.3 MB. Free memory was 28.0 MB in the beginning and 26.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,373 INFO L168 Benchmark]: RCFGBuilder took 651.42 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.5 MB in the beginning and 43.1 MB in the end (delta: -16.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,374 INFO L168 Benchmark]: TraceAbstraction took 1475.24 ms. Allocated memory is still 60.8 MB. Free memory was 42.8 MB in the beginning and 34.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2020-12-02 21:37:32,375 INFO L168 Benchmark]: Witness Printer took 5.25 ms. Allocated memory is still 60.8 MB. Free memory was 34.7 MB in the beginning and 34.4 MB in the end (delta: 348.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:37:32,380 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.55 ms. Allocated memory is still 50.3 MB. Free memory was 34.5 MB in the beginning and 34.4 MB in the end (delta: 32.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 418.34 ms. Allocated memory is still 50.3 MB. Free memory was 26.9 MB in the beginning and 29.7 MB in the end (delta: -2.9 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 49.02 ms. Allocated memory is still 50.3 MB. Free memory was 29.7 MB in the beginning and 28.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 36.21 ms. Allocated memory is still 50.3 MB. Free memory was 28.0 MB in the beginning and 26.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 651.42 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 26.5 MB in the beginning and 43.1 MB in the end (delta: -16.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1475.24 ms. Allocated memory is still 60.8 MB. Free memory was 42.8 MB in the beginning and 34.7 MB in the end (delta: 8.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * Witness Printer took 5.25 ms. Allocated memory is still 60.8 MB. Free memory was 34.7 MB in the beginning and 34.4 MB in the end (delta: 348.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: 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 79, overapproximation of someBinaryArithmeticDOUBLEoperation at line 67. Possible FailurePath: [L66] double x = __VERIFIER_nondet_double(); [L67] double y = 0.0 / 0.0; [L18] return x != x; [L74] COND TRUE !isnan_double(x) [L29] __uint32_t msw, lsw; [L32] ieee_double_shape_type ew_u; [L33] ew_u.value = (x) [L34] EXPR ew_u.parts.msw [L34] (msw) = ew_u.parts.msw [L35] EXPR ew_u.parts.lsw [L35] (lsw) = ew_u.parts.lsw [L38-L39] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L41-L42] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L44-L45] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L48-L49] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L52] return 0; [L57] COND TRUE __fpclassify_double(x) == 0 [L58] return y; [L76] double res = fmax_double(x, y); [L79] COND TRUE res != x [L80] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 209 SDtfs, 40 SDslu, 242 SDs, 0 SdLazy, 84 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 40 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 60 ConstructedInterpolants, 0 QuantifiedInterpolants, 930 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.2.0-3e5ce66 [2020-12-02 21:37:35,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-02 21:37:35,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-02 21:37:35,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-02 21:37:35,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-02 21:37:35,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-02 21:37:35,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-02 21:37:35,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-02 21:37:35,107 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-02 21:37:35,109 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-02 21:37:35,111 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-02 21:37:35,113 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-02 21:37:35,114 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-02 21:37:35,115 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-02 21:37:35,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-02 21:37:35,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-02 21:37:35,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-02 21:37:35,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-02 21:37:35,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-02 21:37:35,129 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-02 21:37:35,132 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-02 21:37:35,138 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-02 21:37:35,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-02 21:37:35,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-02 21:37:35,153 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-02 21:37:35,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-02 21:37:35,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-02 21:37:35,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-02 21:37:35,160 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-02 21:37:35,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-02 21:37:35,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-02 21:37:35,164 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-02 21:37:35,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-02 21:37:35,171 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-02 21:37:35,174 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-02 21:37:35,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-02 21:37:35,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-02 21:37:35,177 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-02 21:37:35,177 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-02 21:37:35,181 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-02 21:37:35,182 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-02 21:37:35,184 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-12-02 21:37:35,251 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-02 21:37:35,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-02 21:37:35,256 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-02 21:37:35,257 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-02 21:37:35,257 INFO L138 SettingsManager]: * Use SBE=true [2020-12-02 21:37:35,257 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-02 21:37:35,258 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-02 21:37:35,258 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-02 21:37:35,258 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-02 21:37:35,258 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-02 21:37:35,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-02 21:37:35,261 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-02 21:37:35,261 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-12-02 21:37:35,261 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-12-02 21:37:35,262 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-02 21:37:35,262 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-02 21:37:35,262 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-02 21:37:35,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-02 21:37:35,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-02 21:37:35,263 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-02 21:37:35,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-02 21:37:35,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:37:35,264 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-02 21:37:35,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-02 21:37:35,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-02 21:37:35,265 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-12-02 21:37:35,266 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2020-12-02 21:37:35,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-02 21:37:35,266 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-02 21:37:35,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-02 21:37:35,267 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 -> 0dca3295f12b1ef36cf31c463cf879069525072f [2020-12-02 21:37:35,713 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-02 21:37:35,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-02 21:37:35,771 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-02 21:37:35,773 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-02 21:37:35,774 INFO L275 PluginConnector]: CDTParser initialized [2020-12-02 21:37:35,775 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-12-02 21:37:35,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200aa611c/e38c75257ac1457ca06284c985230747/FLAG3c5b11cd3 [2020-12-02 21:37:36,582 INFO L306 CDTParser]: Found 1 translation units. [2020-12-02 21:37:36,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c [2020-12-02 21:37:36,592 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200aa611c/e38c75257ac1457ca06284c985230747/FLAG3c5b11cd3 [2020-12-02 21:37:36,947 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/200aa611c/e38c75257ac1457ca06284c985230747 [2020-12-02 21:37:36,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-02 21:37:36,952 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-02 21:37:36,954 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-02 21:37:36,954 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-02 21:37:36,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-02 21:37:36,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:37:36" (1/1) ... [2020-12-02 21:37:36,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72c17587 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:36, skipping insertion in model container [2020-12-02 21:37:36,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 09:37:36" (1/1) ... [2020-12-02 21:37:36,976 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-02 21:37:37,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-02 21:37:37,217 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-02 21:37:37,222 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:37:37,242 INFO L203 MainTranslator]: Completed pre-run [2020-12-02 21:37:37,272 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1251b.c[2080,2093] [2020-12-02 21:37:37,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-02 21:37:37,302 INFO L208 MainTranslator]: Completed translation [2020-12-02 21:37:37,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37 WrapperNode [2020-12-02 21:37:37,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-02 21:37:37,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-02 21:37:37,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-02 21:37:37,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-02 21:37:37,314 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,355 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-02 21:37:37,357 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-02 21:37:37,357 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-02 21:37:37,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-02 21:37:37,368 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,373 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,374 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... [2020-12-02 21:37:37,403 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-02 21:37:37,404 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-02 21:37:37,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-02 21:37:37,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-02 21:37:37,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-02 21:37:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-12-02 21:37:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-12-02 21:37:37,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-02 21:37:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-12-02 21:37:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-02 21:37:37,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-02 21:37:37,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-02 21:37:38,040 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-02 21:37:38,040 INFO L298 CfgBuilder]: Removed 16 assume(true) statements. [2020-12-02 21:37:38,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:38 BoogieIcfgContainer [2020-12-02 21:37:38,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-02 21:37:38,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-02 21:37:38,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-02 21:37:38,053 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-02 21:37:38,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 09:37:36" (1/3) ... [2020-12-02 21:37:38,058 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8da61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:37:38, skipping insertion in model container [2020-12-02 21:37:38,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 09:37:37" (2/3) ... [2020-12-02 21:37:38,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8da61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 09:37:38, skipping insertion in model container [2020-12-02 21:37:38,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:38" (3/3) ... [2020-12-02 21:37:38,064 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1251b.c [2020-12-02 21:37:38,105 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-02 21:37:38,113 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-02 21:37:38,150 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-02 21:37:38,206 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-02 21:37:38,207 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-02 21:37:38,207 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-02 21:37:38,207 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-02 21:37:38,208 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-02 21:37:38,208 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-02 21:37:38,208 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-02 21:37:38,208 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-02 21:37:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2020-12-02 21:37:38,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-02 21:37:38,238 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:38,239 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:38,240 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:38,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:38,250 INFO L82 PathProgramCache]: Analyzing trace with hash -124750094, now seen corresponding path program 1 times [2020-12-02 21:37:38,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:37:38,267 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2070239118] [2020-12-02 21:37:38,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-12-02 21:37:38,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:38,447 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2020-12-02 21:37:38,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:37:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:38,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:37:38,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:38,505 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2070239118] [2020-12-02 21:37:38,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:38,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-12-02 21:37:38,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263695188] [2020-12-02 21:37:38,513 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-12-02 21:37:38,514 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:37:38,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-12-02 21:37:38,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:37:38,534 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2020-12-02 21:37:38,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:38,570 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2020-12-02 21:37:38,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-12-02 21:37:38,571 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 11 [2020-12-02 21:37:38,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:38,584 INFO L225 Difference]: With dead ends: 56 [2020-12-02 21:37:38,584 INFO L226 Difference]: Without dead ends: 26 [2020-12-02 21:37:38,588 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-12-02 21:37:38,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-12-02 21:37:38,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-12-02 21:37:38,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-02 21:37:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2020-12-02 21:37:38,632 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 11 [2020-12-02 21:37:38,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:38,633 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2020-12-02 21:37:38,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-12-02 21:37:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2020-12-02 21:37:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-02 21:37:38,634 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:38,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:38,855 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-12-02 21:37:38,856 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:38,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:38,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1352831344, now seen corresponding path program 1 times [2020-12-02 21:37:38,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:37:38,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [410850583] [2020-12-02 21:37:38,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-12-02 21:37:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:38,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 21:37:38,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:37:38,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:38,995 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:37:39,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:39,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [410850583] [2020-12-02 21:37:39,024 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:39,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 21:37:39,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448719776] [2020-12-02 21:37:39,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:37:39,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:37:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:37:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:37:39,028 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand 6 states. [2020-12-02 21:37:39,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:37:39,174 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2020-12-02 21:37:39,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 21:37:39,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2020-12-02 21:37:39,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:37:39,176 INFO L225 Difference]: With dead ends: 50 [2020-12-02 21:37:39,176 INFO L226 Difference]: Without dead ends: 46 [2020-12-02 21:37:39,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:37:39,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-12-02 21:37:39,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 28. [2020-12-02 21:37:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:37:39,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 38 transitions. [2020-12-02 21:37:39,185 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 38 transitions. Word has length 12 [2020-12-02 21:37:39,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:37:39,186 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 38 transitions. [2020-12-02 21:37:39,186 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:37:39,186 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 38 transitions. [2020-12-02 21:37:39,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-02 21:37:39,187 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:37:39,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:37:39,401 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-12-02 21:37:39,402 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:37:39,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:37:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1102769416, now seen corresponding path program 1 times [2020-12-02 21:37:39,405 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:37:39,405 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24756363] [2020-12-02 21:37:39,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-12-02 21:37:39,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:37:39,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 19 conjunts are in the unsatisfiable core [2020-12-02 21:37:39,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:37:39,658 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-02 21:37:39,672 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:39,675 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:39,676 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:37:39,686 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:39,688 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-12-02 21:37:39,689 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:24 [2020-12-02 21:37:41,699 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_5| (_ BitVec 64))) (and (let ((.cse0 (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_5|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_5|)))) (fp.eq .cse0 .cse0)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~msw~0) (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_5|) c_ULTIMATE.start___fpclassify_double_~lsw~0))) is different from true [2020-12-02 21:37:51,771 WARN L197 SmtUtils]: Spent 9.93 s on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2020-12-02 21:37:56,000 WARN L197 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 66 DAG size of output: 38 [2020-12-02 21:37:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:56,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:37:58,313 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,315 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,320 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,322 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,324 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,337 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,339 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,341 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,344 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,347 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,350 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,359 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,375 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,377 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,380 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,389 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,405 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,408 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,418 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,420 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,426 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,429 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,432 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,434 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,439 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,452 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,454 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,461 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,465 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,468 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,482 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,489 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:37:58,492 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 6 conjuncts [2020-12-02 21:37:58,528 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-02 21:37:58,537 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,540 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:58,541 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,554 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-02 21:37:58,555 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,562 WARN L234 Elim1Store]: Array PQE input equivalent to true [2020-12-02 21:37:58,563 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,571 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-02 21:37:58,580 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,583 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:37:58,583 INFO L547 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:37:58,771 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 29 [2020-12-02 21:37:58,772 INFO L625 ElimStorePlain]: treesize reduction 106, result has 45.6 percent of original size [2020-12-02 21:37:58,776 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2020-12-02 21:37:58,777 INFO L244 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:293, output treesize:89 [2020-12-02 21:37:58,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:37:58,907 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24756363] [2020-12-02 21:37:58,908 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:37:58,908 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 13 [2020-12-02 21:37:58,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849349138] [2020-12-02 21:37:58,909 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-12-02 21:37:58,909 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:37:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-12-02 21:37:58,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=98, Unknown=2, NotChecked=20, Total=156 [2020-12-02 21:37:58,910 INFO L87 Difference]: Start difference. First operand 28 states and 38 transitions. Second operand 13 states. [2020-12-02 21:38:03,262 WARN L197 SmtUtils]: Spent 4.14 s on a formula simplification. DAG size of input: 52 DAG size of output: 32 [2020-12-02 21:38:09,416 WARN L197 SmtUtils]: Spent 6.12 s on a formula simplification that was a NOOP. DAG size: 48 [2020-12-02 21:38:11,794 WARN L197 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 29 [2020-12-02 21:38:15,951 WARN L197 SmtUtils]: Spent 4.10 s on a formula simplification that was a NOOP. DAG size: 46 [2020-12-02 21:38:18,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:18,409 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2020-12-02 21:38:18,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 21:38:18,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2020-12-02 21:38:18,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:18,411 INFO L225 Difference]: With dead ends: 70 [2020-12-02 21:38:18,411 INFO L226 Difference]: Without dead ends: 54 [2020-12-02 21:38:18,413 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 35.7s TimeCoverageRelationStatistics Valid=140, Invalid=323, Unknown=3, NotChecked=40, Total=506 [2020-12-02 21:38:18,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-12-02 21:38:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 26. [2020-12-02 21:38:18,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-12-02 21:38:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2020-12-02 21:38:18,420 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2020-12-02 21:38:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:18,421 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2020-12-02 21:38:18,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-12-02 21:38:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2020-12-02 21:38:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-02 21:38:18,422 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:18,422 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:18,622 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-12-02 21:38:18,623 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:18,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1042649172, now seen corresponding path program 1 times [2020-12-02 21:38:18,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:18,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1539786491] [2020-12-02 21:38:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:18,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 21:38:18,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:18,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:18,759 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:18,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:18,828 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1539786491] [2020-12-02 21:38:18,829 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:18,829 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 21:38:18,829 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291911341] [2020-12-02 21:38:18,830 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:38:18,830 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:18,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:38:18,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:38:18,832 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 6 states. [2020-12-02 21:38:18,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:18,969 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2020-12-02 21:38:18,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-02 21:38:18,971 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-12-02 21:38:18,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:18,972 INFO L225 Difference]: With dead ends: 48 [2020-12-02 21:38:18,973 INFO L226 Difference]: Without dead ends: 44 [2020-12-02 21:38:18,973 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-12-02 21:38:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-12-02 21:38:18,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2020-12-02 21:38:18,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:38:18,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-12-02 21:38:18,982 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 17 [2020-12-02 21:38:18,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:18,983 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-12-02 21:38:18,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:38:18,983 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2020-12-02 21:38:18,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:38:18,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:18,985 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:19,198 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-12-02 21:38:19,199 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:19,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:19,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1310041806, now seen corresponding path program 1 times [2020-12-02 21:38:19,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:19,201 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74696115] [2020-12-02 21:38:19,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:19,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2020-12-02 21:38:19,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:19,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:19,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:19,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:19,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74696115] [2020-12-02 21:38:19,845 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:19,845 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-12-02 21:38:19,846 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964656641] [2020-12-02 21:38:19,846 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-02 21:38:19,846 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:19,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-02 21:38:19,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-12-02 21:38:19,848 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 6 states. [2020-12-02 21:38:19,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:19,928 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2020-12-02 21:38:19,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:38:19,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-12-02 21:38:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:19,930 INFO L225 Difference]: With dead ends: 33 [2020-12-02 21:38:19,931 INFO L226 Difference]: Without dead ends: 28 [2020-12-02 21:38:19,931 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-02 21:38:19,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-12-02 21:38:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-12-02 21:38:19,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:38:19,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-12-02 21:38:19,939 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 19 [2020-12-02 21:38:19,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:19,940 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-12-02 21:38:19,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-02 21:38:19,940 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-12-02 21:38:19,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-02 21:38:19,941 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:19,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:20,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-12-02 21:38:20,156 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:20,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:20,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1311888848, now seen corresponding path program 1 times [2020-12-02 21:38:20,158 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:20,158 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [258121994] [2020-12-02 21:38:20,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:20,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-02 21:38:20,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:20,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:20,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:20,515 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:20,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:20,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [258121994] [2020-12-02 21:38:20,855 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:20,855 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-12-02 21:38:20,856 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139571077] [2020-12-02 21:38:20,856 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:38:20,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:20,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:38:20,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:38:20,858 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 10 states. [2020-12-02 21:38:21,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:21,900 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-12-02 21:38:21,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-02 21:38:21,904 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-12-02 21:38:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:21,904 INFO L225 Difference]: With dead ends: 40 [2020-12-02 21:38:21,904 INFO L226 Difference]: Without dead ends: 32 [2020-12-02 21:38:21,905 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2020-12-02 21:38:21,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-12-02 21:38:21,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2020-12-02 21:38:21,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-12-02 21:38:21,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-12-02 21:38:21,927 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2020-12-02 21:38:21,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:21,927 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-12-02 21:38:21,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:38:21,927 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-12-02 21:38:21,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-02 21:38:21,929 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:21,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:22,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-12-02 21:38:22,148 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:22,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash 839947293, now seen corresponding path program 1 times [2020-12-02 21:38:22,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:22,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985911613] [2020-12-02 21:38:22,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:22,246 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 11 conjunts are in the unsatisfiable core [2020-12-02 21:38:22,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:22,367 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:38:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:23,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:23,350 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:23,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985911613] [2020-12-02 21:38:23,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:23,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2020-12-02 21:38:23,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058799335] [2020-12-02 21:38:23,486 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-02 21:38:23,486 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:23,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-02 21:38:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-12-02 21:38:23,487 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 12 states. [2020-12-02 21:38:24,302 WARN L197 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 32 [2020-12-02 21:38:24,727 WARN L197 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-12-02 21:38:25,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:25,054 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-12-02 21:38:25,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-02 21:38:25,055 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2020-12-02 21:38:25,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:25,056 INFO L225 Difference]: With dead ends: 70 [2020-12-02 21:38:25,056 INFO L226 Difference]: Without dead ends: 64 [2020-12-02 21:38:25,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 19 SyntacticMatches, 9 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2020-12-02 21:38:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2020-12-02 21:38:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 36. [2020-12-02 21:38:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-02 21:38:25,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2020-12-02 21:38:25,069 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 20 [2020-12-02 21:38:25,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:25,070 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-12-02 21:38:25,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-12-02 21:38:25,070 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2020-12-02 21:38:25,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:38:25,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:25,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:25,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-12-02 21:38:25,278 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:25,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:25,279 INFO L82 PathProgramCache]: Analyzing trace with hash 598258075, now seen corresponding path program 1 times [2020-12-02 21:38:25,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:25,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786055137] [2020-12-02 21:38:25,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:25,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:25,384 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 10 conjunts are in the unsatisfiable core [2020-12-02 21:38:25,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:25,491 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2020-12-02 21:38:25,502 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,505 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,526 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,527 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-12-02 21:38:25,528 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:21 [2020-12-02 21:38:25,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:25,615 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:25,685 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:25,697 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-02 21:38:25,704 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,707 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,708 INFO L547 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,736 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,744 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2020-12-02 21:38:25,750 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,753 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,754 INFO L547 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-12-02 21:38:25,783 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-12-02 21:38:25,785 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-12-02 21:38:25,785 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:69, output treesize:45 [2020-12-02 21:38:26,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:26,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786055137] [2020-12-02 21:38:26,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:26,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2020-12-02 21:38:26,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326565921] [2020-12-02 21:38:26,090 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-02 21:38:26,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:26,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-02 21:38:26,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-12-02 21:38:26,091 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand 10 states. [2020-12-02 21:38:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:28,784 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2020-12-02 21:38:28,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-02 21:38:28,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2020-12-02 21:38:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:28,787 INFO L225 Difference]: With dead ends: 44 [2020-12-02 21:38:28,788 INFO L226 Difference]: Without dead ends: 36 [2020-12-02 21:38:28,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2020-12-02 21:38:28,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-12-02 21:38:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-12-02 21:38:28,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-12-02 21:38:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2020-12-02 21:38:28,797 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 22 [2020-12-02 21:38:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:28,798 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2020-12-02 21:38:28,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-12-02 21:38:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-12-02 21:38:28,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-02 21:38:28,799 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:28,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:29,008 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-12-02 21:38:29,009 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:29,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -211088551, now seen corresponding path program 1 times [2020-12-02 21:38:29,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:29,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1766391997] [2020-12-02 21:38:29,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:29,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:29,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2020-12-02 21:38:29,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:29,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:29,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:29,170 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1766391997] [2020-12-02 21:38:29,170 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:29,170 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-12-02 21:38:29,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719156739] [2020-12-02 21:38:29,171 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-02 21:38:29,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:29,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-02 21:38:29,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-02 21:38:29,172 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand 4 states. [2020-12-02 21:38:29,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:29,259 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-12-02 21:38:29,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-02 21:38:29,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-12-02 21:38:29,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:29,261 INFO L225 Difference]: With dead ends: 40 [2020-12-02 21:38:29,261 INFO L226 Difference]: Without dead ends: 24 [2020-12-02 21:38:29,262 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-02 21:38:29,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-12-02 21:38:29,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-12-02 21:38:29,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-12-02 21:38:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 23 transitions. [2020-12-02 21:38:29,268 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 23 transitions. Word has length 22 [2020-12-02 21:38:29,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:29,269 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 23 transitions. [2020-12-02 21:38:29,269 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-02 21:38:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 23 transitions. [2020-12-02 21:38:29,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-02 21:38:29,270 INFO L414 BasicCegarLoop]: Found error trace [2020-12-02 21:38:29,270 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-02 21:38:29,483 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-12-02 21:38:29,485 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-02 21:38:29,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-02 21:38:29,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2107078825, now seen corresponding path program 1 times [2020-12-02 21:38:29,487 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-12-02 21:38:29,487 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472578944] [2020-12-02 21:38:29,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-12-02 21:38:29,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-02 21:38:29,586 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 16 conjunts are in the unsatisfiable core [2020-12-02 21:38:29,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-02 21:38:29,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-02 21:38:30,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:30,475 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-12-02 21:38:30,683 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-12-02 21:38:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-02 21:38:30,954 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472578944] [2020-12-02 21:38:30,954 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-12-02 21:38:30,954 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2020-12-02 21:38:30,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267680932] [2020-12-02 21:38:30,955 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-12-02 21:38:30,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-12-02 21:38:30,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-12-02 21:38:30,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2020-12-02 21:38:30,957 INFO L87 Difference]: Start difference. First operand 24 states and 23 transitions. Second operand 16 states. [2020-12-02 21:38:31,359 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 21 [2020-12-02 21:38:31,585 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 30 [2020-12-02 21:38:31,758 WARN L197 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2020-12-02 21:38:32,045 WARN L197 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 37 [2020-12-02 21:38:32,290 WARN L197 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 39 [2020-12-02 21:38:32,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-02 21:38:32,293 INFO L93 Difference]: Finished difference Result 24 states and 23 transitions. [2020-12-02 21:38:32,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-02 21:38:32,294 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 23 [2020-12-02 21:38:32,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-02 21:38:32,294 INFO L225 Difference]: With dead ends: 24 [2020-12-02 21:38:32,294 INFO L226 Difference]: Without dead ends: 0 [2020-12-02 21:38:32,295 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 21 SyntacticMatches, 9 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2020-12-02 21:38:32,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-02 21:38:32,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-02 21:38:32,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-02 21:38:32,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-02 21:38:32,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-12-02 21:38:32,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-02 21:38:32,296 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-02 21:38:32,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-12-02 21:38:32,296 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-02 21:38:32,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-02 21:38:32,497 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-12-02 21:38:32,500 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-02 21:38:32,686 WARN L197 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 184 [2020-12-02 21:38:32,812 WARN L197 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 161 [2020-12-02 21:38:34,100 WARN L197 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 184 DAG size of output: 32 [2020-12-02 21:38:34,326 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2020-12-02 21:38:37,221 WARN L197 SmtUtils]: Spent 2.89 s on a formula simplification. DAG size of input: 161 DAG size of output: 36 [2020-12-02 21:38:37,678 WARN L197 SmtUtils]: Spent 456.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 20 [2020-12-02 21:38:38,906 WARN L197 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 156 DAG size of output: 50 [2020-12-02 21:38:38,909 INFO L262 CegarLoopResult]: For program point L31-1(lines 31 36) no Hoare annotation was computed. [2020-12-02 21:38:38,909 INFO L258 CegarLoopResult]: At program point L31-2(lines 31 36) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) [2020-12-02 21:38:38,909 INFO L262 CegarLoopResult]: For program point L31-3(lines 28 53) no Hoare annotation was computed. [2020-12-02 21:38:38,909 INFO L262 CegarLoopResult]: For program point L31-5(lines 31 36) no Hoare annotation was computed. [2020-12-02 21:38:38,909 INFO L258 CegarLoopResult]: At program point L31-6(lines 31 36) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L31-7(lines 28 53) no Hoare annotation was computed. [2020-12-02 21:38:38,910 INFO L265 CegarLoopResult]: At program point L85(lines 65 86) the Hoare annotation is: true [2020-12-02 21:38:38,910 INFO L258 CegarLoopResult]: At program point L52(lines 28 53) the Hoare annotation is: (and (fp.eq ULTIMATE.start___fpclassify_double_~x ULTIMATE.start___fpclassify_double_~x) (or (and (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532223 32)) (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2147483648 32))) (and (bvuge ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2148532224 32)) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv4293918719 32))) (= (_ bv0 32) ULTIMATE.start___fpclassify_double_~lsw~0) (bvule ULTIMATE.start___fpclassify_double_~msw~0 (_ bv2146435071 32))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (= ULTIMATE.start___fpclassify_double_~x ULTIMATE.start_fmax_double_~x) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_double_~x) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) ULTIMATE.start_fmax_double_~x))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2020-12-02 21:38:38,910 INFO L258 CegarLoopResult]: At program point L52-1(lines 28 53) the Hoare annotation is: (and (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|) (exists ((|v_skolemized_q#valueAsBitvector_8| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_8|)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_8|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_8|))) (= ULTIMATE.start___fpclassify_double_~lsw~0 ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_8|)))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x))) [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L48(lines 48 52) no Hoare annotation was computed. [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L48-1(lines 48 52) no Hoare annotation was computed. [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L44(lines 44 52) no Hoare annotation was computed. [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L44-1(lines 44 52) no Hoare annotation was computed. [2020-12-02 21:38:38,910 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point L57(lines 57 58) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point L74(lines 74 83) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point L41(lines 41 52) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point L41-1(lines 41 52) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point L74-2(lines 74 83) no Hoare annotation was computed. [2020-12-02 21:38:38,911 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-02 21:38:38,912 INFO L262 CegarLoopResult]: For program point L62(line 62) no Hoare annotation was computed. [2020-12-02 21:38:38,912 INFO L262 CegarLoopResult]: For program point L62-2(line 62) no Hoare annotation was computed. [2020-12-02 21:38:38,912 INFO L258 CegarLoopResult]: At program point L62-3(lines 55 63) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_fmax_double_~y)) (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_6|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_6|))))) (fp.eq ULTIMATE.start_fmax_double_~x ULTIMATE.start_main_~x~0) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start___fpclassify_double_~x)) (fp.eq |ULTIMATE.start_fmax_double_#res| ULTIMATE.start_main_~x~0)) [2020-12-02 21:38:38,912 INFO L262 CegarLoopResult]: For program point L79(lines 79 82) no Hoare annotation was computed. [2020-12-02 21:38:38,912 INFO L262 CegarLoopResult]: For program point L59(lines 59 60) no Hoare annotation was computed. [2020-12-02 21:38:38,913 INFO L258 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode (_ +zero 11 53) (_ +zero 11 53)) ULTIMATE.start_main_~y~0)) (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_double_#res|)) (and (not .cse0) (= (_ bv1 32) |ULTIMATE.start_isnan_double_#res|))))) [2020-12-02 21:38:38,913 INFO L262 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2020-12-02 21:38:38,921 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:38,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,934 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,940 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:38,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,946 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,947 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,948 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,949 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,950 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:38,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,951 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:38,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 09:38:38 BoogieIcfgContainer [2020-12-02 21:38:38,954 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-02 21:38:38,955 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-02 21:38:38,955 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-02 21:38:38,955 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-02 21:38:38,956 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 09:37:38" (3/4) ... [2020-12-02 21:38:38,960 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-02 21:38:38,972 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2020-12-02 21:38:38,973 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-02 21:38:38,973 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-12-02 21:38:38,973 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-02 21:38:39,003 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) [2020-12-02 21:38:39,004 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result [2020-12-02 21:38:39,004 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~DOUBLE(x, x) && ((((~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || 0bv32 == lsw) || ~bvule32(msw, 2146435071bv32))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x)) && !(0bv32 == \result) [2020-12-02 21:38:39,005 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x)) && ~fp.eq~DOUBLE(\result, x) [2020-12-02 21:38:39,005 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-02 21:38:39,005 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((0bv32 == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) [2020-12-02 21:38:39,037 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-12-02 21:38:39,038 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-02 21:38:39,039 INFO L168 Benchmark]: Toolchain (without parser) took 62086.91 ms. Allocated memory was 48.2 MB in the beginning and 73.4 MB in the end (delta: 25.2 MB). Free memory was 24.6 MB in the beginning and 38.9 MB in the end (delta: -14.3 MB). Peak memory consumption was 13.2 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,041 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 48.2 MB. Free memory was 27.9 MB in the beginning and 27.9 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:38:39,042 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.47 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 24.4 MB in the beginning and 37.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,043 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 60.8 MB. Free memory was 37.2 MB in the beginning and 35.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,045 INFO L168 Benchmark]: Boogie Preprocessor took 46.50 ms. Allocated memory is still 60.8 MB. Free memory was 35.4 MB in the beginning and 33.9 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-02 21:38:39,046 INFO L168 Benchmark]: RCFGBuilder took 638.66 ms. Allocated memory is still 60.8 MB. Free memory was 33.9 MB in the beginning and 29.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,046 INFO L168 Benchmark]: TraceAbstraction took 60908.87 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 28.9 MB in the beginning and 43.1 MB in the end (delta: -14.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,047 INFO L168 Benchmark]: Witness Printer took 82.99 ms. Allocated memory is still 73.4 MB. Free memory was 43.1 MB in the beginning and 38.9 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-02 21:38:39,052 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.27 ms. Allocated memory is still 48.2 MB. Free memory was 27.9 MB in the beginning and 27.9 MB in the end (delta: 63.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 349.47 ms. Allocated memory was 48.2 MB in the beginning and 60.8 MB in the end (delta: 12.6 MB). Free memory was 24.4 MB in the beginning and 37.2 MB in the end (delta: -12.8 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 51.23 ms. Allocated memory is still 60.8 MB. Free memory was 37.2 MB in the beginning and 35.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 46.50 ms. Allocated memory is still 60.8 MB. Free memory was 35.4 MB in the beginning and 33.9 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 638.66 ms. Allocated memory is still 60.8 MB. Free memory was 33.9 MB in the beginning and 29.6 MB in the end (delta: 4.4 MB). Peak memory consumption was 10.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 60908.87 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 28.9 MB in the beginning and 43.1 MB in the end (delta: -14.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. * Witness Printer took 82.99 ms. Allocated memory is still 73.4 MB. Free memory was 43.1 MB in the beginning and 38.9 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[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 55]: Loop Invariant [2020-12-02 21:38:39,063 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,064 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,065 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_6,QUANTIFIED] [2020-12-02 21:38:39,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,067 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && (\exists v_skolemized_q#valueAsBitvector_6 : bv64, currentRoundingMode : FloatRoundingMode :: v_skolemized_q#valueAsBitvector_6[63:32] == msw && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_6[63:63], v_skolemized_q#valueAsBitvector_6[62:52], v_skolemized_q#valueAsBitvector_6[51:0]))) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x)) && ~fp.eq~DOUBLE(\result, x) - InvariantResult [Line: 18]: Loop Invariant [2020-12-02 21:38:39,069 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,070 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ((~fp.eq~DOUBLE(x, x) && 0bv32 == \result) || (!~fp.eq~DOUBLE(x, x) && 1bv32 == \result)) - InvariantResult [Line: 31]: Loop Invariant [2020-12-02 21:38:39,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,075 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,076 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && 0bv32 == \result - InvariantResult [Line: 28]: Loop Invariant [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,077 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,078 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,083 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_8,QUANTIFIED] [2020-12-02 21:38:39,084 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,085 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((0bv32 == \result && (\exists v_skolemized_q#valueAsBitvector_8 : bv64, currentRoundingMode : FloatRoundingMode :: (msw == v_skolemized_q#valueAsBitvector_8[63:32] && ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_8[63:63], v_skolemized_q#valueAsBitvector_8[62:52], v_skolemized_q#valueAsBitvector_8[51:0])) && lsw == v_skolemized_q#valueAsBitvector_8[31:0])) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 31]: Loop Invariant [2020-12-02 21:38:39,086 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: ((((\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y) && ~fp.eq~DOUBLE(x, x)) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 28]: Loop Invariant [2020-12-02 21:38:39,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,090 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2020-12-02 21:38:39,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-12-02 21:38:39,093 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((~fp.eq~DOUBLE(x, x) && ((((~bvule32(msw, 2148532223bv32) && ~bvuge32(msw, 2147483648bv32)) || (~bvuge32(msw, 2148532224bv32) && ~bvule32(msw, 4293918719bv32))) || 0bv32 == lsw) || ~bvule32(msw, 2146435071bv32))) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && x == x) && x == x) && (\exists currentRoundingMode : FloatRoundingMode :: ~fp.div~DOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE(), ~Pluszero~LONGDOUBLE()) == y)) && 0bv32 == \result) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == x)) && !(0bv32 == \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 54.2s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 26.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 268 SDtfs, 696 SDslu, 493 SDs, 0 SdLazy, 360 SolverSat, 52 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 379 GetRequests, 256 SyntacticMatches, 19 SemanticMatches, 104 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 94 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 18 NumberOfFragments, 249 HoareAnnotationTreeSize, 7 FomulaSimplifications, 331 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 7 FomulaSimplificationsInter, 11598 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 24.1s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 340 ConstructedInterpolants, 103 QuantifiedInterpolants, 65055 SizeOfPredicates, 73 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 RESULT: Ultimate proved your program to be correct! Received shutdown request...