./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_0621b.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 8ead8f92d727e659a3a3e48f3e2a8079f3cda1172b703c6ea18213bf1971d913 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:51:28,408 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:51:28,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:51:28,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:51:28,453 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:51:28,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:51:28,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:51:28,458 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:51:28,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:51:28,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:51:28,465 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:51:28,466 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:51:28,467 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:51:28,469 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:51:28,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:51:28,473 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:51:28,473 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:51:28,474 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:51:28,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:51:28,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:51:28,480 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:51:28,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:51:28,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:51:28,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:51:28,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:51:28,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:51:28,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:51:28,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:51:28,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:51:28,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:51:28,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:51:28,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:51:28,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:51:28,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:51:28,498 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:51:28,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:51:28,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:51:28,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:51:28,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:51:28,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:51:28,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:51:28,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:51:28,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 02:51:28,529 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:51:28,530 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:51:28,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:51:28,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:51:28,532 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:51:28,532 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:51:28,532 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:51:28,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:51:28,533 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:51:28,533 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:51:28,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:51:28,535 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:51:28,535 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:51:28,535 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:51:28,536 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:51:28,536 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:51:28,536 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:51:28,536 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:51:28,537 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:51:28,537 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:51:28,537 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:51:28,537 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:51:28,537 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:51:28,538 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 02:51:28,538 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 02:51:28,538 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:51:28,538 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:51:28,538 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:51:28,539 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 -> 8ead8f92d727e659a3a3e48f3e2a8079f3cda1172b703c6ea18213bf1971d913 [2022-07-12 02:51:28,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:51:28,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:51:28,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:51:28,779 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:51:28,779 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:51:28,780 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2022-07-12 02:51:28,832 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea3c0786/7e8640f2f06b47c3bb720362753eb830/FLAG92312be09 [2022-07-12 02:51:29,214 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:51:29,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2022-07-12 02:51:29,224 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea3c0786/7e8640f2f06b47c3bb720362753eb830/FLAG92312be09 [2022-07-12 02:51:29,608 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ea3c0786/7e8640f2f06b47c3bb720362753eb830 [2022-07-12 02:51:29,610 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:51:29,612 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:51:29,615 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:51:29,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:51:29,618 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:51:29,619 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,620 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127e2ab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29, skipping insertion in model container [2022-07-12 02:51:29,620 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,625 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:51:29,648 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:51:29,806 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c[3713,3726] [2022-07-12 02:51:29,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:51:29,819 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:51:29,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c[3713,3726] [2022-07-12 02:51:29,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:51:29,863 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:51:29,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29 WrapperNode [2022-07-12 02:51:29,863 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:51:29,865 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:51:29,865 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:51:29,865 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:51:29,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,879 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,909 INFO L137 Inliner]: procedures = 18, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 198 [2022-07-12 02:51:29,910 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:51:29,910 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:51:29,911 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:51:29,911 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:51:29,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,921 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,938 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:51:29,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:51:29,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:51:29,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:51:29,940 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (1/1) ... [2022-07-12 02:51:29,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:51:29,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:51:29,973 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:51:29,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:51:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:51:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 02:51:30,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:51:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 02:51:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 02:51:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 02:51:30,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:51:30,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:51:30,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 02:51:30,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-12 02:51:30,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:51:30,092 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:51:30,094 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:51:30,333 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:51:30,339 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:51:30,340 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 02:51:30,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:30 BoogieIcfgContainer [2022-07-12 02:51:30,341 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:51:30,343 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:51:30,343 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:51:30,347 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:51:30,348 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:51:29" (1/3) ... [2022-07-12 02:51:30,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4170c44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:51:30, skipping insertion in model container [2022-07-12 02:51:30,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:29" (2/3) ... [2022-07-12 02:51:30,349 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4170c44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:51:30, skipping insertion in model container [2022-07-12 02:51:30,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:30" (3/3) ... [2022-07-12 02:51:30,350 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2022-07-12 02:51:30,363 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:51:30,364 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:51:30,409 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:51:30,423 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2956b605, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@196855aa [2022-07-12 02:51:30,429 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:51:30,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:51:30,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:30,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:30,442 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:30,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash -892626393, now seen corresponding path program 1 times [2022-07-12 02:51:30,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:51:30,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158026278] [2022-07-12 02:51:30,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:51:30,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:30,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:51:30,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158026278] [2022-07-12 02:51:30,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158026278] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:30,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:30,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:51:30,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253793758] [2022-07-12 02:51:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:30,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:51:30,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:51:30,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:51:30,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:51:30,642 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.7142857142857142) internal successors, (60), 36 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:30,661 INFO L93 Difference]: Finished difference Result 72 states and 118 transitions. [2022-07-12 02:51:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:51:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 02:51:30,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:30,669 INFO L225 Difference]: With dead ends: 72 [2022-07-12 02:51:30,670 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 02:51:30,673 INFO L412 NwaCegarLoop]: 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 [2022-07-12 02:51:30,675 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:30,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:51:30,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 02:51:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 02:51:30,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.393939393939394) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 46 transitions. [2022-07-12 02:51:30,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 46 transitions. Word has length 10 [2022-07-12 02:51:30,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:30,705 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 46 transitions. [2022-07-12 02:51:30,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 46 transitions. [2022-07-12 02:51:30,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:51:30,706 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:30,706 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:30,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 02:51:30,707 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:30,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:30,708 INFO L85 PathProgramCache]: Analyzing trace with hash -1491067403, now seen corresponding path program 1 times [2022-07-12 02:51:30,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:51:30,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444727722] [2022-07-12 02:51:30,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:30,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:51:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:30,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:30,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 02:51:30,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444727722] [2022-07-12 02:51:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444727722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:30,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:30,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 02:51:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567459850] [2022-07-12 02:51:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:30,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 02:51:30,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 02:51:30,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 02:51:30,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:51:30,801 INFO L87 Difference]: Start difference. First operand 34 states and 46 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:30,860 INFO L93 Difference]: Finished difference Result 69 states and 92 transitions. [2022-07-12 02:51:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 02:51:30,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:51:30,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:30,862 INFO L225 Difference]: With dead ends: 69 [2022-07-12 02:51:30,863 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 02:51:30,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 02:51:30,865 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 15 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:30,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 71 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:51:30,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 02:51:30,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 37. [2022-07-12 02:51:30,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-07-12 02:51:30,877 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 12 [2022-07-12 02:51:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:30,878 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-07-12 02:51:30,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-07-12 02:51:30,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:51:30,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:30,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:30,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 02:51:30,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:30,883 INFO L85 PathProgramCache]: Analyzing trace with hash -986491366, now seen corresponding path program 1 times [2022-07-12 02:51:30,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 02:51:30,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917624891] [2022-07-12 02:51:30,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:30,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 02:51:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:51:30,941 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 02:51:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 02:51:31,012 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 02:51:31,019 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 02:51:31,020 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:51:31,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 02:51:31,027 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-12 02:51:31,030 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:51:31,078 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:51:31 BoogieIcfgContainer [2022-07-12 02:51:31,079 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:51:31,079 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:51:31,079 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:51:31,079 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:51:31,080 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:30" (3/4) ... [2022-07-12 02:51:31,082 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 02:51:31,082 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:51:31,082 INFO L158 Benchmark]: Toolchain (without parser) took 1470.36ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 59.5MB in the beginning and 68.2MB in the end (delta: -8.8MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,083 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:51:31,083 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.32ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 59.3MB in the beginning and 91.0MB in the end (delta: -31.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.32ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,084 INFO L158 Benchmark]: Boogie Preprocessor took 27.33ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,085 INFO L158 Benchmark]: RCFGBuilder took 403.07ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 72.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,085 INFO L158 Benchmark]: TraceAbstraction took 735.58ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 68.8MB in the end (delta: 3.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,086 INFO L158 Benchmark]: Witness Printer took 2.49ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 68.2MB in the end (delta: 577.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 02:51:31,088 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.20ms. Allocated memory is still 88.1MB. Free memory is still 52.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.32ms. Allocated memory was 88.1MB in the beginning and 117.4MB in the end (delta: 29.4MB). Free memory was 59.3MB in the beginning and 91.0MB in the end (delta: -31.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.32ms. Allocated memory is still 117.4MB. Free memory was 91.0MB in the beginning and 88.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.33ms. Allocated memory is still 117.4MB. Free memory was 88.9MB in the beginning and 86.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 403.07ms. Allocated memory is still 117.4MB. Free memory was 86.7MB in the beginning and 72.5MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 735.58ms. Allocated memory is still 117.4MB. Free memory was 71.8MB in the beginning and 68.8MB in the end (delta: 3.0MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. * Witness Printer took 2.49ms. Allocated memory is still 117.4MB. Free memory was 68.8MB in the beginning and 68.2MB in the end (delta: 577.4kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 147]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 146, overapproximation of someUnaryDOUBLEoperation at line 54, overapproximation of someBinaryArithmeticDOUBLEoperation at line 143. Possible FailurePath: [L39-L44] static const double atanhi_atan[] = { 4.63647609000806093515e-01, 7.85398163397448278999e-01, 9.82793723247329054082e-01, 1.57079632679489655800e+00, }; [L46-L51] static const double atanlo_atan[] = { 2.26987774529616870924e-17, 3.06161699786838301793e-17, 1.39033110312309984516e-17, 6.12323399573676603587e-17, }; [L53-L60] static const double aT_atan[] = { 3.33333333333329318027e-01, -1.99999999998764832476e-01, 1.42857142725034663711e-01, -1.11111104054623557880e-01, 9.09088713343650656196e-02, -7.69187620504482999495e-02, 6.66107313738753120669e-02, -5.83357013379057348645e-02, 4.97687799461593236017e-02, -3.65315727442169155270e-02, 1.62858201153657823623e-02, }; [L62-L64] static const double one_atan = 1.0, pi_o_4 = 7.8539816339744827900E-01, pi_o_2 = 1.5707963267948965580E+00, pi = 3.1415926535897931160E+00, huge_atan = 1.0e300; VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000] [L143] double x = -1.0 / 0.0; [L144] CALL, EXPR atan_double(x) [L67] double w, s1, s2, z; [L68] __int32_t ix, hx, id; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L71] ieee_double_shape_type gh_u; [L72] gh_u.value = (x) [L73] EXPR gh_u.parts.msw [L73] (hx) = gh_u.parts.msw [L75] ix = hx & 0x7fffffff VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L76] COND FALSE !(ix >= 0x44100000) VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L90] COND TRUE ix < 0x3fdc0000 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L91] COND TRUE ix < 0x3e200000 VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L92] COND TRUE huge_atan + x > one_atan [L93] return x; VAL [\old(x)=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, \result=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, hx=0, ix=0, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L144] RET, EXPR atan_double(x) [L144] double res = atan_double(x); [L146] COND TRUE res != -pi_o_2 VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] [L147] reach_error() VAL [aT_atan={6:0}, atanhi_atan={4:0}, atanlo_atan={5:0}, huge_atan=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000, one_atan=1, pi=785398163397448279/250000000000000000, pi_o_2=785398163397448279/500000000000000000, pi_o_4=785398163397448279/1000000000000000000, res=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002, x=1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000002] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 28 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 92 mSDtfsCounter, 20 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=0, InterpolantAutomatonStates: 5, 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, 2 MinimizatonAttempts, 10 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 22 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 [2022-07-12 02:51:31,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_0621b.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 8ead8f92d727e659a3a3e48f3e2a8079f3cda1172b703c6ea18213bf1971d913 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 02:51:33,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 02:51:33,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 02:51:33,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 02:51:33,126 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 02:51:33,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 02:51:33,128 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 02:51:33,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 02:51:33,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 02:51:33,135 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 02:51:33,136 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 02:51:33,139 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 02:51:33,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 02:51:33,141 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 02:51:33,143 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 02:51:33,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 02:51:33,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 02:51:33,145 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 02:51:33,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 02:51:33,153 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 02:51:33,154 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 02:51:33,158 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 02:51:33,159 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 02:51:33,160 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 02:51:33,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 02:51:33,164 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 02:51:33,167 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 02:51:33,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 02:51:33,168 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 02:51:33,168 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 02:51:33,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 02:51:33,169 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 02:51:33,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 02:51:33,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 02:51:33,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 02:51:33,173 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 02:51:33,173 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 02:51:33,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 02:51:33,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 02:51:33,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 02:51:33,174 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 02:51:33,179 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 02:51:33,180 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 02:51:33,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 02:51:33,209 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 02:51:33,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 02:51:33,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 02:51:33,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 02:51:33,210 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 02:51:33,211 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 02:51:33,211 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 02:51:33,211 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 02:51:33,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 02:51:33,212 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 02:51:33,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 02:51:33,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 02:51:33,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 02:51:33,219 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 02:51:33,220 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 02:51:33,220 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 02:51:33,220 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 02:51:33,220 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 02:51:33,220 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 02:51:33,221 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 02:51:33,221 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 02:51:33,221 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 02:51:33,221 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 02:51:33,222 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 02:51:33,222 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 02:51:33,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:51:33,222 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 02:51:33,222 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 02:51:33,223 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 02:51:33,223 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 02:51:33,223 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 02:51:33,223 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 02:51:33,224 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 02:51:33,224 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 02:51:33,224 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 02:51:33,224 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 -> 8ead8f92d727e659a3a3e48f3e2a8079f3cda1172b703c6ea18213bf1971d913 [2022-07-12 02:51:33,534 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 02:51:33,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 02:51:33,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 02:51:33,552 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 02:51:33,553 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 02:51:33,554 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2022-07-12 02:51:33,606 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba52e9967/e4e38377df07493ca9604e6002b7ac0e/FLAGd389b07f2 [2022-07-12 02:51:34,053 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 02:51:34,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c [2022-07-12 02:51:34,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba52e9967/e4e38377df07493ca9604e6002b7ac0e/FLAGd389b07f2 [2022-07-12 02:51:34,082 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba52e9967/e4e38377df07493ca9604e6002b7ac0e [2022-07-12 02:51:34,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 02:51:34,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 02:51:34,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 02:51:34,092 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 02:51:34,095 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 02:51:34,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,097 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12cb2d51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34, skipping insertion in model container [2022-07-12 02:51:34,097 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 02:51:34,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 02:51:34,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c[3713,3726] [2022-07-12 02:51:34,283 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:51:34,320 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 02:51:34,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0621b.c[3713,3726] [2022-07-12 02:51:34,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 02:51:34,371 INFO L208 MainTranslator]: Completed translation [2022-07-12 02:51:34,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34 WrapperNode [2022-07-12 02:51:34,372 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 02:51:34,373 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 02:51:34,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 02:51:34,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 02:51:34,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,425 INFO L137 Inliner]: procedures = 21, calls = 65, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 187 [2022-07-12 02:51:34,429 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 02:51:34,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 02:51:34,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 02:51:34,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 02:51:34,439 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,462 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,488 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 02:51:34,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 02:51:34,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 02:51:34,508 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 02:51:34,509 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (1/1) ... [2022-07-12 02:51:34,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 02:51:34,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 02:51:34,535 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 02:51:34,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 02:51:34,569 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2022-07-12 02:51:34,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 02:51:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 02:51:34,571 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 02:51:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 02:51:34,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 02:51:34,694 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 02:51:34,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 02:51:50,415 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 02:51:50,420 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 02:51:50,420 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 02:51:50,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:50 BoogieIcfgContainer [2022-07-12 02:51:50,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 02:51:50,423 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 02:51:50,423 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 02:51:50,425 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 02:51:50,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 02:51:34" (1/3) ... [2022-07-12 02:51:50,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbf7be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:51:50, skipping insertion in model container [2022-07-12 02:51:50,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 02:51:34" (2/3) ... [2022-07-12 02:51:50,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fbf7be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 02:51:50, skipping insertion in model container [2022-07-12 02:51:50,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:50" (3/3) ... [2022-07-12 02:51:50,427 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0621b.c [2022-07-12 02:51:50,437 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 02:51:50,437 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 02:51:50,476 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 02:51:50,481 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7aedc5d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b45fe48 [2022-07-12 02:51:50,482 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 02:51:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 02:51:50,489 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:50,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:50,490 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:50,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:50,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1035664421, now seen corresponding path program 1 times [2022-07-12 02:51:50,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:51:50,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477970140] [2022-07-12 02:51:50,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:50,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:51:50,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:51:50,506 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:51:50,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 02:51:50,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:50,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 02:51:50,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:51:50,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:50,828 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:51:50,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:51:50,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477970140] [2022-07-12 02:51:50,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477970140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:50,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:50,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 02:51:50,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580321078] [2022-07-12 02:51:50,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:50,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 02:51:50,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:51:50,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 02:51:50,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:51:50,870 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.65625) internal successors, (53), 33 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:50,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:50,892 INFO L93 Difference]: Finished difference Result 66 states and 104 transitions. [2022-07-12 02:51:50,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 02:51:50,894 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 02:51:50,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:50,903 INFO L225 Difference]: With dead ends: 66 [2022-07-12 02:51:50,903 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 02:51:50,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 02:51:50,911 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:50,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 02:51:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 02:51:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 02:51:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:50,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-07-12 02:51:50,949 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2022-07-12 02:51:50,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:50,949 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-07-12 02:51:50,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-07-12 02:51:50,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:51:50,952 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:50,952 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:50,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-12 02:51:51,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:51:51,153 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1843594333, now seen corresponding path program 1 times [2022-07-12 02:51:51,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:51:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1627706460] [2022-07-12 02:51:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:51,164 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:51:51,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:51:51,166 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:51:51,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 02:51:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:51,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 02:51:51,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:51:52,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 02:51:54,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-12 02:51:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:54,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:51:54,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:51:54,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1627706460] [2022-07-12 02:51:54,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1627706460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:54,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:54,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 02:51:54,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501972937] [2022-07-12 02:51:54,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:54,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:51:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:51:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:51:54,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:51:54,957 INFO L87 Difference]: Start difference. First operand 31 states and 41 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:54,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:54,968 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2022-07-12 02:51:54,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:51:54,969 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:51:54,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:54,970 INFO L225 Difference]: With dead ends: 35 [2022-07-12 02:51:54,973 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 02:51:54,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-12 02:51:54,975 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:54,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 96 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 58 Unchecked, 0.0s Time] [2022-07-12 02:51:54,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 02:51:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 02:51:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:54,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-12 02:51:54,983 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 12 [2022-07-12 02:51:54,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:54,983 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-12 02:51:54,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:54,984 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-12 02:51:54,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 02:51:54,985 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:54,985 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:55,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 02:51:55,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:51:55,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:55,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:55,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1339018296, now seen corresponding path program 1 times [2022-07-12 02:51:55,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:51:55,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011660901] [2022-07-12 02:51:55,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:55,193 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:51:55,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:51:55,194 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:51:55,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 02:51:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:55,495 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 02:51:55,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:51:56,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:56,707 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:51:56,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:51:56,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011660901] [2022-07-12 02:51:56,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011660901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:56,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:56,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:51:56,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585144917] [2022-07-12 02:51:56,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:56,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 02:51:56,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:51:56,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 02:51:56,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:51:56,710 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:56,713 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-12 02:51:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 02:51:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 02:51:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:56,714 INFO L225 Difference]: With dead ends: 35 [2022-07-12 02:51:56,714 INFO L226 Difference]: Without dead ends: 14 [2022-07-12 02:51:56,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 02:51:56,716 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:56,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-12 02:51:56,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-12 02:51:56,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-12 02:51:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:56,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-07-12 02:51:56,721 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-07-12 02:51:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:56,722 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-07-12 02:51:56,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:56,722 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-07-12 02:51:56,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 02:51:56,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:56,722 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:56,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 02:51:56,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:51:56,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:56,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:56,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1317358715, now seen corresponding path program 1 times [2022-07-12 02:51:56,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:51:56,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676505600] [2022-07-12 02:51:56,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:56,925 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:51:56,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:51:56,927 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:51:56,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 02:51:57,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:57,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 02:51:57,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:51:58,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:51:58,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:51:58,593 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:51:58,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676505600] [2022-07-12 02:51:58,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676505600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:51:58,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:51:58,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 02:51:58,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51561046] [2022-07-12 02:51:58,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:51:58,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 02:51:58,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:51:58,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 02:51:58,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 02:51:58,595 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:51:58,597 INFO L93 Difference]: Finished difference Result 18 states and 17 transitions. [2022-07-12 02:51:58,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 02:51:58,597 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 02:51:58,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:51:58,597 INFO L225 Difference]: With dead ends: 18 [2022-07-12 02:51:58,598 INFO L226 Difference]: Without dead ends: 14 [2022-07-12 02:51:58,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 02:51:58,599 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:51:58,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-07-12 02:51:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-12 02:51:58,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-12 02:51:58,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0) internal successors, (13), 13 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:58,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 13 transitions. [2022-07-12 02:51:58,603 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 13 transitions. Word has length 13 [2022-07-12 02:51:58,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:51:58,603 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 13 transitions. [2022-07-12 02:51:58,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:51:58,603 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 13 transitions. [2022-07-12 02:51:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 02:51:58,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 02:51:58,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 02:51:58,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 02:51:58,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:51:58,820 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 02:51:58,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 02:51:58,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1317299133, now seen corresponding path program 1 times [2022-07-12 02:51:58,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 02:51:58,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443905064] [2022-07-12 02:51:58,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 02:51:58,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 02:51:58,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 02:51:58,822 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 02:51:58,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 02:51:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 02:51:59,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-12 02:51:59,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 02:52:01,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:52:01,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:52:01,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-07-12 02:52:02,776 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-07-12 02:52:02,776 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 39 [2022-07-12 02:52:05,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:52:05,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 02:52:05,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 40 [2022-07-12 02:52:08,548 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-07-12 02:52:08,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 44 [2022-07-12 02:52:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 02:52:12,893 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 02:52:12,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 02:52:12,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443905064] [2022-07-12 02:52:12,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443905064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 02:52:12,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 02:52:12,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 02:52:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777215581] [2022-07-12 02:52:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 02:52:12,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 02:52:12,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 02:52:12,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 02:52:12,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=18, Unknown=2, NotChecked=0, Total=30 [2022-07-12 02:52:12,895 INFO L87 Difference]: Start difference. First operand 14 states and 13 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:52:12,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 02:52:12,898 INFO L93 Difference]: Finished difference Result 14 states and 13 transitions. [2022-07-12 02:52:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 02:52:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-12 02:52:12,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 02:52:12,899 INFO L225 Difference]: With dead ends: 14 [2022-07-12 02:52:12,899 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 02:52:12,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=10, Invalid=18, Unknown=2, NotChecked=0, Total=30 [2022-07-12 02:52:12,900 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 3 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 02:52:12,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 18 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-12 02:52:12,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 02:52:12,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 02:52:12,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:52:12,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 02:52:12,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2022-07-12 02:52:12,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 02:52:12,903 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 02:52:12,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 02:52:12,903 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 02:52:12,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 02:52:12,906 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 02:52:12,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 02:52:13,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 02:52:13,126 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 88) no Hoare annotation was computed. [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 82) no Hoare annotation was computed. [2022-07-12 02:52:15,288 INFO L895 garLoopResultBuilder]: At program point L78-2(lines 78 82) the Hoare annotation is: (and (= |~#atanlo_atan~0.base| (_ bv5 32)) (exists ((|v_skolemized_q#valueAsBitvector_23| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_23|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_23|)) (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_23|) |ULTIMATE.start_atan_double_~hx~0#1|))) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (select |#valid| (_ bv5 32)) (_ bv1 1)) (exists ((v_skolemized_v_prenex_11_8 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_11_8) ((_ extract 62 52) v_skolemized_v_prenex_11_8) ((_ extract 51 0) v_skolemized_v_prenex_11_8)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 63 32) v_skolemized_v_prenex_11_8) (select .cse0 (bvadd (_ bv28 32) |~#atanhi_atan~0.offset|))) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_skolemized_v_prenex_11_8))))) (exists ((v_skolemized_v_prenex_3_8 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_3_8) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd (_ bv28 32) |~#atanlo_atan~0.offset|))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_8) ((_ extract 62 52) v_skolemized_v_prenex_3_8) ((_ extract 51 0) v_skolemized_v_prenex_3_8)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (= (select |#valid| (_ bv4 32)) (_ bv1 1)) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_atan_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53)))) (exists ((|v_skolemized_q#valueAsBitvector_15| (_ BitVec 64)) (|v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6| (_ BitVec 32))) (let ((.cse1 (select (select |#memory_int| |v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6|) (_ bv4 32)))) (and (= |ULTIMATE.start_atan_double_~x#1| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_15|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_15|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_15|))) (= .cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_15|)) (= (bvand (_ bv2147483647 32) .cse1) |ULTIMATE.start_atan_double_~ix~0#1|))))) [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:52:15,288 INFO L899 garLoopResultBuilder]: For program point L70-1(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L895 garLoopResultBuilder]: At program point L70-2(lines 70 74) the Hoare annotation is: (and (= |~#atanlo_atan~0.base| (_ bv5 32)) (= ~pi_o_2~0 ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= (_ bv4 32) |~#atanhi_atan~0.base|) (= (select |#valid| (_ bv5 32)) (_ bv1 1)) (exists ((v_skolemized_v_prenex_11_8 (_ BitVec 64))) (let ((.cse0 (select |#memory_int| |~#atanhi_atan~0.base|))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_11_8) ((_ extract 62 52) v_skolemized_v_prenex_11_8) ((_ extract 51 0) v_skolemized_v_prenex_11_8)) ((_ to_fp 11 53) currentRoundingMode (/ 785398163397448279.0 500000000000000000.0))) (= ((_ extract 63 32) v_skolemized_v_prenex_11_8) (select .cse0 (bvadd (_ bv28 32) |~#atanhi_atan~0.offset|))) (= (select .cse0 (bvadd |~#atanhi_atan~0.offset| (_ bv24 32))) ((_ extract 31 0) v_skolemized_v_prenex_11_8))))) (exists ((v_skolemized_v_prenex_3_8 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_3_8) (select (select |#memory_int| |~#atanlo_atan~0.base|) (bvadd (_ bv28 32) |~#atanlo_atan~0.offset|))) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_8) ((_ extract 62 52) v_skolemized_v_prenex_3_8) ((_ extract 51 0) v_skolemized_v_prenex_3_8)) ((_ to_fp 11 53) currentRoundingMode (/ 612323399573676603587.0 10000000000000000000000000000000000000.0))))) (= (select |#valid| (_ bv4 32)) (_ bv1 1)) (= currentRoundingMode roundNearestTiesToEven) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start_atan_double_~x#1| (fp.div currentRoundingMode (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0)) (_ +zero 11 53))))) [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L70-3(lines 70 74) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L128(lines 128 133) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L21-1(lines 21 25) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 25) the Hoare annotation is: false [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L146(lines 146 149) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L147(line 147) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L98(lines 98 114) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L895 garLoopResultBuilder]: At program point L32(lines 19 33) the Hoare annotation is: false [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 02:52:15,289 INFO L899 garLoopResultBuilder]: For program point L90(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point L107(lines 107 113) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point L107-2(lines 90 115) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point L99(lines 99 105) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point L132-2(line 132) no Hoare annotation was computed. [2022-07-12 02:52:15,290 INFO L895 garLoopResultBuilder]: At program point L132-3(lines 66 134) the Hoare annotation is: (and (= ~pi_o_2~0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (exists ((v_skolemized_v_prenex_3_8 (_ BitVec 64)) (v_arrayElimCell_12 (_ BitVec 32)) (v_skolemized_v_prenex_11_8 (_ BitVec 64))) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_11_8) ((_ extract 62 52) v_skolemized_v_prenex_11_8) ((_ extract 51 0) v_skolemized_v_prenex_11_8)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 785398163397448279.0 500000000000000000.0))) (= (fp.sub roundNearestTiesToEven (fp.neg (let ((.cse0 (concat ((_ extract 63 32) v_skolemized_v_prenex_11_8) ((_ extract 31 0) v_skolemized_v_prenex_11_8)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0)))) (let ((.cse1 (concat ((_ extract 63 32) v_skolemized_v_prenex_3_8) v_arrayElimCell_12))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))) |ULTIMATE.start_atan_double_#res#1|) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_3_8) ((_ extract 62 52) v_skolemized_v_prenex_3_8) ((_ extract 51 0) v_skolemized_v_prenex_3_8)) ((_ to_fp 11 53) roundNearestTiesToEven (/ 612323399573676603587.0 10000000000000000000000000000000000000.0)))))) [2022-07-12 02:52:15,290 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L91(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L91-2(lines 91 94) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L92(lines 92 93) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 19 33) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L26-2(lines 26 31) no Hoare annotation was computed. [2022-07-12 02:52:15,291 INFO L902 garLoopResultBuilder]: At program point L150(lines 136 151) the Hoare annotation is: true [2022-07-12 02:52:15,291 INFO L899 garLoopResultBuilder]: For program point L76(lines 76 89) no Hoare annotation was computed. [2022-07-12 02:52:15,293 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2022-07-12 02:52:15,294 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 02:52:15,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,301 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,302 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,303 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,305 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,305 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,310 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,311 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,312 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,315 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,315 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,315 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,315 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,316 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,317 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,318 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,319 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,320 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,321 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,322 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,323 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,324 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,327 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,327 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,328 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,329 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,344 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,344 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,344 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,345 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,350 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,350 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,350 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,351 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,352 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,353 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,353 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,353 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,353 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,353 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 02:52:15 BoogieIcfgContainer [2022-07-12 02:52:15,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 02:52:15,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 02:52:15,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 02:52:15,356 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 02:52:15,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 02:51:50" (3/4) ... [2022-07-12 02:52:15,359 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 02:52:15,372 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-07-12 02:52:15,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 02:52:15,373 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 02:52:15,374 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 02:52:15,397 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((atanlo_atan == 5bv32 && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && 4bv32 == atanhi_atan) && \valid[5bv32] == 1bv1) && (\exists v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000) && v_skolemized_v_prenex_11_8[63:32] == unknown-#memory_int-unknown[atanhi_atan][~bvadd64(28bv32, atanhi_atan)]) && unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 24bv32)] == v_skolemized_v_prenex_11_8[31:0])) && (\exists v_skolemized_v_prenex_3_8 : bv64 :: v_skolemized_v_prenex_3_8[63:32] == unknown-#memory_int-unknown[atanlo_atan][~bvadd64(28bv32, atanlo_atan)] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 612323399573676603587/10000000000000000000000000000000000000))) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) [2022-07-12 02:52:15,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((atanlo_atan == 5bv32 && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_23[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && 4bv32 == atanhi_atan) && \valid[5bv32] == 1bv1) && (\exists v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000) && v_skolemized_v_prenex_11_8[63:32] == unknown-#memory_int-unknown[atanhi_atan][~bvadd64(28bv32, atanhi_atan)]) && unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 24bv32)] == v_skolemized_v_prenex_11_8[31:0])) && (\exists v_skolemized_v_prenex_3_8 : bv64 :: v_skolemized_v_prenex_3_8[63:32] == unknown-#memory_int-unknown[atanlo_atan][~bvadd64(28bv32, atanlo_atan)] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 612323399573676603587/10000000000000000000000000000000000000))) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_15 : bv64, v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6 : bv32 :: (x == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_15[63:63], v_skolemized_q#valueAsBitvector_15[62:52], v_skolemized_q#valueAsBitvector_15[51:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_15[63:32]) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6][4bv32]) == ix) [2022-07-12 02:52:15,398 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) && (\exists v_skolemized_v_prenex_3_8 : bv64, v_arrayElimCell_12 : bv32, v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~fp~LONGDOUBLE((v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[63:63], (v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[62:52], (v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[51:0])), ~fp~LONGDOUBLE((v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[63:63], (v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[62:52], (v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[51:0])) == \result) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 612323399573676603587/10000000000000000000000000000000000000)) [2022-07-12 02:52:15,420 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 02:52:15,420 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 02:52:15,421 INFO L158 Benchmark]: Toolchain (without parser) took 41335.29ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.9MB in the beginning and 44.0MB in the end (delta: -11.1MB). Peak memory consumption was 2.5MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,421 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:52:15,421 INFO L158 Benchmark]: CACSL2BoogieTranslator took 281.21ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.7MB in the beginning and 48.8MB in the end (delta: -16.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,422 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.14ms. Allocated memory is still 69.2MB. Free memory was 48.8MB in the beginning and 46.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 02:52:15,422 INFO L158 Benchmark]: Boogie Preprocessor took 72.89ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 44.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,422 INFO L158 Benchmark]: RCFGBuilder took 15914.51ms. Allocated memory is still 69.2MB. Free memory was 44.1MB in the beginning and 39.9MB in the end (delta: 4.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,422 INFO L158 Benchmark]: TraceAbstraction took 24931.86ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 48.2MB in the end (delta: -8.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,423 INFO L158 Benchmark]: Witness Printer took 64.96ms. Allocated memory is still 69.2MB. Free memory was 48.2MB in the beginning and 44.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 02:52:15,425 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.16ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.3MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 281.21ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 32.7MB in the beginning and 48.8MB in the end (delta: -16.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.14ms. Allocated memory is still 69.2MB. Free memory was 48.8MB in the beginning and 46.4MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 72.89ms. Allocated memory is still 69.2MB. Free memory was 46.4MB in the beginning and 44.3MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 15914.51ms. Allocated memory is still 69.2MB. Free memory was 44.1MB in the beginning and 39.9MB in the end (delta: 4.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 24931.86ms. Allocated memory is still 69.2MB. Free memory was 39.6MB in the beginning and 48.2MB in the end (delta: -8.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Witness Printer took 64.96ms. Allocated memory is still 69.2MB. Free memory was 48.2MB in the beginning and 44.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 147]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 24.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 80 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 105 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 23, 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, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 10 NumberOfFragments, 304 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 19.7s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 55 ConstructedInterpolants, 30 QuantifiedInterpolants, 1342 SizeOfPredicates, 30 NumberOfNonLiveVariables, 601 ConjunctsInSsa, 54 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 70]: Loop Invariant [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,455 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,456 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,456 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,457 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,460 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,460 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,460 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,461 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,462 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,462 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (((((((atanlo_atan == 5bv32 && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && 4bv32 == atanhi_atan) && \valid[5bv32] == 1bv1) && (\exists v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000) && v_skolemized_v_prenex_11_8[63:32] == unknown-#memory_int-unknown[atanhi_atan][~bvadd64(28bv32, atanhi_atan)]) && unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 24bv32)] == v_skolemized_v_prenex_11_8[31:0])) && (\exists v_skolemized_v_prenex_3_8 : bv64 :: v_skolemized_v_prenex_3_8[63:32] == unknown-#memory_int-unknown[atanlo_atan][~bvadd64(28bv32, atanlo_atan)] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 612323399573676603587/10000000000000000000000000000000000000))) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 78]: Loop Invariant [2022-07-12 02:52:15,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,463 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,464 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,465 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,466 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,467 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_23,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,468 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,469 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,470 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,471 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 02:52:15,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,471 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] [2022-07-12 02:52:15,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_15,QUANTIFIED] [2022-07-12 02:52:15,472 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6,QUANTIFIED] Derived loop invariant: (((((((((atanlo_atan == 5bv32 && (\exists v_skolemized_q#valueAsBitvector_23 : bv64, currentRoundingMode : FloatRoundingMode :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_23[63:63], v_skolemized_q#valueAsBitvector_23[62:52], v_skolemized_q#valueAsBitvector_23[51:0]) == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_23[63:32] == hx)) && pi_o_2 == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000)) && 4bv32 == atanhi_atan) && \valid[5bv32] == 1bv1) && (\exists v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 785398163397448279/500000000000000000) && v_skolemized_v_prenex_11_8[63:32] == unknown-#memory_int-unknown[atanhi_atan][~bvadd64(28bv32, atanhi_atan)]) && unknown-#memory_int-unknown[atanhi_atan][~bvadd64(atanhi_atan, 24bv32)] == v_skolemized_v_prenex_11_8[31:0])) && (\exists v_skolemized_v_prenex_3_8 : bv64 :: v_skolemized_v_prenex_3_8[63:32] == unknown-#memory_int-unknown[atanlo_atan][~bvadd64(28bv32, atanlo_atan)] && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 612323399573676603587/10000000000000000000000000000000000000))) && \valid[4bv32] == 1bv1) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~fp.div~DOUBLE(currentRoundingMode, ~fp.neg~DOUBLE(~to_fp~LONGDOUBLE(currentRoundingMode, 1.0)), ~Pluszero~LONGDOUBLE()))) && (\exists v_skolemized_q#valueAsBitvector_15 : bv64, v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6 : bv32 :: (x == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_15[63:63], v_skolemized_q#valueAsBitvector_15[62:52], v_skolemized_q#valueAsBitvector_15[51:0]) && unknown-#memory_int-unknown[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6][4bv32] == v_skolemized_q#valueAsBitvector_15[63:32]) && ~bvand32(2147483647bv32, unknown-#memory_int-unknown[v_ULTIMATE.start_atan_double_~#gh_u~1#1.base_6][4bv32]) == ix) - InvariantResult [Line: 66]: Loop Invariant [2022-07-12 02:52:15,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,475 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,475 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,476 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,477 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,478 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,478 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,478 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,478 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,479 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,479 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,480 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_11_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,481 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_12,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,482 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_3_8,QUANTIFIED] [2022-07-12 02:52:15,483 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: pi_o_2 == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) && (\exists v_skolemized_v_prenex_3_8 : bv64, v_arrayElimCell_12 : bv32, v_skolemized_v_prenex_11_8 : bv64 :: (~fp~LONGDOUBLE(v_skolemized_v_prenex_11_8[63:63], v_skolemized_v_prenex_11_8[62:52], v_skolemized_v_prenex_11_8[51:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 785398163397448279/500000000000000000) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~fp.neg~DOUBLE(~fp~LONGDOUBLE((v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[63:63], (v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[62:52], (v_skolemized_v_prenex_11_8[63:32] ++ v_skolemized_v_prenex_11_8[31:0])[51:0])), ~fp~LONGDOUBLE((v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[63:63], (v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[62:52], (v_skolemized_v_prenex_3_8[63:32] ++ v_arrayElimCell_12)[51:0])) == \result) && ~fp~LONGDOUBLE(v_skolemized_v_prenex_3_8[63:63], v_skolemized_v_prenex_3_8[62:52], v_skolemized_v_prenex_3_8[51:0]) == ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 612323399573676603587/10000000000000000000000000000000000000)) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-12 02:52:15,707 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 02:52:15,788 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE