./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1252a.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 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-5485861 [2020-10-25 21:53:58,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 21:53:58,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 21:53:58,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 21:53:58,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 21:53:58,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 21:53:58,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 21:53:58,752 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 21:53:58,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 21:53:58,763 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 21:53:58,764 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 21:53:58,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 21:53:58,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 21:53:58,774 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 21:53:58,775 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 21:53:58,777 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 21:53:58,779 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 21:53:58,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 21:53:58,786 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 21:53:58,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 21:53:58,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 21:53:58,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 21:53:58,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 21:53:58,803 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 21:53:58,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 21:53:58,812 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 21:53:58,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 21:53:58,816 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 21:53:58,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 21:53:58,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 21:53:58,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 21:53:58,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 21:53:58,821 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 21:53:58,822 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 21:53:58,824 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 21:53:58,824 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 21:53:58,825 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 21:53:58,825 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 21:53:58,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 21:53:58,830 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 21:53:58,831 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 21:53:58,832 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 21:53:58,900 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 21:53:58,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 21:53:58,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 21:53:58,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 21:53:58,905 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 21:53:58,905 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 21:53:58,905 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 21:53:58,906 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 21:53:58,906 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 21:53:58,907 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 21:53:58,908 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 21:53:58,908 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 21:53:58,909 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 21:53:58,909 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 21:53:58,909 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 21:53:58,909 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 21:53:58,910 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 21:53:58,910 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 21:53:58,910 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 21:53:58,911 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 21:53:58,911 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 21:53:58,911 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:53:58,912 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 21:53:58,912 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 21:53:58,912 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 21:53:58,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 21:53:58,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 21:53:58,913 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 21:53:58,913 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 21:53:58,914 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 -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2020-10-25 21:53:59,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 21:53:59,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 21:53:59,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 21:53:59,407 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 21:53:59,408 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 21:53:59,409 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-25 21:53:59,536 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98fc9d436/3e7eae475307441bb3db45be382d06ff/FLAG026e78776 [2020-10-25 21:54:00,099 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 21:54:00,100 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-25 21:54:00,109 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98fc9d436/3e7eae475307441bb3db45be382d06ff/FLAG026e78776 [2020-10-25 21:54:00,476 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98fc9d436/3e7eae475307441bb3db45be382d06ff [2020-10-25 21:54:00,479 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 21:54:00,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 21:54:00,488 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:00,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 21:54:00,492 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 21:54:00,493 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67cd3787 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00, skipping insertion in model container [2020-10-25 21:54:00,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,507 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 21:54:00,529 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 21:54:00,702 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:00,712 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 21:54:00,748 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:00,766 INFO L208 MainTranslator]: Completed translation [2020-10-25 21:54:00,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00 WrapperNode [2020-10-25 21:54:00,767 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:00,769 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:00,769 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 21:54:00,769 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 21:54:00,778 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:00,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 21:54:00,821 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 21:54:00,821 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 21:54:00,834 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,834 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,859 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (1/1) ... [2020-10-25 21:54:00,865 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 21:54:00,867 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 21:54:00,867 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 21:54:00,867 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 21:54:00,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (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-10-25 21:54:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 21:54:00,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 21:54:00,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2020-10-25 21:54:00,965 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 21:54:00,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 21:54:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-25 21:54:00,966 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 21:54:01,498 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 21:54:01,499 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-25 21:54:01,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:01 BoogieIcfgContainer [2020-10-25 21:54:01,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 21:54:01,509 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 21:54:01,509 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 21:54:01,513 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 21:54:01,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 09:54:00" (1/3) ... [2020-10-25 21:54:01,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c6af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:01, skipping insertion in model container [2020-10-25 21:54:01,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:00" (2/3) ... [2020-10-25 21:54:01,514 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@605c6af7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:01, skipping insertion in model container [2020-10-25 21:54:01,520 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:01" (3/3) ... [2020-10-25 21:54:01,522 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-10-25 21:54:01,536 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 21:54:01,543 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 21:54:01,559 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 21:54:01,590 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 21:54:01,590 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 21:54:01,591 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 21:54:01,591 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 21:54:01,591 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 21:54:01,591 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 21:54:01,591 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 21:54:01,592 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 21:54:01,611 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-25 21:54:01,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 21:54:01,618 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:01,619 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:01,620 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:01,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:01,628 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-25 21:54:01,639 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:01,640 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716116000] [2020-10-25 21:54:01,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:01,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:01,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:01,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716116000] [2020-10-25 21:54:01,794 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:01,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-25 21:54:01,795 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66551463] [2020-10-25 21:54:01,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 21:54:01,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:54:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 21:54:01,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:54:01,821 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-25 21:54:01,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:01,846 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-25 21:54:01,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 21:54:01,848 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-25 21:54:01,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:01,860 INFO L225 Difference]: With dead ends: 63 [2020-10-25 21:54:01,861 INFO L226 Difference]: Without dead ends: 29 [2020-10-25 21:54:01,864 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-10-25 21:54:01,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-25 21:54:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-25 21:54:01,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-25 21:54:01,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-25 21:54:01,912 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-25 21:54:01,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:01,913 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-25 21:54:01,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 21:54:01,913 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-25 21:54:01,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 21:54:01,914 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:01,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:01,915 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 21:54:01,916 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:01,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:01,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-25 21:54:01,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:01,918 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177432414] [2020-10-25 21:54:01,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,021 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177432414] [2020-10-25 21:54:02,021 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:02,021 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:54:02,022 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553675220] [2020-10-25 21:54:02,023 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:02,024 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:54:02,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:02,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:02,025 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2020-10-25 21:54:02,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:02,096 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2020-10-25 21:54:02,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:02,097 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-25 21:54:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:02,098 INFO L225 Difference]: With dead ends: 53 [2020-10-25 21:54:02,098 INFO L226 Difference]: Without dead ends: 44 [2020-10-25 21:54:02,100 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-10-25 21:54:02,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-25 21:54:02,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2020-10-25 21:54:02,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:02,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:02,108 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-25 21:54:02,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:02,108 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:02,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:02,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-25 21:54:02,110 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,110 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,110 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 21:54:02,111 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,112 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2020-10-25 21:54:02,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:02,112 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068365880] [2020-10-25 21:54:02,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,180 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068365880] [2020-10-25 21:54:02,181 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:02,181 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:54:02,181 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759394873] [2020-10-25 21:54:02,181 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:02,182 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:54:02,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:02,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:02,184 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:54:02,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:02,245 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-25 21:54:02,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:02,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-25 21:54:02,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:02,248 INFO L225 Difference]: With dead ends: 55 [2020-10-25 21:54:02,248 INFO L226 Difference]: Without dead ends: 46 [2020-10-25 21:54:02,249 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-10-25 21:54:02,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-25 21:54:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-25 21:54:02,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:02,256 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 12 [2020-10-25 21:54:02,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:02,256 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:02,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:02,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-25 21:54:02,258 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,258 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-25 21:54:02,259 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2020-10-25 21:54:02,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:02,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762655366] [2020-10-25 21:54:02,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:02,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,323 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762655366] [2020-10-25 21:54:02,323 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:02,323 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:54:02,324 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883615351] [2020-10-25 21:54:02,324 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:02,324 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:54:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:02,326 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:54:02,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:02,394 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2020-10-25 21:54:02,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:02,395 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-25 21:54:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:02,396 INFO L225 Difference]: With dead ends: 57 [2020-10-25 21:54:02,396 INFO L226 Difference]: Without dead ends: 48 [2020-10-25 21:54:02,397 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-10-25 21:54:02,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-25 21:54:02,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 31. [2020-10-25 21:54:02,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:02,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:02,404 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 13 [2020-10-25 21:54:02,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:02,404 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:02,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:02,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:54:02,406 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,406 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-25 21:54:02,407 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,408 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2020-10-25 21:54:02,408 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:02,409 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260588974] [2020-10-25 21:54:02,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:02,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:02,487 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260588974] [2020-10-25 21:54:02,487 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:02,487 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-25 21:54:02,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683969448] [2020-10-25 21:54:02,488 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:02,488 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 21:54:02,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:02,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:02,491 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2020-10-25 21:54:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:02,544 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2020-10-25 21:54:02,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:02,545 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-10-25 21:54:02,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:02,546 INFO L225 Difference]: With dead ends: 55 [2020-10-25 21:54:02,546 INFO L226 Difference]: Without dead ends: 46 [2020-10-25 21:54:02,546 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-10-25 21:54:02,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-10-25 21:54:02,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2020-10-25 21:54:02,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:02,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:02,553 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2020-10-25 21:54:02,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:02,553 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:02,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:02,554 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:02,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:54:02,554 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:02,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:02,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-25 21:54:02,555 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:02,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:02,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-25 21:54:02,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 21:54:02,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843963092] [2020-10-25 21:54:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 21:54:02,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:54:02,586 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:54:02,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 21:54:02,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 21:54:02,646 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 21:54:02,646 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 21:54:02,647 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-25 21:54:02,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 09:54:02 BoogieIcfgContainer [2020-10-25 21:54:02,687 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 21:54:02,687 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 21:54:02,688 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 21:54:02,688 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 21:54:02,688 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:01" (3/4) ... [2020-10-25 21:54:02,692 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-25 21:54:02,693 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 21:54:02,695 INFO L168 Benchmark]: Toolchain (without parser) took 2213.00 ms. Allocated memory was 41.9 MB in the beginning and 60.8 MB in the end (delta: 18.9 MB). Free memory was 27.4 MB in the beginning and 43.4 MB in the end (delta: -16.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,696 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 41.9 MB. Free memory was 20.2 MB in the beginning and 20.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:54:02,697 INFO L168 Benchmark]: CACSL2BoogieTranslator took 280.37 ms. Allocated memory is still 41.9 MB. Free memory was 26.7 MB in the beginning and 26.0 MB in the end (delta: 731.1 kB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,698 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.86 ms. Allocated memory is still 41.9 MB. Free memory was 26.0 MB in the beginning and 24.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,699 INFO L168 Benchmark]: Boogie Preprocessor took 45.43 ms. Allocated memory is still 41.9 MB. Free memory was 24.1 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,700 INFO L168 Benchmark]: RCFGBuilder took 634.58 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 22.6 MB in the beginning and 20.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,701 INFO L168 Benchmark]: TraceAbstraction took 1177.94 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 33.9 MB in the beginning and 43.4 MB in the end (delta: -9.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:02,701 INFO L168 Benchmark]: Witness Printer took 5.26 ms. Allocated memory is still 60.8 MB. Free memory is still 43.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:54:02,706 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.33 ms. Allocated memory is still 41.9 MB. Free memory was 20.2 MB in the beginning and 20.1 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 280.37 ms. Allocated memory is still 41.9 MB. Free memory was 26.7 MB in the beginning and 26.0 MB in the end (delta: 731.1 kB). Peak memory consumption was 11.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 50.86 ms. Allocated memory is still 41.9 MB. Free memory was 26.0 MB in the beginning and 24.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 45.43 ms. Allocated memory is still 41.9 MB. Free memory was 24.1 MB in the beginning and 22.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 634.58 ms. Allocated memory was 41.9 MB in the beginning and 50.3 MB in the end (delta: 8.4 MB). Free memory was 22.6 MB in the beginning and 20.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 9.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1177.94 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 33.9 MB in the beginning and 43.4 MB in the end (delta: -9.5 MB). Peak memory consumption was 21.7 MB. Max. memory is 16.1 GB. * Witness Printer took 5.26 ms. Allocated memory is still 60.8 MB. Free memory is still 43.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 3]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 86, overapproximation of someUnaryDOUBLEoperation at line 81. Possible FailurePath: [L81] double x = -0.0; [L82] double y = 0.0; [L26] __uint32_t msw, lsw; [L29] ieee_double_shape_type ew_u; [L30] ew_u.value = (x) [L31] EXPR ew_u.parts.msw [L31] (msw) = ew_u.parts.msw [L32] EXPR ew_u.parts.lsw [L32] (lsw) = ew_u.parts.lsw [L35-L36] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L38-L39] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L41-L42] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L45-L46] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L49] return 0; [L54] COND TRUE __fpclassify_double(x) == 0 [L55] return y; [L83] double res = fmax_double(x, y); [L86] EXPR res == 0.0 && __signbit_double(res) == 0 [L86] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L3] __assert_fail("0", "double_req_bl_1252a.c", 3, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 1.0s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 251 SDtfs, 64 SDslu, 298 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=33occurred 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, 60 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 55 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 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-5485861 [2020-10-25 21:54:05,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 21:54:05,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 21:54:05,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 21:54:05,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 21:54:05,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 21:54:05,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 21:54:05,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 21:54:05,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 21:54:05,475 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 21:54:05,476 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 21:54:05,478 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 21:54:05,478 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 21:54:05,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 21:54:05,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 21:54:05,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 21:54:05,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 21:54:05,485 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 21:54:05,487 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 21:54:05,490 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 21:54:05,492 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 21:54:05,494 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 21:54:05,495 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 21:54:05,496 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 21:54:05,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 21:54:05,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 21:54:05,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 21:54:05,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 21:54:05,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 21:54:05,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 21:54:05,504 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 21:54:05,505 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 21:54:05,506 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 21:54:05,507 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 21:54:05,508 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 21:54:05,509 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 21:54:05,509 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 21:54:05,510 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 21:54:05,510 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 21:54:05,511 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 21:54:05,512 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 21:54:05,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-10-25 21:54:05,569 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 21:54:05,570 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 21:54:05,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 21:54:05,573 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 21:54:05,574 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 21:54:05,574 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 21:54:05,574 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 21:54:05,575 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 21:54:05,575 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 21:54:05,577 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 21:54:05,578 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 21:54:05,578 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 21:54:05,579 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-25 21:54:05,579 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-25 21:54:05,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 21:54:05,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 21:54:05,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 21:54:05,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 21:54:05,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 21:54:05,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 21:54:05,581 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 21:54:05,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 21:54:05,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 21:54:05,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 21:54:05,582 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 21:54:05,582 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 21:54:05,582 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-25 21:54:05,582 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-25 21:54:05,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 21:54:05,583 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 21:54:05,583 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-25 21:54:05,583 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 -> 23f3104f6bf674f4cf2d86feffb86c85d21d7d18 [2020-10-25 21:54:06,052 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 21:54:06,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 21:54:06,119 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 21:54:06,121 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 21:54:06,121 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 21:54:06,124 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-25 21:54:06,203 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea7cc618/a4ea8123499c4f7baaa95efa80a1d468/FLAG0729195d9 [2020-10-25 21:54:06,985 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 21:54:06,986 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2020-10-25 21:54:06,995 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea7cc618/a4ea8123499c4f7baaa95efa80a1d468/FLAG0729195d9 [2020-10-25 21:54:07,343 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bea7cc618/a4ea8123499c4f7baaa95efa80a1d468 [2020-10-25 21:54:07,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 21:54:07,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 21:54:07,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:07,358 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 21:54:07,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 21:54:07,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246169ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07, skipping insertion in model container [2020-10-25 21:54:07,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 21:54:07,391 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 21:54:07,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:07,647 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 21:54:07,679 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 21:54:07,707 INFO L208 MainTranslator]: Completed translation [2020-10-25 21:54:07,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07 WrapperNode [2020-10-25 21:54:07,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 21:54:07,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:07,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 21:54:07,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 21:54:07,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,759 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,788 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 21:54:07,789 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 21:54:07,790 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 21:54:07,790 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 21:54:07,800 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,818 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,827 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (1/1) ... [2020-10-25 21:54:07,832 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 21:54:07,833 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 21:54:07,834 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 21:54:07,834 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 21:54:07,835 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (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-10-25 21:54:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2020-10-25 21:54:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-25 21:54:07,917 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 21:54:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2020-10-25 21:54:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 21:54:07,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 21:54:07,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-25 21:54:08,567 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 21:54:08,568 INFO L298 CfgBuilder]: Removed 20 assume(true) statements. [2020-10-25 21:54:08,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:08 BoogieIcfgContainer [2020-10-25 21:54:08,570 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 21:54:08,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 21:54:08,573 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 21:54:08,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 21:54:08,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 09:54:07" (1/3) ... [2020-10-25 21:54:08,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b283ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:08, skipping insertion in model container [2020-10-25 21:54:08,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 09:54:07" (2/3) ... [2020-10-25 21:54:08,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b283ef3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 09:54:08, skipping insertion in model container [2020-10-25 21:54:08,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:08" (3/3) ... [2020-10-25 21:54:08,582 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2020-10-25 21:54:08,599 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 21:54:08,607 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 21:54:08,624 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 21:54:08,674 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 21:54:08,675 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 21:54:08,675 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 21:54:08,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 21:54:08,676 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 21:54:08,676 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 21:54:08,676 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 21:54:08,676 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 21:54:08,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-10-25 21:54:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 21:54:08,703 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:08,704 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:08,705 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:08,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:08,712 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2020-10-25 21:54:08,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:08,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1165828222] [2020-10-25 21:54:08,728 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-10-25 21:54:08,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:08,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2020-10-25 21:54:08,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:08,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:08,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:08,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:08,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1165828222] [2020-10-25 21:54:08,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:08,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-10-25 21:54:08,895 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190961017] [2020-10-25 21:54:08,901 INFO L461 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-10-25 21:54:08,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-25 21:54:08,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-25 21:54:08,925 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2020-10-25 21:54:08,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:08,958 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2020-10-25 21:54:08,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-25 21:54:08,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-10-25 21:54:08,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:08,979 INFO L225 Difference]: With dead ends: 63 [2020-10-25 21:54:08,979 INFO L226 Difference]: Without dead ends: 29 [2020-10-25 21:54:08,985 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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-10-25 21:54:09,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2020-10-25 21:54:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2020-10-25 21:54:09,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-10-25 21:54:09,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2020-10-25 21:54:09,039 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2020-10-25 21:54:09,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:09,040 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2020-10-25 21:54:09,041 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-10-25 21:54:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2020-10-25 21:54:09,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 21:54:09,042 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:09,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:09,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-25 21:54:09,258 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:09,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2020-10-25 21:54:09,260 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:09,261 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738431756] [2020-10-25 21:54:09,261 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-10-25 21:54:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:09,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 21:54:09,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:09,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:09,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:09,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:09,461 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738431756] [2020-10-25 21:54:09,463 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:09,463 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:09,463 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84458568] [2020-10-25 21:54:09,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:09,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:09,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:09,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:09,468 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2020-10-25 21:54:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:09,611 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2020-10-25 21:54:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:54:09,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-10-25 21:54:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:09,613 INFO L225 Difference]: With dead ends: 68 [2020-10-25 21:54:09,614 INFO L226 Difference]: Without dead ends: 59 [2020-10-25 21:54:09,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 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-10-25 21:54:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-10-25 21:54:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2020-10-25 21:54:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-25 21:54:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2020-10-25 21:54:09,623 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2020-10-25 21:54:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:09,624 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2020-10-25 21:54:09,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2020-10-25 21:54:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-25 21:54:09,625 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:09,625 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:09,833 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-25 21:54:09,834 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:09,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:09,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2020-10-25 21:54:09,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:09,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433888004] [2020-10-25 21:54:09,837 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-10-25 21:54:09,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:09,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 21:54:09,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:10,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:10,018 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:10,038 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-25 21:54:10,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:10,101 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433888004] [2020-10-25 21:54:10,101 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:10,101 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:10,102 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954301692] [2020-10-25 21:54:10,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:10,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:10,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:10,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:10,106 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2020-10-25 21:54:10,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:10,247 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2020-10-25 21:54:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-25 21:54:10,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-25 21:54:10,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:10,249 INFO L225 Difference]: With dead ends: 52 [2020-10-25 21:54:10,249 INFO L226 Difference]: Without dead ends: 28 [2020-10-25 21:54:10,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-25 21:54:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-10-25 21:54:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-10-25 21:54:10,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-10-25 21:54:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2020-10-25 21:54:10,256 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2020-10-25 21:54:10,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:10,257 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-10-25 21:54:10,257 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:10,257 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2020-10-25 21:54:10,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-25 21:54:10,261 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:10,261 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:10,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-25 21:54:10,477 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:10,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:10,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2020-10-25 21:54:10,480 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:10,480 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1365167351] [2020-10-25 21:54:10,480 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-10-25 21:54:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:10,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-25 21:54:10,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:10,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:10,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:10,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:10,636 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1365167351] [2020-10-25 21:54:10,636 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:10,637 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2020-10-25 21:54:10,637 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259149356] [2020-10-25 21:54:10,638 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-25 21:54:10,638 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:10,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-25 21:54:10,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-25 21:54:10,639 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2020-10-25 21:54:10,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:10,875 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2020-10-25 21:54:10,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-25 21:54:10,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2020-10-25 21:54:10,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:10,877 INFO L225 Difference]: With dead ends: 65 [2020-10-25 21:54:10,877 INFO L226 Difference]: Without dead ends: 56 [2020-10-25 21:54:10,878 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 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-10-25 21:54:10,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-25 21:54:10,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2020-10-25 21:54:10,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-25 21:54:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2020-10-25 21:54:10,885 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2020-10-25 21:54:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:10,885 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2020-10-25 21:54:10,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-25 21:54:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2020-10-25 21:54:10,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 21:54:10,887 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:10,887 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:11,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-25 21:54:11,107 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:11,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:11,108 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2020-10-25 21:54:11,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:11,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440303776] [2020-10-25 21:54:11,109 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-10-25 21:54:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:11,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-25 21:54:11,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:11,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:11,257 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:11,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:11,297 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440303776] [2020-10-25 21:54:11,297 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:11,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2020-10-25 21:54:11,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35982401] [2020-10-25 21:54:11,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-25 21:54:11,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:11,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-25 21:54:11,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:11,300 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2020-10-25 21:54:11,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:11,315 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2020-10-25 21:54:11,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-25 21:54:11,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-10-25 21:54:11,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:11,317 INFO L225 Difference]: With dead ends: 40 [2020-10-25 21:54:11,317 INFO L226 Difference]: Without dead ends: 30 [2020-10-25 21:54:11,318 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-10-25 21:54:11,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-10-25 21:54:11,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-10-25 21:54:11,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-10-25 21:54:11,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2020-10-25 21:54:11,324 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2020-10-25 21:54:11,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:11,324 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2020-10-25 21:54:11,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-25 21:54:11,324 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2020-10-25 21:54:11,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-25 21:54:11,325 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:11,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 21:54:11,538 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-25 21:54:11,538 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:11,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:11,539 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2020-10-25 21:54:11,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:11,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861839315] [2020-10-25 21:54:11,541 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-10-25 21:54:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:11,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 21:54:11,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:11,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:11,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:11,793 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861839315] [2020-10-25 21:54:11,793 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:11,793 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2020-10-25 21:54:11,793 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396339568] [2020-10-25 21:54:11,794 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 21:54:11,796 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:11,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 21:54:11,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 21:54:11,797 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2020-10-25 21:54:11,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:11,968 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2020-10-25 21:54:11,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 21:54:11,969 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2020-10-25 21:54:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:11,971 INFO L225 Difference]: With dead ends: 42 [2020-10-25 21:54:11,971 INFO L226 Difference]: Without dead ends: 39 [2020-10-25 21:54:11,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-10-25 21:54:11,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-25 21:54:11,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2020-10-25 21:54:11,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-10-25 21:54:11,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2020-10-25 21:54:11,986 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2020-10-25 21:54:11,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:11,987 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2020-10-25 21:54:11,987 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 21:54:11,987 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2020-10-25 21:54:11,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-25 21:54:11,988 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:11,988 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-10-25 21:54:12,204 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-25 21:54:12,205 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:12,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:12,207 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2020-10-25 21:54:12,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:12,208 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1738017894] [2020-10-25 21:54:12,208 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-10-25 21:54:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:12,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-25 21:54:12,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:12,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:12,401 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:12,499 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1738017894] [2020-10-25 21:54:12,499 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:12,499 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2020-10-25 21:54:12,499 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547695789] [2020-10-25 21:54:12,500 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-25 21:54:12,500 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:12,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-25 21:54:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-25 21:54:12,502 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2020-10-25 21:54:12,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:12,680 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-10-25 21:54:12,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 21:54:12,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2020-10-25 21:54:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:12,682 INFO L225 Difference]: With dead ends: 45 [2020-10-25 21:54:12,682 INFO L226 Difference]: Without dead ends: 27 [2020-10-25 21:54:12,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2020-10-25 21:54:12,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-25 21:54:12,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-25 21:54:12,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-25 21:54:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2020-10-25 21:54:12,696 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2020-10-25 21:54:12,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:12,696 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2020-10-25 21:54:12,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-25 21:54:12,696 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2020-10-25 21:54:12,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-25 21:54:12,701 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 21:54:12,701 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-10-25 21:54:12,920 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2020-10-25 21:54:12,920 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 21:54:12,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 21:54:12,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2020-10-25 21:54:12,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-25 21:54:12,923 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1471232151] [2020-10-25 21:54:12,923 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-10-25 21:54:13,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 21:54:13,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-25 21:54:13,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 21:54:13,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-25 21:54:13,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:13,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-25 21:54:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 21:54:13,575 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1471232151] [2020-10-25 21:54:13,576 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-25 21:54:13,576 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2020-10-25 21:54:13,576 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480698025] [2020-10-25 21:54:13,577 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-25 21:54:13,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-25 21:54:13,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-25 21:54:13,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2020-10-25 21:54:13,578 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2020-10-25 21:54:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 21:54:13,923 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2020-10-25 21:54:13,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-25 21:54:13,924 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2020-10-25 21:54:13,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 21:54:13,925 INFO L225 Difference]: With dead ends: 27 [2020-10-25 21:54:13,925 INFO L226 Difference]: Without dead ends: 0 [2020-10-25 21:54:13,926 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2020-10-25 21:54:13,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-25 21:54:13,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-25 21:54:13,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-25 21:54:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-25 21:54:13,927 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2020-10-25 21:54:13,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 21:54:13,927 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-25 21:54:13,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-25 21:54:13,927 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-25 21:54:13,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-25 21:54:14,133 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2020-10-25 21:54:14,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-25 21:54:14,478 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-10-25 21:54:14,479 INFO L274 CegarLoopResult]: For program point L3-1(line 3) no Hoare annotation was computed. [2020-10-25 21:54:14,479 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-10-25 21:54:14,479 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-10-25 21:54:14,479 INFO L274 CegarLoopResult]: For program point L28-1(lines 28 33) no Hoare annotation was computed. [2020-10-25 21:54:14,479 INFO L270 CegarLoopResult]: At program point L28-2(lines 28 33) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x))) [2020-10-25 21:54:14,480 INFO L274 CegarLoopResult]: For program point L28-3(lines 25 50) no Hoare annotation was computed. [2020-10-25 21:54:14,480 INFO L274 CegarLoopResult]: For program point L28-5(lines 28 33) no Hoare annotation was computed. [2020-10-25 21:54:14,480 INFO L270 CegarLoopResult]: At program point L28-6(lines 28 33) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x)) [2020-10-25 21:54:14,480 INFO L274 CegarLoopResult]: For program point L86(line 86) no Hoare annotation was computed. [2020-10-25 21:54:14,480 INFO L274 CegarLoopResult]: For program point L28-7(lines 25 50) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L86-2(lines 86 89) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L45(lines 45 49) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L45-1(lines 45 49) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L54(lines 54 55) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L270 CegarLoopResult]: At program point L71(lines 62 72) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short18| (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3)) (_ +zero 11 53)) (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)))) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start___signbit_double_~x (_ +zero 11 53))) [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L38(lines 38 49) no Hoare annotation was computed. [2020-10-25 21:54:14,481 INFO L274 CegarLoopResult]: For program point L38-1(lines 38 49) no Hoare annotation was computed. [2020-10-25 21:54:14,482 INFO L274 CegarLoopResult]: For program point L56(lines 56 57) no Hoare annotation was computed. [2020-10-25 21:54:14,482 INFO L274 CegarLoopResult]: For program point L65-1(lines 65 69) no Hoare annotation was computed. [2020-10-25 21:54:14,482 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-10-25 21:54:14,482 INFO L270 CegarLoopResult]: At program point L65-2(lines 65 69) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) |ULTIMATE.start_main_#t~short18| (= (_ +zero 11 53) ULTIMATE.start_main_~res~0) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (= ULTIMATE.start___signbit_double_~x (_ +zero 11 53))) [2020-10-25 21:54:14,482 INFO L274 CegarLoopResult]: For program point L65-3(lines 65 69) no Hoare annotation was computed. [2020-10-25 21:54:14,482 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-10-25 21:54:14,483 INFO L270 CegarLoopResult]: At program point L49(lines 25 50) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_1_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.neg (_ +zero 11 53))))) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= .cse0 ULTIMATE.start_fmax_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)))) [2020-10-25 21:54:14,483 INFO L270 CegarLoopResult]: At program point L49-1(lines 25 50) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|))) [2020-10-25 21:54:14,484 INFO L274 CegarLoopResult]: For program point L41(lines 41 49) no Hoare annotation was computed. [2020-10-25 21:54:14,484 INFO L274 CegarLoopResult]: For program point L41-1(lines 41 49) no Hoare annotation was computed. [2020-10-25 21:54:14,484 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-10-25 21:54:14,484 INFO L277 CegarLoopResult]: At program point L91(lines 74 92) the Hoare annotation is: true [2020-10-25 21:54:14,484 INFO L274 CegarLoopResult]: For program point L59(line 59) no Hoare annotation was computed. [2020-10-25 21:54:14,485 INFO L274 CegarLoopResult]: For program point L59-2(line 59) no Hoare annotation was computed. [2020-10-25 21:54:14,485 INFO L270 CegarLoopResult]: At program point L59-3(lines 52 60) the Hoare annotation is: (and (= (_ +zero 11 53) |ULTIMATE.start_fmax_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmax_double_~y) (= (fp.neg (_ +zero 11 53)) ULTIMATE.start_fmax_double_~x) (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0) (= (_ +zero 11 53) (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|))))) (= (_ +zero 11 53) ULTIMATE.start___fpclassify_double_~x)) [2020-10-25 21:54:14,493 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,494 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,503 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,508 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,509 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,511 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,512 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,513 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,517 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,524 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 09:54:14 BoogieIcfgContainer [2020-10-25 21:54:14,524 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 21:54:14,525 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 21:54:14,525 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 21:54:14,525 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 21:54:14,526 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 09:54:08" (3/4) ... [2020-10-25 21:54:14,530 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-10-25 21:54:14,544 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2020-10-25 21:54:14,545 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2020-10-25 21:54:14,545 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-10-25 21:54:14,546 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-10-25 21:54:14,577 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_1_3 : bv64 :: v_skolemized_v_prenex_1_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == y) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(0bv32 == \result) [2020-10-25 21:54:14,578 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x [2020-10-25 21:54:14,578 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() [2020-10-25 21:54:14,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_v_prenex_5_3[63:32])) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() [2020-10-25 21:54:14,579 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result) [2020-10-25 21:54:14,614 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 21:54:14,614 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 21:54:14,617 INFO L168 Benchmark]: Toolchain (without parser) took 7267.92 ms. Allocated memory was 41.9 MB in the beginning and 75.5 MB in the end (delta: 33.6 MB). Free memory was 18.5 MB in the beginning and 40.1 MB in the end (delta: -21.6 MB). Peak memory consumption was 15.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,618 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 41.9 MB. Free memory was 28.4 MB in the beginning and 28.4 MB in the end (delta: 30.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 21:54:14,619 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.29 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.9 MB in the beginning and 28.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,619 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.96 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 26.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,620 INFO L168 Benchmark]: Boogie Preprocessor took 42.95 ms. Allocated memory is still 52.4 MB. Free memory was 26.5 MB in the beginning and 24.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,621 INFO L168 Benchmark]: RCFGBuilder took 737.43 ms. Allocated memory is still 52.4 MB. Free memory was 24.7 MB in the beginning and 30.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,622 INFO L168 Benchmark]: TraceAbstraction took 5951.50 ms. Allocated memory was 52.4 MB in the beginning and 75.5 MB in the end (delta: 23.1 MB). Free memory was 30.0 MB in the beginning and 44.3 MB in the end (delta: -14.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,622 INFO L168 Benchmark]: Witness Printer took 89.73 ms. Allocated memory is still 75.5 MB. Free memory was 44.3 MB in the beginning and 40.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-10-25 21:54:14,626 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.22 ms. Allocated memory is still 41.9 MB. Free memory was 28.4 MB in the beginning and 28.4 MB in the end (delta: 30.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 355.29 ms. Allocated memory was 41.9 MB in the beginning and 52.4 MB in the end (delta: 10.5 MB). Free memory was 17.9 MB in the beginning and 28.3 MB in the end (delta: -10.4 MB). Peak memory consumption was 3.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 73.96 ms. Allocated memory is still 52.4 MB. Free memory was 28.3 MB in the beginning and 26.5 MB in the end (delta: 1.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 42.95 ms. Allocated memory is still 52.4 MB. Free memory was 26.5 MB in the beginning and 24.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 737.43 ms. Allocated memory is still 52.4 MB. Free memory was 24.7 MB in the beginning and 30.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 6.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5951.50 ms. Allocated memory was 52.4 MB in the beginning and 75.5 MB in the end (delta: 23.1 MB). Free memory was 30.0 MB in the beginning and 44.3 MB in the end (delta: -14.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 16.1 GB. * Witness Printer took 89.73 ms. Allocated memory is still 75.5 MB. Free memory was 44.3 MB in the beginning and 40.1 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[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_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: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant [2020-10-25 21:54:14,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,643 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == y && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x - InvariantResult [Line: 25]: Loop Invariant [2020-10-25 21:54:14,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result) - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == y && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 25]: Loop Invariant [2020-10-25 21:54:14,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] [2020-10-25 21:54:14,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_1_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_1_3 : bv64 :: v_skolemized_v_prenex_1_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_1_3[63:63], v_skolemized_v_prenex_1_3[62:52], v_skolemized_v_prenex_1_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == y) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && !(0bv32 == \result) - InvariantResult [Line: 62]: Loop Invariant [2020-10-25 21:54:14,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,665 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2020-10-25 21:54:14,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((((((~Pluszero~LONGDOUBLE() == \result && aux-res == 0.0 && __signbit_double(res) == 0-aux) && ~Pluszero~LONGDOUBLE() == res) && ~Pluszero~LONGDOUBLE() == y) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]) == ~Pluszero~LONGDOUBLE() && msw == v_skolemized_v_prenex_5_3[63:32])) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && \result == 0bv32) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 52]: Loop Invariant [2020-10-25 21:54:14,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2020-10-25 21:54:14,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((~Pluszero~LONGDOUBLE() == \result && ~Pluszero~LONGDOUBLE() == y) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == x) && (\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: v_skolemized_q#valueAsBitvector_7[63:32] == msw && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]))) && ~Pluszero~LONGDOUBLE() == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 252 SDtfs, 287 SDslu, 527 SDs, 0 SdLazy, 183 SolverSat, 29 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 205 HoareAnnotationTreeSize, 8 FomulaSimplifications, 47 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 35 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 SizeOfPredicates, 38 NumberOfNonLiveVariables, 555 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...